Vector addition system reachability problem
From MaRDI portal
Publication:5408552
DOI10.1145/1926385.1926421zbMath1284.68429MaRDI QIDQ5408552
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
68Q60: Specification and verification (program logics, model checking, etc.)
68Q85: Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.)
Related Items
Unnamed Item, Unnamed Item, Unnamed Item, Unnamed Item, Unnamed Item, Computational Complexity of Atomic Chemical Reaction Networks, Guiding Craig interpolation with domain-specific abstractions, On selective unboundedness of VASS, Porous invariants, Flat Petri nets (invited talk), Complexity Hierarchies beyond Elementary, Vector Addition System Reversible Reachability Problem, Deciding Fast Termination for Probabilistic VASS with Nondeterminism, On the Coverability Problem for Pushdown Vector Addition Systems in One Dimension