Automata-Theoretic techniques for modal logics of programs
Journal of Computer and System Sciences
Alternating automata, the weak monadic theory of the tree, and its complexity
International Colloquium on Automata, Languages and Programming on Automata, languages and programming
On the synthesis of a reactive module
POPL '89 Proceedings of the 16th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Tree automata, Mu-Calculus and determinacy
SFCS '91 Proceedings of the 32nd annual symposium on Foundations of computer science
Computational recreations in Mathematica
Computational recreations in Mathematica
Reasoning about infinite computations
Information and Computation
Weak alternating automata and tree automata emptiness
STOC '98 Proceedings of the thirtieth annual ACM symposium on Theory of computing
An automata-theoretic approach to branching-time model checking
Journal of the ACM (JACM)
Weak alternating automata are not that weak
ACM Transactions on Computational Logic (TOCL)
Complementation of Büchi Automata Revised
Jewels are Forever, Contributions on Theoretical Computer Science in Honor of Arto Salomaa
Reasoning about The Past with Two-Way Automata
ICALP '98 Proceedings of the 25th International Colloquium on Automata, Languages and Programming
Weak Alternating Automata in Isabelle/HOL
TPHOLs '00 Proceedings of the 13th International Conference on Theorem Proving in Higher Order Logics
Small Progress Measures for Solving Parity Games
STACS '00 Proceedings of the 17th Annual Symposium on Theoretical Aspects of Computer Science
Language containment of non-deterministic omega-automata
CHARME '95 Proceedings of the IFIP WG 10.5 Advanced Research Working Conference on Correct Hardware Design and Verification Methods
State Space Reductions for Alternating Büchi Automata
FST TCS '02 Proceedings of the 22nd Conference Kanpur on Foundations of Software Technology and Theoretical Computer Science
MONA 1.x: New Techniques for WS1S and WS2S
CAV '98 Proceedings of the 10th International Conference on Computer Aided Verification
A Decision Procedure for the Propositional µ-Calculus
Proceedings of the Carnegie Mellon Workshop on Logic of Programs
Automata, Tableaux and Temporal Logics (Extended Abstract)
Proceedings of the Conference on Logic of Programs
On the complexity of omega -automata
SFCS '88 Proceedings of the 29th Annual Symposium on Foundations of Computer Science
The complexity of tree automata and logics of programs
SFCS '88 Proceedings of the 29th Annual Symposium on Foundations of Computer Science
Theories of automata on ω-tapes: A simplified approach
Journal of Computer and System Sciences
CIAA'03 Proceedings of the 8th international conference on Implementation and application of automata
Complementation constructions for nondeterministic automata on infinite words
TACAS'05 Proceedings of the 11th international conference on Tools and Algorithms for the Construction and Analysis of Systems
A new algorithm for strategy synthesis in LTL games
TACAS'05 Proceedings of the 11th international conference on Tools and Algorithms for the Construction and Analysis of Systems
SMT-based synthesis of distributed systems
Proceedings of the second workshop on Automated formal methods
An Incremental Technique for Automata-Based Decision Procedures
CADE-21 Proceedings of the 21st international conference on Automated Deduction: Automated Deduction
25 Years of Model Checking
ICALP '08 Proceedings of the 35th international colloquium on Automata, Languages and Programming, Part II
ATL* Satisfiability Is 2EXPTIME-Complete
ICALP '08 Proceedings of the 35th international colloquium on Automata, Languages and Programming, Part II
From Verification to Synthesis
VSTTE '08 Proceedings of the 2nd international conference on Verified Software: Theories, Tools, Experiments
From Philosophical to Industrial Logics
ICLA '09 Proceedings of the 3rd Indian Conference on Logic and Its Applications
Formal Methods in System Design
Lower Bounds on Witnesses for Nonemptiness of Universal Co-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
Synthesis from Component Libraries
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
Compositional Synthesis of Reactive Systems from Live Sequence Chart Specifications
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
Realizability of Real-Time Logics
FORMATS '09 Proceedings of the 7th International Conference on Formal Modeling and Analysis of Timed Systems
The planning spectrum: one, two, three, infinity
Journal of Artificial Intelligence Research
Automatic synthesis of new behaviors from a library of available behaviors
IJCAI'07 Proceedings of the 20th international joint conference on Artifical intelligence
ATVA'07 Proceedings of the 5th international conference on Automated technology for verification and analysis
From LTL to symbolically represented deterministic automata
VMCAI'08 Proceedings of the 9th international conference on Verification, model checking, and abstract interpretation
A hybrid algorithm for LTL games
VMCAI'08 Proceedings of the 9th international conference on Verification, model checking, and abstract interpretation
Information and Computation
Pillars of computer science
Automata-Based Axiom Pinpointing
Journal of Automated Reasoning
Safraless procedures for timed specifications
FORMATS'10 Proceedings of the 8th international conference on Formal modeling and analysis of timed systems
Compositional algorithms for LTL synthesis
ATVA'10 Proceedings of the 8th international conference on Automated technology for verification and analysis
Synthesis of trigger properties
LPAR'10 Proceedings of the 16th international conference on Logic for programming, artificial intelligence, and reasoning
State of büchi complementation
CIAA'10 Proceedings of the 15th international conference on Implementation and application of automata
Debugging unrealizable specifications with model-based diagnosis
HVC'10 Proceedings of the 6th international conference on Hardware and software: verification and testing
FOSSACS'11/ETAPS'11 Proceedings of the 14th international conference on Foundations of software science and computational structures: part of the joint European conferences on theory and practice of software
The blow-up in translating LTL to deterministic automata
MoChArt'10 Proceedings of the 6th international conference on Model checking and artificial intelligence
Minimum attention controller synthesis for omega-regular objectives
FORMATS'11 Proceedings of the 9th international conference on Formal modeling and analysis of timed systems
Antichains and compositional algorithms for LTL synthesis
Formal Methods in System Design
Solving games without determinization
CSL'06 Proceedings of the 20th international conference on Computer Science Logic
Safraless compositional synthesis
CAV'06 Proceedings of the 18th international conference on Computer Aided Verification
CAV'10 Proceedings of the 22nd international conference on Computer Aided Verification
Synthesis of Reactive(1) designs
Journal of Computer and System Sciences
Finding shortest witnesses to the nonemptiness of automata on infinite words
CONCUR'06 Proceedings of the 17th international conference on Concurrency Theory
On the construction of fine automata for safety properties
ATVA'06 Proceedings of the 4th international conference on Automated Technology for Verification and Analysis
Recent challenges and ideas in temporal synthesis
SOFSEM'12 Proceedings of the 38th international conference on Current Trends in Theory and Practice of Computer Science
Effective synthesis of asynchronous systems from GR(1) specifications
VMCAI'12 Proceedings of the 13th international conference on Verification, Model Checking, and Abstract Interpretation
Towards a notion of unsatisfiable and unrealizable cores for LTL
Science of Computer Programming
Formal Methods in System Design
TACAS'12 Proceedings of the 18th international conference on Tools and Algorithms for the Construction and Analysis of Systems
Deterministic automata for the (f, g)-fragment of LTL
CAV'12 Proceedings of the 24th international conference on Computer Aided Verification
Acacia+, a tool for LTL synthesis
CAV'12 Proceedings of the 24th international conference on Computer Aided Verification
Translating to Co-Büchi Made Tight, Unified, and Useful
ACM Transactions on Computational Logic (TOCL)
Pushdown module checking with imperfect information
CONCUR'07 Proceedings of the 18th international conference on Concurrency Theory
Tightening the exchange rates between automata
CSL'07/EACSL'07 Proceedings of the 21st international conference, and Proceedings of the 16th annuall conference on Computer Science Logic
Tight bounds for the determinisation and complementation of generalised Büchi automata
ATVA'12 Proceedings of the 10th international conference on Automated Technology for Verification and Analysis
ATVA'12 Proceedings of the 10th international conference on Automated Technology for Verification and Analysis
Pushdown module checking with imperfect information
Information and Computation
HVC'11 Proceedings of the 7th international Haifa Verification conference on Hardware and Software: verification and testing
Synthesizing nonanomalous event-based controllers for liveness goals
ACM Transactions on Software Engineering and Methodology (TOSEM)
Synthesis from LTL specifications with mean-payoff objectives
TACAS'13 Proceedings of the 19th international conference on Tools and Algorithms for the Construction and Analysis of Systems
Fair Synthesis for Asynchronous Distributed Systems
ACM Transactions on Computational Logic (TOCL)
Formalizing and reasoning about quality
ICALP'13 Proceedings of the 40th international conference on Automata, Languages, and Programming - Volume Part II
Nondeterminism in the presence of a diverse or unknown future
ICALP'13 Proceedings of the 40th international conference on Automata, Languages, and Programming - Volume Part II
Automata with generalized rabin pairs for probabilistic model checking and LTL synthesis
CAV'13 Proceedings of the 25th international conference on Computer Aided Verification
Hi-index | 0.00 |
The automata-theoretic approach is one of the most fundamental approaches to developing decision procedures in mathematical logics. To decide whether a formula in a logic with the tree-model property is satisfiable, one constructs an automaton that accepts all (or enough) tree models of the formula and then checks that the language of this automaton is nonempty. The standard approach translates formulas into alternating parity tree automata, which are then translated, via Safra驴s determinization construction, into nondeterministic parity automata. This approach is not amenable to implementation because of the difficulty of implementing Safra驴s construction and the nonemptiness test for nondeterministic parity tree automata. In this paper we offer an alternative to the standard automata-theoretic approach. The crux of our approach is avoiding the use of Safra驴s construction and of nondeterministic parity tree automata. Our approach goes instead via universal co-Buchi tree automata and nondeterministic Büchi tree automata. Our translations are significantly simpler than the standard approach, less difficult to implement, and have practical advantages like being amenable to optimizations and a symbolic implementation. We also show that our approach yields better complexity bounds.