Reachability Analysis with State-Compatible Automata
From MaRDI portal
Recommendations
- Reachability, confluence, and termination analysis with state-compatible automata
- Recurrent Reachability Analysis in Regular Model Checking
- Reachability for finite-state process algebras using static analysis
- scientific article; zbMATH DE number 1670551
- Reachability analysis of pushdown automata: Application to model-checking
- A new technique for reachability of states in concatenation automata
- Automated analysis of Stateflow models
- Resolution-based approach to compatibility analysis of interacting automata
- Reachability analysis based on structured representations
Cited in
(14)- HANDLING NON LEFT-LINEAR RULES WHEN COMPLETING TREE AUTOMATA
- A framework for developing stand-alone certifiers
- A theoretical limit for safety verification techniques with regular fix-point computations
- scientific article; zbMATH DE number 1796135 (Why is no real title available?)
- Resolution-based approach to compatibility analysis of interacting automata
- Handling left-quadratic rules when completing tree automata
- Completeness of tree automata completion
- Certification of classical confluence results for left-linear term rewrite systems
- Certifying a Tree Automata Completion Checker
- A new technique for reachability of states in concatenation automata
- STP Approach to Model Controlled Automata with Application to Reachability Analysis of DEDS
- State‐based reconstructability analysis
- Reachability, confluence, and termination analysis with state-compatible automata
- scientific article; zbMATH DE number 2134685 (Why is no real title available?)
This page was built for publication: Reachability Analysis with State-Compatible Automata
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5404926)
