Home

About

Advanced Search

Browse by Discipline

Scientific Societies

E-print Alerts

Add E-prints

E-print Network
FAQHELPSITE MAPCONTACT US


  Advanced Search  

 
Simulation Subsumption in Ramsey-based Buchi Automata Universality and Inclusion Testing
 

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