20 citations · 41 across the 31 of their papers we have counts for
Showing 2013Show all
3 papers · 1 filter
cs.FL2013★ 4 cited
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…
cs.LO2013
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…
cs.FL2013
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…