The complementation problem for Bu¨chi automata with applications to temporal logic
Theoretical Computer Science
Reasoning about infinite computations
Information and Computation
Journal of the ACM (JACM)
Well-structured transition systems everywhere!
Theoretical Computer Science
Weak alternating automata are not that weak
ACM Transactions on Computational Logic (TOCL)
Alternating Refinement Relations
CONCUR '98 Proceedings of the 9th International Conference on Concurrency Theory
General decidability theorems for infinite-state systems
LICS '96 Proceedings of the 11th Annual IEEE Symposium on Logic in Computer Science
Computing simulations on finite and infinite graphs
FOCS '95 Proceedings of the 36th Annual Symposium on Foundations of Computer Science
On the complexity of omega -automata
SFCS '88 Proceedings of the 29th Annual Symposium on Foundations of Computer Science
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
Strategy Construction for Parity Games with Imperfect Information
CONCUR '08 Proceedings of the 19th international conference on Concurrency Theory
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)
ATVA '08 Proceedings of the 6th International Symposium on Automated Technology for Verification and Analysis
Tighter Bounds for the Determinisation of Büchi Automata
FOSSACS '09 Proceedings of the 12th International Conference on Foundations of Software Science and Computational Structures: Held as Part of the Joint European Conferences on Theory and Practice of Software, ETAPS 2009
Büchi Complementation and Size-Change Termination
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,
Alpaga: A Tool for Solving Parity Games with 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
An algebraic definition of simulation between programs
IJCAI'71 Proceedings of the 2nd international joint conference on Artificial intelligence
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
Experimental evaluation of classical automata constructions
LPAR'05 Proceedings of the 12th international conference on Logic for Programming, Artificial Intelligence, and Reasoning
Antichains: a new algorithm for checking universality of finite automata
CAV'06 Proceedings of the 18th international conference on Computer Aided Verification
Safraless procedures for timed specifications
FORMATS'10 Proceedings of the 8th international conference on Formal modeling and analysis of timed systems
Lattice-valued binary decision diagrams
ATVA'10 Proceedings of the 8th international conference on Automated technology for verification and analysis
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
Antichains and compositional algorithms for LTL synthesis
Formal Methods in System Design
Partial-Observation Stochastic Games: How to Win When Belief Fails
LICS '12 Proceedings of the 2012 27th Annual IEEE/ACM Symposium on Logic in Computer Science
Strategy synthesis for multi-dimensional quantitative objectives
CONCUR'12 Proceedings of the 23rd international conference on Concurrency Theory
Advanced automata minimization
POPL '13 Proceedings of the 40th annual ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Checking NFA equivalence with bisimulations up to congruence
POPL '13 Proceedings of the 40th annual ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Enhancing approximations for regular reachability analysis
CIAA'13 Proceedings of the 18th international conference on Implementation and Application of Automata
Generalizing simulation to abstract domains
CONCUR'13 Proceedings of the 24th international conference on Concurrency Theory
On MITL and alternating timed automata
FORMATS'13 Proceedings of the 11th international conference on Formal Modeling and Analysis of Timed Systems
| Hi-index | 0.00 |
We present a general theory that exploits simulation relations on transition systems to obtain antichain algorithms for solving the reachability and repeated reachability problems. Antichains are more succinct than the sets of states manipulated by the traditional fixpoint algorithms. The theory justifies the correctness of the antichain algorithms, and applications such as the universality problem for finite automata illustrate efficiency improvements. Finally, we show that new and provably better antichain algorithms can be obtained for the emptiness problem of alternating automata over finite and infinite words.