Efficient Büchi universality checking
From MaRDI portal
Recommendations
Cited in
(19)- Fast offline partial evaluation of logic programs
- Büchi complementation and size-change termination
- Ramsey-based analysis of parity automata
- State of Büchi complementation
- Advanced Ramsey-based Büchi automata inclusion testing
- Size-change termination and satisfiability for linear-time temporal logics
- Büchi Complementation and Size-Change Termination
- Antichains for the Automata-Based Approach to Model-Checking
- Efficient reduction of nondeterministic automata with application to language inclusion testing
- Domains for Higher-Order Games
- Coinductive algorithms for Büchi automata
- Random models for evaluating efficient Büchi universality checking
- Ramsey-based inclusion checking for visibly pushdown automata
- Improved Algorithms for the Automata-Based Approach to Model-Checking
- Towards a grand unification of Büchi complementation constructions
- FORQ-Based Language Inclusion Formal Testing
- Congruence Relations for Büchi Automata
- Antichains algorithms for the inclusion problem between \(\omega\)-VPL
- Profile trees for Büchi word automata, with application to determinization
This page was built for publication: Efficient Büchi universality checking
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3557078)