The complexity of propositional linear temporal logics
Journal of the ACM (JACM)
Alternating automata, the weak monadic theory of the tree, and its complexity
International Colloquium on Automata, Languages and Programming on Automata, languages and programming
The complementation problem for Bu¨chi automata with applications to temporal logic
Theoretical Computer Science
Alternating automata on infinite trees
Theoretical Computer Science
POPL '88 Proceedings of the 15th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
In transition from global to modular temporal reasoning about programs
Logics and models of concurrent systems
The temporal logic of reactive and concurrent systems
The temporal logic of reactive and concurrent systems
On the power of bounded concurrency I: finite automata
Journal of the ACM (JACM)
Reasoning about infinite computations
Information and Computation
An automata-theoretic approach to linear temporal logic
Proceedings of the VIII Banff Higher order workshop conference on Logics for concurrency : structure versus automata: structure versus automata
Complexity results for two-way and multi-pebble automata and their logics
ICALP '94 Selected papers from the 21st international colloquium on Automata, languages and programming
Journal of the ACM (JACM)
Model checking
Program Verification
MFCS '00 Proceedings of the 25th International Symposium on Mathematical Foundations of Computer Science
Reasoning about The Past with Two-Way Automata
ICALP '98 Proceedings of the 25th International Colloquium on Automata, Languages and Programming
The ForSpec Temporal Logic: A New Temporal Property-Specification Language
TACAS '02 Proceedings of the 8th International Conference on Tools and Algorithms for the Construction and Analysis of Systems
Generalized Quantitative Temporal Reasoning: An Automata Theoretic Approach
TAPSOFT '97 Proceedings of the 7th International Joint Conference CAAP/FASE on Theory and Practice of Software Development
Hierarchical Development of Cncurrent Systems in a Temporal Logic Framework
Seminar on Concurrency, Carnegie-Mellon University
Temporal Logic with Fixed Points
Temporal Logic in Specification
On-the-Fly Model Checking of RCTL Formulas
CAV '98 Proceedings of the 10th International Conference on Computer Aided Verification
Methodology and System for Practical Formal Verification of Reactive Hardware
CAV '94 Proceedings of the 6th International Conference on Computer Aided Verification
Yet Another Process Logic (Preliminary Version)
Proceedings of the Carnegie Mellon Workshop on Logic of Programs
Proceedings of the Conference on Logic of Programs
Language Containment Checking with Nondeterministic BDDs
TACAS 2001 Proceedings of the 7th International Conference on Tools and Algorithms for the Construction and Analysis of Systems
The Declarative Past and Imperative Future: Executable Temporal Logic for Interactive Systems
Temporal Logic in Specification
Weak Alternating Automata Are Not That Weak
ISTCS '97 Proceedings of the Fifth Israel Symposium on the Theory of Computing Systems (ISTCS '97)
The ForSpec Temporal Logic: A New Temporal Property-Specification Language
TACAS '02 Proceedings of the 8th International Conference on Tools and Algorithms for the Construction and Analysis of Systems
View-Based Query Answering and Query Containment over Semistructured Data
DBPL '01 Revised Papers from the 8th International Workshop on Database Programming Languages
Alternation Elimination by Complementation (Extended Abstract)
LPAR '08 Proceedings of the 15th International Conference on Logic for Programming, Artificial Intelligence, and Reasoning
On Regular Temporal Logics with Past,
ICALP '09 Proceedings of the 36th Internatilonal Collogquium on Automata, Languages and Programming: Part II
Extended computation tree logic
LPAR'10 Proceedings of the 17th international conference on Logic for programming, artificial intelligence, and reasoning
Size-change termination and satisfiability for linear-time temporal logics
FroCoS'11 Proceedings of the 8th international conference on Frontiers of combining systems
Parity games played on transition graphs of one-counter processes
FOSSACS'06 Proceedings of the 9th European joint conference on Foundations of Software Science and Computation Structures
Regular linear temporal logic with past
VMCAI'10 Proceedings of the 11th international conference on Verification, Model Checking, and Abstract Interpretation
How to translate efficiently extensions of temporal logics into alternating automata
ICTAC'12 Proceedings of the 9th international conference on Theoretical Aspects of Computing
CATS '11 Proceedings of the Seventeenth Computing: The Australasian Theory Symposium - Volume 119
CATS 2011 Proceedings of the Seventeenth Computing on The Australasian Theory Symposium - Volume 119
Hi-index | 0.00 |
A key issue in the design of a model-checking tool is the choice of the formal language with which properties are specified. It is now recognized that a good language should extend linear temporal logic with the ability to specify all ω-regular properties. Also, designers, who are familiar with finite-state machines, prefer extensions based on automata than these based on fixed points or propositional quantification. Early extensions of linear temporal logic with automata use nondeterministic Büchi automata. Their drawback has been inability to refer to the past and the asymmetrical structure of nondeterministic automata. In this work we study an extension of linear temporal logic, called ETL2a, that uses two-way alternating automata as temporal connectives. Two-way automata can traverse the input word back and forth and they are exponentially more succinct than one-way automata. Alternating automata combine existential and universal branching and they are exponentially more succinct than nondeterministic automata. The rich structure of two-way alternating automata makes ETL2a a very powerful and convenient logic. We show that ETL2a formulas can be translated to nondeterministic Büchi automata with an exponential blow up. It follows that the satisfiability and model-checking problems for ETL2a are PSPACE-complete, as are the ones for LTL and its earlier extensions with automata. So, in spite of the succinctness of two-way and alternating automata, the advantages of ETL2a are obtained without a major increase in space complexity. The recent acceptance of alternating automata by the industry and the development of symbolic procedures for handling them make us optimistic about the practicality of ETL2a.