On the Relationship between Reachability Problems in Timed and Counter Automata

DOI10.1007/978-3-642-33512-9_6zbMath1328.68112OpenAlexW2128797960MaRDI QIDQ4899143

Christoph Haase, Joël Ouaknine, James Worrell

Publication date: 7 January 2013

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-33512-9_6

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Formal languages and automata (68Q45)

Related Items (4)

Unnamed Item ⋮ On parametric timed automata and one-counter machines ⋮ Reachability in two-clock timed automata is PSPACE-complete ⋮ Continuous One-counter Automata

This page was built for publication: On the Relationship between Reachability Problems in Timed and Counter Automata