Vector addition system reversible reachability problem

DOI10.2168/LMCS-9(1:5)2013MaRDI QIDQ4913768zbMATH OpenFDO

Authors Jérôme Leroux

Publication date 9 April 2013

Published in Logical Methods in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.2168/LMCS-9(1:5)2013

zbMATH Keywords

boundednesscoverreachabilityvector addition system

Mathematics Subject Classification ID

Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)

Recommendations

• Vector Addition System Reversible Reachability Problem
• Polynomial vector addition systems with states
• When reachability meets Grzegorczyk
• scientific article; zbMATH DE number 4092784
• scientific article; zbMATH DE number 3878366

Cited in

(13)

• The complexity of verifying population protocols
• Co-finiteness and co-emptiness of reachability sets in vector addition systems with states
• Advances in parameterized verification of population protocols
• Vector Addition System Reversible Reachability Problem
• scientific article; zbMATH DE number 3878366 (Why is no real title available?)
• The reachability problem for branching vector addition systems requires doubly-exponential space
• Demystifying Reachability in Vector Addition Systems
• scientific article; zbMATH DE number 7559502 (Why is no real title available?)
• When reachability meets Grzegorczyk
• Verification of population protocols
• Bi-reachability in Petri nets with data
• On the length of strongly monotone descending chains over \(\mathbb{N}^d\)
• Coverability in VASS revisited: improving Rackoff's bounds to obtain conditional optimality

This page was built for publication: Vector addition system reversible reachability problem

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