Vector Addition System Reversible Reachability Problem
From MaRDI portal
Publication:3090839
DOI10.1007/978-3-642-23217-6_22zbMath1343.68173arXiv1301.4874MaRDI QIDQ3090839
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
68Q85: Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.)
68Q17: Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.)
Related Items
Existence of home states in Petri nets is decidable, Verification of population protocols, Advances in parameterized verification of population protocols
Cites Work