Advanced Ramsey-Based Büchi Automata Inclusion Testing

[1]  Parosh Aziz Abdulla,et al.  Simulation Subsumption in Ramsey-Based Büchi Automata Universality and Inclusion Testing , 2010, CAV.

[2]  Moshe Y. Vardi,et al.  Efficient Büchi Universality Checking , 2010, TACAS.

[3]  Moshe Y. Vardi,et al.  Büchi Complementation and Size-Change Termination , 2009, Log. Methods Comput. Sci..

[4]  Radek Pelánek,et al.  BEEM: Benchmarks for Explicit Model Checkers , 2007, SPIN.

[5]  Andreas Podelski,et al.  ACSAR: Software Model Checking with Transfinite Refinement , 2007, SPIN.

[6]  Jean-François Raskin,et al.  Improved Algorithms for the Automata-Based Approach to Model-Checking , 2007, TACAS.

[7]  T. Henzinger,et al.  Antichains: A New Algorithm for Checking Universality of Finite Automata , 2006, CAV.

[8]  Rajeev Alur,et al.  A Temporal Logic of Nested Calls and Returns , 2004, TACAS.

[9]  Kousha Etessami,et al.  A Hierarchy of Polynomial-Time Computable Simulations for Automata , 2002, CONCUR.

[10]  Kousha Etessami,et al.  Fair Simulation Relations, Parity Games, and State Space Reduction for Büchi Automata , 2001, ICALP.

[11]  Fabio Somenzi,et al.  Efficient Büchi Automata from LTL Formulae , 2000, CAV.

[12]  Orna Kupferman,et al.  Weak alternating automata are not that weak , 1997, Proceedings of the Fifth Israeli Symposium on Theory of Computing and Systems.

[13]  Orna Kupferman,et al.  Verification of Fair Transisiton Systems , 1996, CAV.

[14]  Thomas A. Henzinger,et al.  Computing simulations on finite and infinite graphs , 1995, Proceedings of IEEE 36th Annual Foundations of Computer Science.

[15]  Alan J. Hu,et al.  Checking for Language Inclusion Using Simulation Preorders , 1991, CAV.

[16]  Pierre Wolper,et al.  The Complementation Problem for Büchi Automata with Applications to Temporal Logic (Extended Abstract) , 1985, ICALP.

[17]  Wenyuan Yu,et al.  Edinburgh Research Explorer Advanced Ramsey-Based Büchi Automata Inclusion Testing , 2010 .

[18]  Parosh Aziz Abdulla,et al.  When Simulation Meets Antichains ( On Checking Language Inclusion of Nondeterministic Finite ( Tree ) Automata ) ? , 2010 .

[19]  Seth Fogarty,et al.  Buchi containment and size-change termination , 2009 .

[20]  Moshe Y. Vardi,et al.  Model Checking Buechi Specifications , 2007, LATA.

[21]  Neil D. Jones,et al.  The size-change principle for program termination , 2001, POPL '01.

[22]  Orna Kupferman,et al.  Verification of Fair Transition Systems , 1998, Chic. J. Theor. Comput. Sci..

[23]  Pierre Wolper,et al.  An Automata-Theoretic Approach to Automatic Program Verification (Preliminary Report) , 1986, LICS.