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

DOI10.1145/1926385.1926421zbMATH Open1284.68429OpenAlexW4249920159MaRDI QIDQ5408552FDOQ5408552

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

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

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)

Cited In (24)

• Porous invariants
• Title not available (Why is that?)
• Flat Petri nets (invited talk)
• Title not available (Why is that?)
• On functions weakly computable by pushdown Petri nets and related systems
• Presburger vector addition systems
• On the coverability problem for pushdown vector addition systems in one dimension
• Guiding Craig interpolation with domain-specific abstractions
• The Reachability Problem for Vector Addition System with One Zero-Test
• Vector addition system reachability problem: a short self-contained proof
• The general vector addition system reachability problem by Presburger inductive invariants
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Porous invariants for linear systems
• Rewriting systems for reachability in vector addition systems with pairs
• Vector Addition System Reversible Reachability Problem
• Expand, Enlarge, and Check for Branching Vector Addition Systems
• On selective unboundedness of VASS
• Title not available (Why is that?)
• Demystifying Reachability in Vector Addition Systems
• Complexity hierarchies beyond elementary
• Computational complexity of atomic chemical reaction networks
• Deciding fast termination for probabilistic VASS with nondeterminism

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)