Reasoning About Infinite Computations

We investigate extensions of temporal logic by connectives defined by finite automata on infinite words. We consider three different logics, corresponding to three different types of acceptance conditions (finite, looping, and repeating) for the automata. It turns out, however that these logics all have the same expressive power and that their decision problems are all PSPACE-complete. We also investigate connectives defined by alternating automata and show that they do not increase the expressive power of the logic or the complexity of the decision problem.

[1]  Roni Rosner,et al.  On the power of bounded concurrency. III. Reasoning about programs , 1990, [1990] Proceedings. Fifth Annual IEEE Symposium on Logic in Computer Science.

[2]  Pierre Wolper,et al.  Automata theoretic techniques for modal logics of programs: (Extended abstract) , 1984, STOC '84.

[3]  Vaughan R. Pratt,et al.  Models of program logics , 1979, 20th Annual Symposium on Foundations of Computer Science (sfcs 1979).

[4]  Richard E. Ladner,et al.  Application of Model Theoretic Games to Discrete Linear Orders and Finite Automata , 1977, Inf. Control..

[5]  Boris A. Trakhtenbrot,et al.  Finite automata : behavior and synthesis , 1973 .

[6]  Leslie Lamport,et al.  Proving the Correctness of Multiprocess Programs , 1977, IEEE Transactions on Software Engineering.

[7]  Moshe Y. Vardi.  Automatic verification of probabilistic concurrent finite state programs , 1985, 26th Annual Symposium on Foundations of Computer Science (sfcs 1985).

[8]  David Peleg,et al.  Process Logic with Regular Formulas , 1985, Theor. Comput. Sci..

[9]  Robin Milner,et al.  A Calculus of Communicating Systems , 1980, Lecture Notes in Computer Science.

[10]  Howard Barringer,et al.  Temporal Logic with Fixed Points , 1987, Temporal Logic in Specification.

[11]  David E. Muller,et al.  Infinite sequences and finite machines , 1963, SWCT.

[12]  Amir Pnueli,et al.  On the synthesis of a reactive module , 1989, POPL '89.

[13]  Pierre Wolper,et al.  The Complementation Problem for Büchi Automata with Appplications to Temporal Logic , 1987, Theor. Comput. Sci..

[14]  Moshe Y. Vardi.  The Taming of Converse: Reasoning about Two-way Computations , 1985, Logic of Programs.

[15]  L. Staiger.  Research in the theory of Ω-languages , 1987 .

[16]  A. Prasad Sistla,et al.  Deciding Full Branching Time Logic , 1985, Inf. Control..

[17]  Amir Pnueli,et al.  The Glory of the Past , 1985, Logic of Programs.

[18]  Edmund M. Clarke,et al.  Characterizing Correctness Properties of Parallel Programs Using Fixpoints , 1980, ICALP.

[19]  Vaughan R. Pratt,et al.  Semantical consideration on floyo-hoare logic , 1976, 17th Annual Symposium on Foundations of Computer Science (sfcs 1976).

[20]  Alan C. Shaw,et al.  Software Specification Languages Based on Regular Expressions , 1980 .

[21]  Richard E. Ladner,et al.  Propositional Dynamic Logic of Regular Programs , 1979, J. Comput. Syst. Sci..

[22]  Robert McNaughton,et al.  Testing and Generating Infinite Sequences by a Finite Automaton , 1966, Inf. Control..

[23]  Vaughan R. Pratt,et al.  A Near-Optimal Method for Reasoning about Action , 1980, J. Comput. Syst. Sci..

[24]  Tetsuo Moriya,et al.  Accepting Conditions for Automata on omega-Languages , 1988, Theor. Comput. Sci..

[25]  Ernst L. Leiss,et al.  On Equations for Regular Languages, Finite Automata, and Sequential Networks , 1980, Theor. Comput. Sci..

[26]  Ernst L. Leiss,et al.  Succint Representation of Regular Languages by Boolean Automata , 1981, Theor. Comput. Sci..

[27]  S. Safra,et al.  On the complexity of omega -automata , 1988, [Proceedings 1988] 29th Annual Symposium on Foundations of Computer Science.

[28]  Amir Pnueli,et al.  Temporal Logic in Specification , 1987, Lecture Notes in Computer Science.

[29]  Amir Pnueli,et al.  The temporal logic of programs , 1977, 18th Annual Symposium on Foundations of Computer Science (sfcs 1977).

[30]  Yaacov Choueka,et al.  Theories of Automata on omega-Tapes: A Simplified Approach , 1974, J. Comput. Syst. Sci..

[31]  David E. Muller,et al.  Weak alternating automata give a simple explanation of why most temporal and dynamic logics are decidable in exponential time , 1988, [1988] Proceedings. Third Annual Information Symposium on Logic in Computer Science.

[32]  Michael Kaminski.  A classification of o-regular languages , 1985 .

[33]  David Harel,et al.  Propositional Dynamic Logic of Flowcharts , 1985, Inf. Control..

[34]  Pierre Wolper.  Temporal Logic Can Be More Expressive , 1983, Inf. Control..

[35]  Saharon Shelah,et al.  On the temporal analysis of fairness , 1980, POPL '80.

[36]  Amir Pnueli,et al.  A really abstract concurrent model and its temporal logic , 1986, POPL '86.

[37]  David Harel,et al.  Looping vs. Repeating in Dynamic Logic , 1982, Inf. Control..

[38]  Vaughan R. Pratt,et al.  Using Graphs to Understand PDL , 1981, Logic of Programs.

[39]  Thomas A. Henzinger,et al.  Real-time logics: complexity and expressiveness , 1990, [1990] Proceedings. Fifth Annual IEEE Symposium on Logic in Computer Science.

[40]  Satoru Miyano,et al.  Alternating Finite Automata on omega-Words , 1984, CAAP.

[41]  Joseph Y. Halpern,et al.  The prepositional dynamic logic of deterministic, well-structured programs , 1981, 22nd Annual Symposium on Foundations of Computer Science (sfcs 1981).

[42]  Pierre Wolper,et al.  Yet Another Process Logic (Preliminary Version) , 1983, Logic of Programs.

[43]  Aravinda Prasad Sistla,et al.  Theoretical issues in the design and verification of distributed systems , 1983 .

[44]  Pierre Wolper,et al.  An Automata-Theoretic Approach to Automatic Program Verification (Preliminary Report) , 1986, LICS.

[45]  Robert S. Streett,et al.  Propositional Dynamic Logic of Looping and Converse Is Elementarily Decidable , 1982, Inf. Control..

[46]  David Harel,et al.  Process logic: Expressiveness, decidability, completeness , 1980, 21st Annual Symposium on Foundations of Computer Science (sfcs 1980).

[47]  Dana S. Scott,et al.  Finite Automata and Their Decision Problems , 1959, IBM J. Res. Dev..

[48]  David Harel,et al.  First-Order Dynamic Logic , 1979, Lecture Notes in Computer Science.

[49]  J. R. Büchi.  On a Decision Method in Restricted Second Order Arithmetic , 1990 .

[50]  Neil D. Jones,et al.  Space-Bounded Reducibility among Combinatorial Problems , 1975, J. Comput. Syst. Sci..

[51]  Moshe Y. Vardi.  A temporal fixpoint calculus , 1988, POPL '88.

[52]  Pierre Wolper,et al.  Synthesis of Communicating Processes from Temporal Logic Specifications , 1981, TOPL.

[53]  David Harel,et al.  Nondeterminism in logics of programs , 1978, POPL.