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

DOI10.1007/978-3-642-22993-0_16zbMath1343.68160OpenAlexW62188582MaRDI QIDQ3088035

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)

Related Items (8)

Universality in Molecular and Cellular Computing ⋮ On selective unboundedness of VASS ⋮ Coverability and Termination in Recursive Petri Nets ⋮ Undecidability of performance equivalence of Petri nets ⋮ Unnamed Item ⋮ Unnamed Item ⋮ On Petri Nets with Hierarchical Special Arcs ⋮ 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