Advanced Ramsey-Based Büchi Automata Inclusion Testing
- 1 January 2011
- book chapter
- Published by Springer Nature in Lecture Notes in Computer Science
- p. 187-202
Abstract
No abstract availableKeywords
This publication has 16 references indexed in Scilit:
- Simulation Subsumption in Ramsey-Based Büchi Automata Universality and Inclusion Testing2010
- Efficient Büchi Universality Checking2010
- When Simulation Meets Antichains2010
- Büchi Complementation and Size-Change Termination2009
- BEEM: Benchmarks for Explicit Model Checkers2007
- Improved Algorithms for the Automata-Based Approach to Model-Checking2007
- Antichains: A New Algorithm for Checking Universality of Finite Automata2006
- A Hierarchy of Polynomial-Time Computable Simulations for Automata2002
- Weak alternating automata are not that weakACM Transactions on Computational Logic, 2001
- Checking for language inclusion using simulation preorders1992