TaPAS
From MaRDI portal
Cited in
(10)- Equivalence between model-checking flat counter systems and Presburger arithmetic
- Efficient reduction of nondeterministic automata with application to language inclusion testing
- The complexity of reversal-bounded model-checking
- Witness runs for counter machines
- McScM
- LIRA
- Walnut
- libVATA
- Lossy counter machines decidability cheat sheet
- Computable fixpoints in well-structured symbolic model checking
This page was built for software: TaPAS
