Model Checking Succinct and Parametric One-Counter Automata

DOI10.1007/978-3-642-14162-1_48zbMath1288.68164OpenAlexW1816892670MaRDI QIDQ3587469

Joël Ouaknine, Christoph Haase, Stefan Göller, James Worrell

Publication date: 7 September 2010

Published in: Automata, Languages and Programming (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-14162-1_48

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Specification and verification (program logics, model checking, etc.) (68Q60)

Related Items (8)

Countdown games, and simulation on (succinct) one-counter nets ⋮ Unnamed Item ⋮ Reachability games with relaxed energy constraints ⋮ Small vertex cover makes Petri net coverability and boundedness easier ⋮ Unnamed Item ⋮ On parametric timed automata and one-counter machines ⋮ Unnamed Item ⋮ The Complexity of Flat Freeze LTL

This page was built for publication: Model Checking Succinct and Parametric One-Counter Automata