Abstract Timed-Arc Petri Nets (TAPN) are an extension of the classical P/T nets with
continuous time. Tokens in TAPN carry an age and arcs between places and transitions are …

We consider parity games on infinite graphs where configurations are represented by
control-states and integer vectors. This framework subsumes two classic game problems …

We show how to reliably compute fast-growing functions with timed-arc Petri nets and data
nets. This construction provides ordinal-recursive lower bounds on the complexity of the …

Time dependant models have been intensively studied for many reasons, among others
because of their applications in software verification and due to the development of …

We consider the model of Time Petri Nets where time is associated with transitions. Two
semantics for time elapsing can be considered: the strong one, for which all transitions are …

Bounded timed-arc Petri nets with read-arcs were recently proven equivalent to networks of
timed automata, though the Petri net model cannot express urgent behaviour and the …

Adding real time information to Petri net models often leads to undecidability of classical
verification problems such as reachability and boundedness. For instance, models such as …

We consider priced timed Petri nets, ie, unbounded Petri nets where each token carries a
real-valued clock. Transition arcs are labeled with time intervals, which specify constraints …

We characterize the importance of resources (like counters, channels, or alphabets) when
measuring the expressiveness of Well-Structured Transition Systems (WSTS). We establish …

Charlie is a tool for analyzing place/transition Petri nets. Due to its large number of analyzers
and its transparency of the supported rule system Charlie is not only used in research, but …