Advanced Ramsey-Based Büchi Automata Inclusion Testing

DOI10.1007/978-3-642-23217-6_13zbMath1343.68130OpenAlexW2148195254MaRDI QIDQ3090830

Chih-Duo Hong, Yu-Fang Chen, Lukáš Holík, Lorenzo Clemente, Tomáš Vojnar, Richard Mayr, Parosh Aziz Abdulla

Publication date: 2 September 2011

Published in: CONCUR 2011 – Concurrency Theory (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-23217-6_13

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Related Items

Ramsey-Based Inclusion Checking for Visibly Pushdown Automata, A theoretical framework for cardinality-based feature models: the semantics and computational aspects, On the power of finite ambiguity in Büchi complementation, Towards a grand unification of Büchi complementation constructions, Unnamed Item, A Novel Learning Algorithm for Büchi Automata Based on Family of DFAs and Classification Trees, A novel learning algorithm for Büchi automata based on family of DFAs and classification trees, Advanced Ramsey-Based Büchi Automata Inclusion Testing, Random Models for Evaluating Efficient Büchi Universality Checking, Domains for Higher-Order Games

Uses Software

• SPIN
• BEEM
• Antichains

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Automata-theoretic techniques for modal logics of programs
• Advanced Ramsey-Based Büchi Automata Inclusion Testing
• Weak alternating automata are not that weak
• When Simulation Meets Antichains
• Efficient Büchi Universality Checking
• Büchi Complementation and Size-Change Termination
• The size-change principle for program termination
• Fair Simulation Relations, Parity Games, and State Space Reduction for Büchi Automata
• Antichains: A New Algorithm for Checking Universality of Finite Automata
• Improved Algorithms for the Automata-Based Approach to Model-Checking