An Automata-Theoretic Approach to Linear Temporal Logic

@inproceedings{Vardi1995AnAA,
  title={An Automata-Theoretic Approach to Linear Temporal Logic},
  author={Moshe Y. Vardi},
  booktitle={Banff Higher Order Workshop},
  year={1995}
}
  • Moshe Y. Vardi
  • Published in Banff Higher Order Workshop 1 April 1996
  • Computer Science
The automata-theoretic approach to linear temporal logic uses the theory of automata as a unifying paradigm for program specification, verification, and synthesis. Both programs and specifications are in essence descriptions of computations. These computations can be viewed as words over some alphabet. Thus, programs and specifications can be viewed as descriptions of languages over some alphabet. The automata-theoretic perspective considers the relationships between programs and their… 
View via Publisher
ccs.neu.edu
721 Citations
Highly Influential Citations
44
Background Citations
224
Methods Citations
161
Results Citations
7

721 Citations

ON TRANSLATING LINEAR TEMPORAL LOGIC INTO ALTERNATING AND NONDETERMINISTIC AUTOMATA
TLDR
The proposed unified generalized definition for both alternating and nondeterministic automata facilitates combining the rules with new minimization heuristics for alternating automata, based on the general theory of using language containment tests and structural analysis of automata for removing transitions.
Extended Temporal Logic Revisited
TLDR
This work studies an extension of linear temporal logic that uses two-way alternating automata as temporal connectives, and shows that ETL2a formulas can be translated to nondeterministic Buchi automata with an exponential blow up, meaning that the satisfiability and model-checking problems for ETL 2a are PSPACE-complete.
Linear-Time Model Checking: Automata Theory in Practice
TLDR
The fundamentals of automata-theoretic model checking are reviewed, the reduction of the theory to practice is reviewed, and areas that require further research are outlined.
Automata and linear temporal logic : translations with transition-based acceptance
TLDR
The emptiness of generalized nondeterministic automata is shown to be testable without giving up generalized transition-based acceptance by using a new variant of the well-known nested depth-first search algorithm with improved worst-case resource requirements.
Automata-Theoretic Model Checking
TLDR
This paper explores one of the most successful applications of formal verification, known as model checking, which is a strategy for the verification of finite-state reactive systems, and focuses on the automata-theoretic approach to modelchecking, in which both the system model and logical specification are converted to automata over infinite words.
Focus games for satisfiability and completeness of temporal logic
  • M. Lange, C. Stirling
  • Computer Science
    Proceedings 16th Annual IEEE Symposium on Logic in Computer Science
  • 2001
Introduce a simple game-theoretic approach to satisfiability checking of temporal logic, for LTL (linear time logic) and CTL (computation tree logic), which has the same complexity as using automata.…
Automata-Theoretic Approach to Planning for Temporally Extended Goals
We study an automata-theoretic approach to planning for temporally extended goals. Specifically, we devise techniques based on nonemptiness of Buchi automata on infinite words, to synthesize…
Automata-Theoretic Model Checking Revisited
TLDR
The fundamentals of automata-theoretic model checking are covered, recent progress is reviewed, and areas that require further research are outlined.
Size-Change Termination and Satisfiability for Linear-Time Temporal Logics
TLDR
This paper presents a method for decision this emptiness problem without going through intermediate automaton models like nondeterministic ones, a direct adaptation of the size-change termination principle which was orgininally used to decide termination of abstract functional programs.
An automata-theoretic approach to constraint LTL
...
...

References

SHOWING 1-10 OF 77 REFERENCES
The complexity of tree automata and logics of programs
  • E. Emerson, C. Jutla
  • Computer Science
    [Proceedings 1988] 29th Annual Symposium on Foundations of Computer Science
  • 1988
TLDR
It is shown that for tree automata with m states and n pairs nonemptiness can be tested in time O((mn)/sup 3n/), even though the problem is in general NP-complete, and it follows that satisfiability for propositional dynamic logic with a repetition construct and for the propositional mu-calculus can be tests in deterministic single exponential time.
Nontraditional Applications of Automata Theory
TLDR
It is argued that the way finite-state automata theory is taught in schools needs to change to accommodate for the growing number of new applications.
Reasoning About Infinite Computations
TLDR
This work investigates extensions of temporal logic by connectives defined by finite automata on infinite words and shows that they do not increase the expressive power of the logic or the complexity of the decision problem.
Finite Automata and Their Decision Problems
TLDR
Finite automata are considered as instruments for classifying finite tapes as well as generalizations of the notion of an automaton are introduced and their relation to the classical automata is determined.
Theories of Automata on omega-Tapes: A Simplified Approach
Automata on Infinite Objects
  • W. Thomas
  • Computer Science
    Handbook of Theoretical Computer Science, Volume B: Formal Models and Sematics
  • 1990
Memory-efficient algorithms for the verification of temporal properties
TLDR
Algorithms are presented that solve the emptiness problem without explicitly constructing the strongly connected components of the graph representing the product automaton by allowing the algorithms to err with some probability.
On Equations for Regular Languages, Finite Automata, and Sequential Networks
The Complementation Problem for Büchi Automata with Appplications to Temporal Logic
On the complexity of omega -automata
  • S. Safra
  • Computer Science
    [Proceedings 1988] 29th Annual Symposium on Foundations of Computer Science
  • 1988
TLDR
The author presents a determinisation construction that is simpler and yields a single exponent upper bound for the general case, and can be used to obtain an improved complementation construction for Buchi automata that is essentially optimal.
...
...