The General Vector Addition System Reachability Problem by Presburger Inductive Invariants

DOI10.2168/LMCS-6(3:22)2010zbMath1208.68161arXiv1009.1076OpenAlexW4390654857MaRDI QIDQ2786139

Jérôme Leroux

Publication date: 21 September 2010

Published in: Logical Methods in Computer Science (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1009.1076

zbMATH Keywords

reachabilityPetri netPresburger formulavector addition system

Mathematics Subject Classification ID

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

Related Items (6)

Porous invariants ⋮ A Note on Decidable Separability by Piecewise Testable Languages ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Regular Graphs and the Spectra of Two-Variable Logic with Counting ⋮ Flat Petri nets (invited talk)

This page was built for publication: The General Vector Addition System Reachability Problem by Presburger Inductive Invariants