Presburger Vector Addition Systems

DOI10.1109/LICS.2013.7zbMath1366.68209OpenAlexW2028974417MaRDI QIDQ5271037

Jérôme Leroux

Publication date: 3 July 2017

Published in: 2013 28th Annual ACM/IEEE Symposium on Logic in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1109/lics.2013.7

zbMATH Keywords

reachabilityPetri netsaccelerationPresburger arithmeticinfinite state systemsvector addition systemsflatability

Mathematics Subject Classification ID

Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)

Related Items (8)

Petri Nets and Semilinear Sets (Extended Abstract) ⋮ Advances in parameterized verification of population protocols ⋮ Deciding Structural Liveness of Petri Nets ⋮ Verification of population protocols ⋮ Unnamed Item ⋮ The complexity of verifying population protocols ⋮ Structural liveness of Petri nets is \textsc{ExpSpace}-hard and decidable ⋮ Flat Petri nets (invited talk)

This page was built for publication: Presburger Vector Addition Systems