Reversal-Bounded Counter Machines Revisited

DOI10.1007/978-3-540-85238-4_26zbMath1173.68562OpenAlexW1835325438MaRDI QIDQ3599138

Arnaud Sangnier, Alain Finkel

Publication date: 3 February 2009

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

Full work available at URL: https://doi.org/10.1007/978-3-540-85238-4_26

Mathematics Subject Classification ID

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

Related Items (7)

The Complexity of Reversal-Bounded Model-Checking ⋮ On selective unboundedness of VASS ⋮ On store languages and applications ⋮ Unboundedness problems for machines with reversal-bounded counters ⋮ Budget-bounded model-checking pushdown systems ⋮ Reachability in Timed Counter Systems ⋮ Dense-choice counter machines revisited

Uses Software

• TREX

This page was built for publication: Reversal-Bounded Counter Machines Revisited