TaPAS
From MaRDI portal
Software:19330
swMATH7286MaRDI QIDQ19330FDOQ19330
Author name not available (Why is that?)
Cited In (6)
- 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
- Lossy counter machines decidability cheat sheet
- Computable fixpoints in well-structured symbolic model checking
This page was built for software: TaPAS