Tree automata, Mu-Calculus and determinacy
SFCS '91 Proceedings of the 32nd annual symposium on Foundations of computer science
Reasoning about infinite computations
Information and Computation
An automata-theoretic approach to branching-time model checking
Journal of the ACM (JACM)
Symbolic Model Checking
Computers and Intractability: A Guide to the Theory of NP-Completeness
Computers and Intractability: A Guide to the Theory of NP-Completeness
Nontraditional Applications of Automata Theory
TACS '94 Proceedings of the International Conference on Theoretical Aspects of Computer Software
Simple on-the-fly automatic verification of linear temporal logic
Proceedings of the Fifteenth IFIP WG6.1 International Symposium on Protocol Specification, Testing and Verification XV
Fair Simulation Relations, Parity Games, and State Space Reduction for Büchi Automata
ICALP '01 Proceedings of the 28th International Colloquium on Automata, Languages and Programming,
TACAS '00 Proceedings of the 6th International Conference on Tools and Algorithms for Construction and Analysis of Systems: Held as Part of the European Joint Conferences on the Theory and Practice of Software, ETAPS 2000
Small Progress Measures for Solving Parity Games
STACS '00 Proceedings of the 17th Annual Symposium on Theoretical Aspects of Computer Science
CONCUR '97 Proceedings of the 8th International Conference on Concurrency Theory
CONCUR '00 Proceedings of the 11th International Conference on Concurrency Theory
A Hierarchy of Polynomial-Time Computable Simulations for Automata
CONCUR '02 Proceedings of the 13th International Conference on Concurrency Theory
Improved Automata Generation for Linear Temporal Logic
CAV '99 Proceedings of the 11th International Conference on Computer Aided Verification
Efficient Büchi Automata from LTL Formulae
CAV '00 Proceedings of the 12th International Conference on Computer Aided Verification
Fast LTL to Büchi Automata Translation
CAV '01 Proceedings of the 13th International Conference on Computer Aided Verification
Truth/SLC - A Parallel Verification Platform for Concurrent Systems
CAV '01 Proceedings of the 13th International Conference on Computer Aided Verification
CAV '02 Proceedings of the 14th International Conference on Computer Aided Verification
Checking for Language Inclusion Using Simulation Preorders
CAV '91 Proceedings of the 3rd International Workshop on Computer Aided Verification
Alternating Refinement Relations
CONCUR '98 Proceedings of the 9th International Conference on Concurrency Theory
Computing simulations on finite and infinite graphs
FOCS '95 Proceedings of the 36th Annual Symposium on Foundations of Computer Science
STOC '82 Proceedings of the fourteenth annual ACM symposium on Theory of computing
The complexity of tree automata and logics of programs
SFCS '88 Proceedings of the 29th Annual Symposium on Foundations of Computer Science
An algebraic definition of simulation between programs
IJCAI'71 Proceedings of the 2nd international joint conference on Artificial intelligence
An optimizing compiler for batches of temporal logic formulas
ISSTA '04 Proceedings of the 2004 ACM SIGSOFT international symposium on Software testing and analysis
Applicability of fair simulation
Information and Computation
Simulation relations for alternating Büchi automata
Theoretical Computer Science
FOCS '05 Proceedings of the 46th Annual IEEE Symposium on Foundations of Computer Science
Efficient LTL compilation for SAT-based model checking
ICCAD '05 Proceedings of the 2005 IEEE/ACM International conference on Computer-aided design
Applicability of fair simulation
Information and Computation
CIAA'03 Proceedings of the 8th international conference on Implementation and application of automata
Alternation removal in büchi automata
ICALP'10 Proceedings of the 37th international colloquium conference on Automata, languages and programming: Part II
Concepts of automata construction from LTL
LPAR'05 Proceedings of the 12th international conference on Logic for Programming, Artificial Intelligence, and Reasoning
Truly on-the-fly LTL model checking
TACAS'05 Proceedings of the 11th international conference on Tools and Algorithms for the Construction and Analysis of Systems
Symbolic systems, explicit properties: on hybrid approaches for LTL symbolic model checking
CAV'05 Proceedings of the 17th international conference on Computer Aided Verification
p-Automata: New foundations for discrete-time probabilistic verification
Performance Evaluation
| Hi-index | 0.00 |
Quotienting by simulation equivalences is a well-established technique for reducing the size of nondeterministic B眉chi automata. We adapt this technique to alternating B眉chi automata. To this end we suggest two new quotients, namely minimax and semi-elective quotients, prove that they preserve the recognized languages, and show that computing them is not more difficult than computing quotients for nondeterministic B眉chi automata. We explain the merits of of our quotienting procedures with respect to converting alternating B眉chi automata into nondeterministic ones.