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 that weak simulation preorder is decidable for OCN and that weak simulation approximants do not converge at level ω, but only at ω...

Celý popis

Podrobná bibliografia

Vydané v:	2013 28th Annual ACM/IEEE Symposium on Logic in Computer Science s. 203 - 212
Hlavní autori:	Hofman, Piotr, Mayr, Richard, Totzke, Patrick
Médium:	Konferenčný príspevok..
Jazyk:	English
Vydavateľské údaje:	IEEE 01.06.2013
Predmet:	Automata Automata theory Computational modeling Educational institutions Games Model checking One-counter machines Radiation detectors Semantics
ISBN:	1479904139, 9781479904136
ISSN:	1043-6871
On-line prístup:	Získať plný text
Tagy:	Pridať tag Žiadne tagy, Buďte prvý, kto otaguje tento záznam!