Mixing Coverability and Reachability to Analyze VASS with One Zero-Test

DOI10.1007/978-3-642-11266-9_33zbMath1274.68230OpenAlexW1486905381MaRDI QIDQ3401106

Arnaud Sangnier, Alain Finkel

Publication date: 28 January 2010

Published in: SOFSEM 2010: Theory and Practice of Computer Science (Search for Journal in Brave)

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

Mathematics Subject Classification ID

Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)

Related Items (4)

On selective unboundedness of VASS ⋮ Coverability in 2-VASS with one unary counter is in NP ⋮ Unnamed Item ⋮ On Petri Nets with Hierarchical Special Arcs

This page was built for publication: Mixing Coverability and Reachability to Analyze VASS with One Zero-Test