Abstract

Abstract. 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 specificationscan be viewed as descriptions of languagesover some alphabet. The automata-theoretic perspective considers the relationships between programs and their specifications as relationships between languages.By translating programs and specifications to automata, questions about programs and their specifications can be reduced to questions about automata. More specifically, questions such as satisfiability of specifications and correctness of programs with respect to their specifications can be reduced to questions such as nonemptiness and containment of automata. Unlike classical automata theory, which focused on automata on finite words, the applications to program specification, verification, and synthesis, use automata on infinite words, since the computations in which we are interested are typically infinite. This paper provides an introduction to the theory of automata on infinite words and demonstrates its applications to program specification, verification, and synthesis. 1

Citations

8879	Computers and Intractability: A guide to the Theory of NP-Completeness - Garey, Johnson - 1979
7320	Introduction to Algorithms - CORMEN, LEISERSON, et al. - 1985
3376	Introduction to Automata Theory Languages and Computation. 2nd edition. Addison-Wesley Publishing Company, 2000. de - Hopcroft, Ullman - 2004
1412	The Temporal Logic of Reactive and Concurrent Systems - Manna, Pnueli - 1992
999	The temporal logic of programs - Pnueli - 1977
510	An automata-theoretic approach to automatic program verification - Vardi, Wolper - 1986
393	Computer-Aided Verification of Coordinating Processes: The Automata-Theoretic Approach - Kurshan - 1994
301	On a decision method in restricted second order arithmetic - Buchi - 1962
289	The complexity of propositional linear temporal logics - Sistla, Clarke - 1985
283	A.: On the development of reactive systems - Harel, Pnueli - 1985
266	R.: On the synthesis of a reactive module - Pnueli, Rosner - 1989
262	Relationships between nondeterministic and deterministic tape complexities - Savitch - 1970
234	Theory for Automatic Hierarchical Verification of SpeedIndependent Circuits, ACM Distinguished Dissertations - Dill - 1989
219	A.: Checking that finite state concurrent programs satisfy their linear specification - Lichtenstein, Pnueli - 1985
212	On the temporal analysis of fairness - Gabbay, Pnueli, et al. - 1980
209	Reasoning about infinite computations - Vardi, Wolper - 1994
186	Sometimes" and "Not Never" revisited: On branching versus linear time - EMERSON, HALPERN - 1983
184	D.: Finite automata and their decision problems - Rabin, Scott - 1959
171	Descriptive Set Theory - Moschovakis - 1980
160	L.J.: The equivalence problem for regular expressions with squaring requires exponential space - Meyer, Stockmeyer - 1972
145	Synthesis of communicating processes from temporal logic specifications - MANNA, WOLPER - 1981
138	L.: Proving liveness properties of concurrent programs - Owicki, Lamport - 1982
134	C.: The complexity of tree automata and logics of programs - Emerson, Jutla - 1988
118	The glory of the past - Lichtenstein, Pnueli, et al. - 1985
114	Solving sequential conditions by finite-state strategies - Buchi, Landweber - 1969
108	P.: The complementation problem for Büchi automata with applications to temporal logic - Sistla, Vardi, et al. - 1985
106	M.: Memory efficient algorithms for the verification of temporal properties - Courcoubetis, Vardi, et al. - 1992
102	Decidability of second order theories and automata on infinite trees - Rabin - 1969
81	Testing and generating infinite sequences by a finite automaton - McNaughton - 1966
73	Space-bounded reducibility among combinatorial problems - Jones - 1975
70	Modalities for model checking: Branching time logic strikes back - Emerson, Lei - 1987
70	P.: Reasoning about infinite computation paths - Wolper, Vardi, et al. - 1983
66	Alternating automata on infinite trees - Muller, Schupp - 1987
56	M.J.: Economy of description by automata, grammars, and formal systems - Meyer, Fischer - 1971
56	Automata on infinite objects, in: Handbook of Theoretical Computer Science - Thomas - 1990
52	Automata on infinite objects and Church’s problem - Rabin - 1972
36	Theories of automata on !-tapes: A simplified approach - Choueka
34	Sometime" is sometimes "not never": on the temporal logic of programs - Lamport - 1980
34	Improved upper and lower bounds for modal logics of programs - Vardi, Stockmeyer - 1985
33	Realizable and unrealizable concurrent program specifications - Abadi, Lamport, et al. - 1989
33	Weak alternating automata give a simple explanation of why most temporal and dynamic logics are decidable in exponential time - Muller, Saoudi, et al. - 1988
28	Using branching time logic to synthesize synchronization skeletons - EMERSON, CLARKE - 1982
28	Complementation is more difficult with automata on infinite words - Michel - 1988
28	On the complexity of omega-automata - Safra - 1988
23	Temporal model checking under generalized fairness constraints - Emerson, Lei - 1985
22	Chromosome engineering - Ramirez-Solis, Liu, et al. - 1995
21	Nontraditional applications of automata theory - Vardi - 1994
16	Finite automata and sequential networks - Brzozowski, Leiss - 1980
15	temporal logics - Automata - 1985
15	Succinct representation of regular languages by Boolean automata, Theoret - Leiss - 1981