Advanced Ramsey-Based Büchi Automata Inclusion Testing
From MaRDI portal
Publication:3090830
DOI10.1007/978-3-642-23217-6_13zbMath1343.68130MaRDI 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
68Q45: Formal languages and automata
Related Items
Random Models for Evaluating Efficient Büchi Universality Checking, Ramsey-Based Inclusion Checking for Visibly Pushdown Automata, A theoretical framework for cardinality-based feature models: the semantics and computational aspects, Advanced Ramsey-Based Büchi Automata Inclusion Testing
Uses Software
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