Vector Addition System Reversible Reachability Problem

DOI10.1007/978-3-642-23217-6_22zbMath1343.68173arXiv1301.4874OpenAlexW1938261175MaRDI QIDQ3090839

Jérôme Leroux

Publication date: 2 September 2011

Published in: CONCUR 2011 – Concurrency Theory (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1301.4874

Mathematics Subject Classification ID

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

Related Items (4)

Existence of home states in Petri nets is decidable ⋮ Advances in parameterized verification of population protocols ⋮ Reversing Unbounded Petri Nets ⋮ Verification of population protocols

Cites Work

• A structure to decide reachability in Petri nets
• The covering and boundedness problems for vector addition systems
• Vector addition system reachability problem
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Vector Addition System Reversible Reachability Problem