Expand, Enlarge, and Check for Branching Vector Addition Systems

DOI10.1007/978-3-642-40184-8_12MaRDI QIDQ2842103zbMATH OpenOpenAlexFDO

Authors Zilong Wang, Rupak Majumdar

Publication date 12 August 2013

Published in CONCUR 2013 – Concurrency Theory (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-642-40184-8_12

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)

Recommendations

• The covering and boundedness problems for branching vector addition systems
• The covering and boundedness problems for branching vector addition systems
• scientific article; zbMATH DE number 3878366
• The reachability problem for branching vector addition systems requires doubly-exponential space
• Demystifying Reachability in Vector Addition Systems
• Presburger vector addition systems
• Model Checking Coverability Graphs of Vector Addition Systems
• scientific article; zbMATH DE number 4092784
• Vector addition system reachability problem, a short self-contained proof
• Vector addition system reachability problem: a short self-contained proof

Cited in

(2)

• Computer Aided Verification
• The ideal view on Rackoff's coverability technique

This page was built for publication: Expand, Enlarge, and Check for Branching Vector Addition Systems

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