Simulations in Rank-Based Büchi Automata Complementation
Authors:
- Yu-Fang ChenYCYu-Fang Chen
- Vojtěch HavlenaVHVojtěch Havlena
- Ondřej LengálOLOndřej Lengál
- 18 November 2019
- book chapter
- Published by Springer Nature
- p. 447-467
Abstract
No abstract availableAll Related Versions
This publication has 34 references indexed in Scilit:
- A Simple and Optimal Complementation Algorithm for Büchi Automata2018
- Advanced automata-based algorithms for program termination checkingACM SIGPLAN Notices, 2018
- Foundation for a series of efficient simulation algorithms2017
- Improved Ramsey-Based Büchi Complementation2012
- Advanced Ramsey-Based Büchi Automata Inclusion TestingLecture Notes in Computer Science, 2011
- Büchi Automata Can Have Smaller Quotients2011
- Simulation Subsumption in Ramsey-Based Büchi Automata Universality and Inclusion Testing2010
- When Simulation Meets Antichains2010
- Simulation-based minimizationACM Transactions on Computational Logic, 2003
- Checking for language inclusion using simulation preorders1992