Journal of the ACM (JACM)
Weak alternating automata are not that weak
ACM Transactions on Computational Logic (TOCL)
Introduction to Automata Theory, Languages and Computability
Introduction to Automata Theory, Languages and Computability
NUSMV: A New Symbolic Model Verifier
CAV '99 Proceedings of the 11th International Conference on Computer Aided Verification
The equivalence problem for regular expressions with squaring requires exponential space
SWAT '72 Proceedings of the 13th Annual Symposium on Switching and Automata Theory (swat 1972)
A lattice theory for solving games of imperfect information
HSCC'06 Proceedings of the 9th international conference on Hybrid Systems: computation and control
Experimental evaluation of classical automata constructions
LPAR'05 Proceedings of the 12th international conference on Logic for Programming, Artificial Intelligence, and Reasoning
Transactional Reduction of Component Compositions
FORTE '07 Proceedings of the 27th IFIP WG 6.1 international conference on Formal Techniques for Networked and Distributed Systems
Antichain-Based Universality and Inclusion Testing over Nondeterministic Finite Tree Automata
CIAA '08 Proceedings of the 13th international conference on Implementation and Applications of Automata
Completeness and Nondeterminism in Model Checking Transactional Memories
CONCUR '08 Proceedings of the 19th international conference on Concurrency Theory
Strategy Construction for Parity Games with Imperfect Information
CONCUR '08 Proceedings of the 19th international conference on Concurrency Theory
ATVA '08 Proceedings of the 6th International Symposium on Automated Technology for Verification and Analysis
Computing Weakest Strategies for Safety Games of Imperfect Information
TACAS '09 Proceedings of the 15th International Conference on Tools and Algorithms for the Construction and Analysis of Systems: Held as Part of the Joint European Conferences on Theory and Practice of Software, ETAPS 2009,
An Antichain Algorithm for LTL Realizability
CAV '09 Proceedings of the 21st International Conference on Computer Aided Verification
Random Generation of Deterministic Tree (Walking) Automata
CIAA '09 Proceedings of the 14th International Conference on Implementation and Application of Automata
Fixpoint Guided Abstraction Refinement for Alternating Automata
CIAA '09 Proceedings of the 14th International Conference on Implementation and Application of Automata
IJCAI'09 Proceedings of the 21st international jont conference on Artifical intelligence
Improved algorithms for the automata-based approach to model-checking
TACAS'07 Proceedings of the 13th international conference on Tools and algorithms for the construction and analysis of systems
Model checking the first-order fragment of higher-order fixpoint logic
LPAR'07 Proceedings of the 14th international conference on Logic for programming, artificial intelligence and reasoning
Antichains: alternative algorithms for LTL satisfiability and model-checking
TACAS'08/ETAPS'08 Proceedings of the Theory and practice of software, 14th international conference on Tools and algorithms for the construction and analysis of systems
Strategy construction for parity games with imperfect information
Information and Computation
Fixed point guided abstraction refinement for alternating automata
Theoretical Computer Science
Parametric random generation of deterministic tree automata
Theoretical Computer Science
Compositional algorithms for LTL synthesis
ATVA'10 Proceedings of the 8th international conference on Automated technology for verification and analysis
Lattice-valued binary decision diagrams
ATVA'10 Proceedings of the 8th international conference on Automated technology for verification and analysis
Advanced Ramsey-based Büchi automata inclusion testing
CONCUR'11 Proceedings of the 22nd international conference on Concurrency theory
ATVA'11 Proceedings of the 9th international conference on Automated technology for verification and analysis
Efficient inclusion checking on explicit and semi-symbolic tree automata
ATVA'11 Proceedings of the 9th international conference on Automated technology for verification and analysis
Verification of STM on relaxed memory models
Formal Methods in System Design
Antichains and compositional algorithms for LTL synthesis
Formal Methods in System Design
Algorithms for omega-regular games with imperfect information
CSL'06 Proceedings of the 20th international conference on Computer Science Logic
Simulation subsumption in ramsey-based büchi automata universality and inclusion testing
CAV'10 Proceedings of the 22nd international conference on Computer Aided Verification
libalf: the automata learning framework
CAV'10 Proceedings of the 22nd international conference on Computer Aided Verification
Antichain algorithms for finite automata
TACAS'10 Proceedings of the 16th international conference on Tools and Algorithms for the Construction and Analysis of Systems
TACAS'10 Proceedings of the 16th international conference on Tools and Algorithms for the Construction and Analysis of Systems
Efficient büchi universality checking
TACAS'10 Proceedings of the 16th international conference on Tools and Algorithms for the Construction and Analysis of Systems
On model checking for visibly pushdown automata
LATA'12 Proceedings of the 6th international conference on Language and Automata Theory and Applications
Acacia+, a tool for LTL synthesis
CAV'12 Proceedings of the 24th international conference on Computer Aided Verification
Strategy synthesis for multi-dimensional quantitative objectives
CONCUR'12 Proceedings of the 23rd international conference on Concurrency Theory
Efficient symbolic implementation of graph automata with applications to invariant checking
ICGT'12 Proceedings of the 6th international conference on Graph Transformations
More anti-chain based refinement checking
ICFEM'12 Proceedings of the 14th international conference on Formal Engineering Methods: formal methods and software engineering
Checking NFA equivalence with bisimulations up to congruence
POPL '13 Proceedings of the 40th annual ACM SIGPLAN-SIGACT symposium on Principles of programming languages
ICALP'13 Proceedings of the 40th international conference on Automata, Languages, and Programming - Volume Part II
| Hi-index | 0.00 |
We propose and evaluate a new algorithm for checking the universality of nondeterministic finite automata. In contrast to the standard algorithm, which uses the subset construction to explicitly determinize the automaton, we keep the determinization step implicit. Our algorithm computes the least fixed point of a monotone function on the lattice of antichains of state sets. We evaluate the performance of our algorithm experimentally using the random automaton model recently proposed by Tabakov and Vardi. We show that on the difficult instances of this probabilistic model, the antichain algorithm outperforms the standard one by several orders of magnitude. We also show how variations of the antichain method can be used for solving the language-inclusion problem for nondeterministic finite automata, and the emptiness problem for alternating finite automata.