52 citations · 206 across the 25 of their papers we have counts for
6 papers · 1 filter
Simulation Over One-counter Nets is PSPACE-Complete
Piotr Hofman, Slawomir Lasota, Richard Mayr +1
One-counter nets (OCN) are Petri nets with exactly one unbounded place. They are equivalent to a subclass of one-counter automata with just a weak test for zero. Unlike many other…
Branching-Time Model Checking Gap-Order Constraint Systems (Extended Version)
Richard Mayr, Patrick Totzke
We consider the model checking problem for Gap-order Constraint Systems (GCS) w.r.t. the branching-time temporal logic CTL, and in particular its fragments EG and EF. GCS are nonde…
Priced Timed Petri Nets
Richard M. Mayr, Parosh Aziz Abdulla
We consider priced timed Petri nets, i.e., unbounded Petri nets where each token carries a real-valued clock. Transition arcs are labeled with time intervals, which specify constra…
Solving Parity Games on Integer Vectors
Parosh Aziz Abdulla, Richard Mayr, Arnaud Sangnier +1
We consider parity games on infinite graphs where configurations are represented by control-states and integer vectors. This framework subsumes two classic game problems: parity ga…
Decidability of Weak Simulation on One-counter Nets
Piotr Hofman, Richard Mayr, Patrick Totzke
One-counter nets (OCN) are Petri nets with exactly one unbounded place. They are equivalent to a subclass of one-counter automata with only a weak test for zero. We show that weak…
Petri Nets with Time and Cost
Parosh Aziz Abdulla, Richard Mayr
We consider timed Petri nets, i.e., unbounded Petri nets where each token carries a real-valued clock. Transition arcs are labeled with time intervals, which specify constraints on…