FORQ-Based Language Inclusion Formal Testing

DOI10.1007/978-3-031-13188-2_6MaRDI QIDQ6487332zbMATH OpenFDO

Authors Pierre Ganty, Nicolas Mazzocchi

Publication date 7 December 2022

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://doi.org/10.1007/978-3-031-13188-2_6

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Recommendations

• Advanced Ramsey-based Büchi automata inclusion testing
• Complete Abstractions for Checking Language Inclusion
• Revealing vs. concealing: more simulation games for Büchi inclusion
• Efficient reduction of nondeterministic automata with application to language inclusion testing
• Improved Algorithms for the Automata-Based Approach to Model-Checking

Cites work

• scientific article; zbMATH DE number 512864 (Why is no real title available?)
• scientific article; zbMATH DE number 7730605 (Why is no real title available?)
• A novel learning algorithm for Büchi automata based on family of DFAs and classification trees
• Advanced Ramsey-based Büchi automata inclusion testing
• Antichains for the Automata-Based Approach to Model-Checking
• Antichains: A New Algorithm for Checking Universality of Finite Automata
• Coinductive algorithms for Büchi automata
• Congruence Relations for Büchi Automata
• Efficient Büchi universality checking
• Efficient reduction of nondeterministic automata with application to language inclusion testing
• FORQ-Based Language Inclusion Formal Testing
• Families of DFAs as acceptors of -regular languages
• From Nondeterministic B\"uchi and Streett Automata to Deterministic Parity Automata
• From Spot 2.0 to Spot 2.10: What’s New?
• On syntactic congruences for \(\omega\)-languages
• State of Büchi complementation
• Well quasi-orders and regular languages

Cited in

(8)

• From Spot 2.0 to Spot 2.10: What’s New?
• Advanced Ramsey-based Büchi automata inclusion testing
• AutoHyper: explicit-state model checking for HyperLTL
• FORQ-Based Language Inclusion Formal Testing
• Complete Abstractions for Checking Language Inclusion
• Symbolic execution for refuting hyperproperties
• Antichains algorithms for the inclusion problem between \(\omega\)-VPL
• Language inclusion algorithms as complete abstract interpretations

This page was built for publication: FORQ-Based Language Inclusion Formal Testing

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6487332)