Vector addition system reachability problem, a short self-contained proof

DOI10.1145/1926385.1926421MaRDI QIDQ5408552zbMATH OpenOpenAlexFDO

Authors 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

PetriPresburgerreachabilityvector addition system

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)

Recommendations

• Vector addition system reachability problem: a short self-contained proof
• The general vector addition system reachability problem by Presburger inductive invariants
• Presburger vector addition systems
• Demystifying Reachability in Vector Addition Systems
• scientific article; zbMATH DE number 3928356

Cited in

(30)

• Flat Petri nets (invited talk)
• The general vector addition system reachability problem by Presburger inductive invariants
• Complexity hierarchies beyond elementary
• Expand, Enlarge, and Check for Branching Vector Addition Systems
• Guiding Craig interpolation with domain-specific abstractions
• Vector addition system reachability problem: a short self-contained proof
• The Reachability Problem for Vector Addition System with One Zero-Test
• 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
• On selective unboundedness of VASS
• Rewriting systems for reachability in vector addition systems with pairs
• scientific article; zbMATH DE number 3928356 (Why is no real title available?)
• scientific article; zbMATH DE number 4092784 (Why is no real title available?)
• Demystifying Reachability in Vector Addition Systems
• scientific article; zbMATH DE number 7559493 (Why is no real title available?)
• scientific article; zbMATH DE number 7559502 (Why is no real title available?)
• scientific article; zbMATH DE number 7204383 (Why is no real title available?)
• scientific article; zbMATH DE number 7407775 (Why is no real title available?)
• On functions weakly computable by pushdown Petri nets and related systems
• Presburger vector addition systems
• Porous invariants for linear systems
• Vector addition systems reachability problem (a simpler solution)
• Separability in Büchi VASS and singly nonlinear systems of inequalities
• Counter machines with infrequent reversals
• On the separability problem of VASS reachability languages
• Improved lower bounds for reachability in vector addition systems
• An introduction to the theory of linear integer arithmetic (invited paper)
• Knowing-how reasoning with budgets recasted: universal reachability problem on VASS
• Porous invariants

This page was built for publication: Vector addition system reachability problem, a short self-contained proof

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5408552)