Towards a Model-Checker for Counter Systems
From MaRDI portal
Publication:3522931
Recommendations
- Model-checking \(\mathrm{CTL}^*\) over flat Presburger counter systems
- Equivalence between model-checking flat counter systems and Presburger arithmetic
- Equivalence between model-checking flat counter systems and Presburger arithmetic
- Flat model checking for counting LTL using quantifier-free Presburger arithmetic
- Taming past LTL and flat counter systems
Cited in
(17)- Dense-choice counter machines revisited
- Flat model checking for counting LTL using quantifier-free Presburger arithmetic
- Verification of gap-order constraint abstractions of counter systems
- Equivalence between model-checking flat counter systems and Presburger arithmetic
- Verification of gap-order constraint abstractions of counter systems
- Model-checking \(\mathrm{CTL}^*\) over flat Presburger counter systems
- The complexity of reversal-bounded model-checking
- Equivalence between model-checking flat counter systems and Presburger arithmetic
- A decidability result for the model checking of infinite-state systems
- Verification of flat FIFO systems
- Automatic verification of counter systems with ranking function
- An automata-based approach for \(\text{CTL}^{*}\) with constraints
- Model Checking Software
- Computer Aided Verification
- Verification of Flat FIFO Systems
- Witness runs for counter machines
- Verification of qualitative \(\mathbb Z\) constraints
This page was built for publication: Towards a Model-Checker for Counter Systems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3522931)
