Regular model checking using inference of regular languages
From MaRDI portal
Recommendations
Cited in
(21)- Generating models of infinite-state communication protocols using regular inference with abstraction
- Regular model checking with regular relations
- Concurrent Kleene algebra with observations: from hypotheses to completeness
- Computable fixpoints in well-structured symbolic model checking
- Finite reasons for safety. Parameterized verification by finite model finding
- Tree regular model checking: a simulation-based approach
- Learning to verify branching time properties
- Handling liveness properties in (-)regular model checking
- Reachability games on automatic graphs
- Learning Meets Verification
- scientific article; zbMATH DE number 1232242 (Why is no real title available?)
- Polynomial identification of \(\omega \)-automata
- On Verifying Fault Tolerance of Distributed Protocols
- Recurrent Reachability Analysis in Regular Model Checking
- Tools and Algorithms for the Construction and Analysis of Systems
- Regular model checking: evolution and perspectives
- Regular model checking upside-down: an invariant-based approach
- Symbolic reachability analysis and maximally permissive entrance control for globally synchronized templates
- Unsupervised automata learning via discrete optimization
- Constructing concise characteristic samples for acceptors of omega regular languages
- Three optimizations for assume-guarantee reasoning with \(L^{*}\)
This page was built for publication: Regular model checking using inference of regular languages
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2851061)
