Decidability of weak simulation on one-counter nets
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 …
equivalent to a subclass of one-counter automata with only a weak test for zero. We show …
Decidability of Weak Simulation on One-Counter Nets
P Hofman, R Mayr, P Totzke - Logic in Computer Science …, 2013 - computer.org
One-counter nets 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 …
subclass of one-counter automata with only a weak test for zero. We show that weak …
[PDF][PDF] Decidability of Weak Simulation on One-counter Nets
P Hofman, R Mayr, P Totzke - pure.ed.ac.uk
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 …
equivalent to a subclass of one-counter automata with only a weak test for zero. We show …
[PDF][PDF] Decidability of Weak Simulation on One-counter Nets
P Hofman, R Mayr, P Totzke - arXiv preprint arXiv:1304.4104, 2013 - core.ac.uk
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 …
equivalent to a subclass of one-counter automata with only a weak test for zero. We show …
[PDF][PDF] Decidability of Weak Simulation on One-Counter Nets
P Hofman, R Mayr, P Totzke - 2013 - pdfs.semanticscholar.org
Decidability of Weak Simulation on One-Counter Nets Page 1 Decidability of Weak Simulation
on One-Counter Nets Piotr Hofman1 Richard Mayr2 Patrick Totzke2 University of Warsaw1 …
on One-Counter Nets Piotr Hofman1 Richard Mayr2 Patrick Totzke2 University of Warsaw1 …
Decidability of Weak Simulation on One-Counter Nets
P Hofman, R Mayr, P Totzke - Logic in Computer Science (LICS) …, 2013 - research.ed.ac.uk
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 …
equivalent to a subclass of one-counter automata with only a weak test for zero. We show …
Decidability of Weak Simulation on One-counter Nets
P Hofman, R Mayr, P Totzke - arXiv preprint arXiv:1304.4104, 2013 - arxiv.org
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 …
equivalent to a subclass of one-counter automata with only a weak test for zero. We show …
[PDF][PDF] Decidability of Weak Simulation on One-counter Nets
P Hofman, R Mayr, P Totzke - arXiv preprint arXiv …, 2013 - homepages.inf.ed.ac.uk
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 …
equivalent to a subclass of one-counter automata with only a weak test for zero. We show …
Decidability of Weak Simulation on One-Counter Nets
P Hofman, R Mayr, P Totzke - Proceedings of the 2013 28th Annual …, 2013 - dl.acm.org
One-counter nets 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 …
subclass of one-counter automata with only a weak test for zero. We show that weak …
[PDF][PDF] Decidability of Weak Simulation on One-counter Nets
P Hofman, R Mayr, P Totzke - arXiv preprint arXiv:1304.4104, 2013 - researchgate.net
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 …
equivalent to a subclass of one-counter automata with only a weak test for zero. We show …