Summary: Simulation Subsumption in Ramsey-based B¨uchi
Automata Universality and Inclusion Testing
Parosh Aziz Abdulla1
, Yu-Fang Chen2
, Lorenzo Clemente3
, Luk´as Hol´ik4
,
Chih-Duo Hong2
, Richard Mayr3
, and Tom´as Vojnar4
1
Uppsala University 2
Academia Sinica 3
University of Edinburgh
4
Brno University of Technology
Abstract. There are two main classes of methods for checking univer-
sality and language inclusion of B¨uchi-automata: Rank-based methods
and Ramsey-based methods. While rank-based methods have a better
worst-case complexity, Ramsey-based methods have been shown to be

Source: Abdulla, Parosh Aziz - Department of Information Technology, Uppsala Universitet
Ìayr, Richard - School of Informatics, University of Edinburgh

Collections: Computer Technologies and Information Sciences