CONCUR 2004 - Concurrency Theory
From MaRDI portal
Publication:5311488
DOI10.1007/B100113zbMATH Open1099.68071OpenAlexW2499482941MaRDI QIDQ5311488FDOQ5311488
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
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 (21)
- Multi-Dimensional Long-Run Average Problems for Vector Addition Systems with States
- Title not available (Why is that?)
- Title not available (Why is that?)
- Flat Petri nets (invited talk)
- Equivalence between model-checking flat counter systems and Presburger arithmetic
- Forward analysis and model checking for trace bounded WSTS
- On the coverability problem for pushdown vector addition systems in one dimension
- Equivalence between model-checking flat counter systems and Presburger arithmetic
- Affine extensions of integer vector addition systems with states
- Bounded underapproximations
- New pumping technique for 2-dimensional VASS
- Title not available (Why is that?)
- Dimension-minimality and primality of counter nets
- Coverability in 2-VASS with one unary counter is in NP
- The geometry of reachability in continuous vector addition systems with states
- Lower bounds for the reachability problem in fixed dimensional VASSes
- Title not available (Why is that?)
- Ambiguity, weakness, and regularity in probabilistic Büchi automata
- \(\text{Para}^2\): parameterized path reduction, acceleration, and SMT for reachability in threshold-guarded distributed algorithms
- Automated Technology for Verification and Analysis
- Title not available (Why is that?)
Uses Software
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)