The Reachability Problem for Vector Addition System with One Zero-Test

DOI10.1007/978-3-642-22993-0_16MaRDI QIDQ3088035zbMATH OpenOpenAlexFDO

Authors Rémi Bonnet

Publication date 17 August 2011

Published in Mathematical Foundations of Computer Science 2011 (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-642-22993-0_16

Mathematics Subject Classification ID

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

Recommendations

• scientific article; zbMATH DE number 3878366
• Vector addition system reachability problem: a short self-contained proof
• Vector addition system reachability problem, a short self-contained proof
• scientific article; zbMATH DE number 4092784
• scientific article; zbMATH DE number 7559493
• Model checking vector addition systems with one zero-test
• Decidability of LTL for vector addition systems with one zero-test
• Demystifying Reachability in Vector Addition Systems
• Place-boundedness for vector addition systems with one zero-test
• scientific article; zbMATH DE number 7559504

Cited in

(18)

• Mixing coverability and reachability to analyze VASS with one zero-test
• Decidability of LTL for vector addition systems with one zero-test
• Model checking vector addition systems with one zero-test
• Language inclusion for boundedly-ambiguous vector addition systems is decidable
• Coverability and Termination in Recursive Petri Nets
• On Petri nets with hierarchical special arcs
• scientific article; zbMATH DE number 7561336 (Why is no real title available?)
• Place-boundedness for vector addition systems with one zero-test
• Challenges of the reachability problem in infinite-state systems (invited paper)
• scientific article; zbMATH DE number 7559493 (Why is no real title available?)
• Universality in Molecular and Cellular Computing
• Flattability of priority vector addition systems
• Zero-reachability in probabilistic multi-counter automata
• Vector Addition System Reversible Reachability Problem
• The complexity of bidirected reachability in valence systems
• On selective unboundedness of VASS
• Undecidability of performance equivalence of Petri nets
• Coverability, termination, and finiteness in recursive Petri nets

This page was built for publication: The Reachability Problem for Vector Addition System with One Zero-Test

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