Pages that link to "Item:Q2851061"
From MaRDI portal
The following pages link to Regular model checking using inference of regular languages (Q2851061):
Displaying 16 items.
- Symbolic reachability analysis and maximally permissive entrance control for globally synchronized templates (Q680540) (← links)
- Three optimizations for assume-guarantee reasoning with \(L^{*}\) (Q934701) (← links)
- Generating models of infinite-state communication protocols using regular inference with abstraction (Q2018056) (← links)
- Regular model checking with regular relations (Q2140498) (← links)
- Concurrent Kleene algebra with observations: from hypotheses to completeness (Q2200836) (← links)
- Computable fixpoints in well-structured symbolic model checking (Q2248074) (← links)
- Finite reasons for safety (Q2351397) (← links)
- Tree regular model checking: a simulation-based approach (Q2500700) (← links)
- Learning to verify branching time properties (Q2642669) (← links)
- Handling liveness properties in (\(\omega\)-)regular model checking (Q2851067) (← links)
- Reachability Games on Automatic Graphs (Q3073641) (← links)
- Learning Meets Verification (Q3525110) (← links)
- Polynomial Identification of $$\omega $$-Automata (Q5164178) (← links)
- On Verifying Fault Tolerance of Distributed Protocols (Q5458335) (← links)
- Tools and Algorithms for the Construction and Analysis of Systems (Q5703791) (← links)
- Regular model checking: evolution and perspectives (Q6045027) (← links)
