The complexity of reversal-bounded model-checking
From MaRDI portal
Publication:3172883
DOI10.1007/978-3-642-24364-6_6zbMATH Open1348.68121OpenAlexW80793323MaRDI QIDQ3172883FDOQ3172883
Marcello M. Bersani, Stéphane Demri
Publication date: 7 October 2011
Published in: Frontiers of Combining Systems (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-642-24364-6_6
Recommendations
- Reversal-Bounded Counter Machines Revisited
- Model-checking \(\mathrm{CTL}^*\) over flat Presburger counter systems
- Towards a Model-Checker for Counter Systems
- [[:Publication:4474213|Title not available (Why is that?)]]
- Equivalence between model-checking flat counter systems and Presburger arithmetic
Analysis of algorithms and problem complexity (68Q25) Specification and verification (program logics, model checking, etc.) (68Q60)
Cites Work
- TaPAS: The Talence Presburger Arithmetic Suite
- Reversal-Bounded Multicounter Machines and Their Decision Problems
- A really temporal logic
- NEXP TIME-complete description logics with concrete domains
- The covering and boundedness problems for vector addition systems
- Title not available (Why is that?)
- Automated Technology for Verification and Analysis
- Reasoning about infinite computations
- On the complexity of integer programming
- The complexity of decision problems for finite-turn multicounter machines
- An analysis of the nonemptiness problem for classes of reversal-bounded multicounter machines
- Counter machines and verification problems.
- Reversal-Bounded Counter Machines Revisited
- Bounds on Positive Integral Solutions of Linear Diophantine Equations
- Title not available (Why is that?)
- Tools and Algorithms for the Construction and Analysis of Systems
- The Complexity of Reversal-Bounded Model-Checking
- Verification Decidability of Presburger Array Programs
- Algorithmic Metatheorems for Decidable LTL Model Checking over Infinite Systems
- Title not available (Why is that?)
Cited In (7)
- Lower bounds on the complexity of \(\mathsf{MSO}_1\) model-checking
- Equivalence between model-checking flat counter systems and Presburger arithmetic
- Reasoning about reversal-bounded counter machines
- Equivalence Between Model-Checking Flat Counter Systems and Presburger Arithmetic
- The Complexity of Reversal-Bounded Model-Checking
- Title not available (Why is that?)
- Complexity of model checking for cardinality-based belief revision operators
Uses Software
This page was built for publication: The complexity of reversal-bounded model-checking
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3172883)
