Fair Simulation Relations, Parity Games, and State Space Reduction for Bu"chi Automata
暂无分享,去创建一个
[1] Bernhard Steffen. Proceedings of the 4th International Conference on Tools and Algorithms for Construction and Analysis of Systems , 1998 .
[2] Murray Hill,et al. Optimizing B Uchi Automata , 2000 .
[3] I. Walukiewicz. Pushdown Processes: Games and Model Checking , 1996 .
[4] Fabio Somenzi,et al. Fair Simulation Minimization , 2002, CAV.
[5] Orna Grumberg,et al. Checking for fair simulation in models with B uchi fairness constraints , 2000 .
[6] Fabio Somenzi,et al. Efficient Büchi Automata from LTL Formulae , 2000, CAV.
[7] Kousha Etessami,et al. A Hierarchy of Polynomial-Time Computable Simulations for Automata , 2002, CONCUR.
[8] Carsten Fritz,et al. State Space Reductions for Alternating Büchi Automata Quotienting by Simulation Equivalences , 2002 .
[9] Igor Walukiewicz,et al. Completeness of Kozen's Axiomatisation of the Propositional µ-Calculus , 2000, Inf. Comput..
[10] Thomas A. Henzinger,et al. Computing simulations on finite and infinite graphs , 1995, Proceedings of IEEE 36th Annual Foundations of Computer Science.
[11] Alan J. Hu,et al. Checking for Language Inclusion Using Simulation Preorders , 1991, CAV.
[12] Orna Kupferman,et al. Weak alternating automata are not that weak , 2001, TOCL.
[13] Nils Klarlund,et al. Progress measures, immediate determinacy, and a subset construction for tree automata , 1992, [1992] Proceedings of the Seventh Annual IEEE Symposium on Logic in Computer Science.
[14] Orna Grumberg,et al. Simulation Based Minimization , 2000, CADE.
[15] Ludwig Staiger,et al. Ω-languages , 1997 .
[16] Henrik Reif Andersen. Model Checking and Boolean Graphs , 1992, ESOP.
[17] Igor Walukiewicz,et al. Pushdown Processes: Games and Model-Checking , 1996, Inf. Comput..
[18] Robert E. Tarjan,et al. Three Partition Refinement Algorithms , 1987, SIAM J. Comput..
[19] Robin Milner,et al. Communication and concurrency , 1989, PHI Series in computer science.
[20] Wolfgang Thomas,et al. Automata on Infinite Objects , 1991, Handbook of Theoretical Computer Science, Volume B: Formal Models and Sematics.
[21] Orna Kupferman,et al. Weak alternating automata are not that weak , 1997, Proceedings of the Fifth Israeli Symposium on Theory of Computing and Systems.
[22] Kousha Etessami,et al. Optimizing Büchi Automata , 2000, CONCUR.
[23] Thomas A. Henzinger,et al. Fair Bisimulation , 2000, TACAS.
[24] Kousha Etessami,et al. Fair Simulation Relations, Parity Games, and State Space Reduction for Büchi Automata , 2001, ICALP.
[25] Thomas Wilke,et al. Automata logics, and infinite games: a guide to current research , 2002 .
[26] Nils Klarlund,et al. Progress measures, immediate determinacy, and a subset construction for tree automata , 1992, [1992] Proceedings of the Seventh Annual IEEE Symposium on Logic in Computer Science.
[27] Orna Grumberg,et al. Model checking and modular verification , 1994, TOPL.
[28] Thomas A. Henzinger,et al. Fair Simulation , 1997, Inf. Comput..
[29] Orna Kupferman,et al. Weak alternating automata and tree automata emptiness , 1998, STOC '98.
[30] Bard Bloom,et al. Transformational Design and Implementation of a New Efficient Solution to the Ready Simulation Problem , 1995, Sci. Comput. Program..
[31] Marcin Jurdzinski,et al. Small Progress Measures for Solving Parity Games , 2000, STACS.
[32] Orna Grumberg,et al. Applicability of fair simulation , 2002, Inf. Comput..