Place-boundedness for vector addition systems with one zero-test

DOI10.4230/LIPICS.FSTTCS.2010.192MaRDI QIDQ2908849zbMATH OpenFDO

Authors Rémi Bonnet, Jérôme Leroux, Alain Finkel, Marc Zeitoun

Publication date 29 August 2012

Full work available at URL http://subs.emis.de/LIPIcs/frontdoor_4f3f.html

zbMATH Keywords

Karp-Miller algorithmplace-boundednessvector addition system with one zero-test

Mathematics Subject Classification ID

Specification and verification (program logics, model checking, etc.) (68Q60) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)

Recommendations

• Model checking vector addition systems with one zero-test
• Mixing coverability and reachability to analyze VASS with one zero-test
• The Reachability Problem for Vector Addition System with One Zero-Test
• On boundedness problems for pushdown vector addition systems
• Decidability of LTL for vector addition systems with one zero-test

Cited in

(7)

• Model checking vector addition systems with one zero-test
• The Reachability Problem for Vector Addition System with One Zero-Test
• Decidability of LTL for vector addition systems with one zero-test
• Mixing coverability and reachability to analyze VASS with one zero-test
• Unboundedness problems for languages of vector addition systems
• Reachability for two-counter machines with one test and one reset
• On Petri nets with hierarchical special arcs

This page was built for publication: Place-boundedness for vector addition systems with one zero-test

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2908849)