Vector Addition System Reversible Reachability Problem

DOI10.2168/LMCS-9(1:5)2013zbMath1260.68271MaRDI QIDQ4913768

Jérôme Leroux

Publication date: 9 April 2013

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

zbMATH Keywords

boundednessreachabilitycovervector addition system

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)

Advances in parameterized verification of population protocols ⋮ Verification of population protocols ⋮ Unnamed Item ⋮ The complexity of verifying population protocols

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