CONCUR 2004 - Concurrency Theory

DOI10.1007/B100113MaRDI QIDQ5311488zbMATH OpenOpenAlexFDO

Authors Jérôme Leroux, Grégoire Sutre

Publication date 23 August 2005

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/b100113

Mathematics Subject Classification ID

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

Recommendations

• Flat Petri nets (invited talk)
• Reachability in two-dimensional vector addition systems with states is PSPACE-complete
• Automated Technology for Verification and Analysis
• Some complexity bounds for problems concerning finite and 2-dimensional vector addition systems with states
• Presburger vector addition systems

Cited in

(24)

• \(\text{Para}^2\): parameterized path reduction, acceleration, and SMT for reachability in threshold-guarded distributed algorithms
• Flat Petri nets (invited talk)
• Ambiguity, weakness, and regularity in probabilistic Büchi automata
• Equivalence between model-checking flat counter systems and Presburger arithmetic
• Forward analysis and model checking for trace bounded WSTS
• Equivalence between model-checking flat counter systems and Presburger arithmetic
• On the coverability problem for pushdown vector addition systems in one dimension
• Bounded underapproximations
• scientific article; zbMATH DE number 1759422 (Why is no real title available?)
• Affine extensions of integer vector addition systems with states
• Multi-Dimensional Long-Run Average Problems for Vector Addition Systems with States
• scientific article; zbMATH DE number 7559493 (Why is no real title available?)
• scientific article; zbMATH DE number 7559503 (Why is no real title available?)
• scientific article; zbMATH DE number 7559504 (Why is no real title available?)
• Reachability for two-counter machines with one test and one reset
• New pumping technique for 2-dimensional VASS
• Automated Technology for Verification and Analysis
• Coverability in 2-VASS with one unary counter is in NP
• Dimension-minimality and primality of counter nets
• The geometry of reachability in continuous vector addition systems with states
• Lower bounds for the reachability problem in fixed dimensional VASSes
• Improved algorithm for reachability in d-VASS
• The geometry of reachability in continuous vector addition systems with states
• Box-reachability in vector addition systems

Describes a project that uses

Uses Software

• TREX

This page was built for publication: CONCUR 2004 - Concurrency Theory

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