Vector addition system reachability problem

DOI10.1145/1926385.1926421zbMath1284.68429OpenAlexW4249920159MaRDI QIDQ5408552

Jérôme Leroux

Publication date: 10 April 2014

Published in: Proceedings of the 38th annual ACM SIGPLAN-SIGACT symposium on Principles of programming languages (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1145/1926385.1926421

zbMATH Keywords

reachabilityvector addition systemPresburgerPetri

Mathematics Subject Classification ID

Specification and verification (program logics, model checking, etc.) (68Q60) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)

Related Items (14)

Porous invariants ⋮ On the Coverability Problem for Pushdown Vector Addition Systems in One Dimension ⋮ Guiding Craig interpolation with domain-specific abstractions ⋮ Unnamed Item ⋮ On selective unboundedness of VASS ⋮ Computational Complexity of Atomic Chemical Reaction Networks ⋮ Deciding Fast Termination for Probabilistic VASS with Nondeterminism ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Vector Addition System Reversible Reachability Problem ⋮ Complexity Hierarchies beyond Elementary ⋮ Unnamed Item ⋮ Flat Petri nets (invited talk)

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