The Temporal Logic of Reactive and Concurrent Systems

Reactive systems are computing systems which are interactive, such as real-time systems, operating systems, concurrent systems and control systems. These are among the most difficult computing systems to program. Temporal logic is a formal tool/language which yields excellent results in specifying reactive systems, and this volume (the first of two), offers an introduction to temporal logic and to the computational model for reactive programs which has been developed by the authors.

[1]  Wolfgang Thomas,et al.  Automata on Infinite Objects , 1991, Handbook of Theoretical Computer Science, Volume B: Formal Models and Sematics.

[2]  Leslie Lamport,et al.  A new solution of Dijkstra's concurrent programming problem , 1974, Commun. ACM.

[3]  Roy H. Campbell,et al.  The specification of process synchronization by path expressions , 1974, Symposium on Operating Systems.

[4]  Ernst-Rüdiger Olderog,et al.  Proof Rules and Transformations Dealing with Fairness , 1983, Sci. Comput. Program..

[5]  Saul A. Kripke,et al.  Semantical Analysis of Modal Logic I Normal Modal Propositional Calculi , 1963 .

[6]  Amir Pnueli,et al.  Explicit clock temporal logic , 1990, [1990] Proceedings. Fifth Annual IEEE Symposium on Logic in Computer Science.

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

[8]  Antony Galton.  Temporal logic and computer science: an overview , 1987 .

[9]  Philippe Darondeau.  About Fair Asynchrony , 1985, Theor. Comput. Sci..

[10]  James W. Garson,et al.  Quantification in Modal Logic , 1984 .

[11]  Leslie Lamport.  What it means for a concurrent program to satisfy a specification: why no one has specified priority , 1985, POPL '85.

[12]  John C. Reynolds,et al.  Syntactic control of interference , 1978, POPL.

[13]  R. Goldblatt.  Logics of Time and Computation , 1987 .

[14]  Wolfgang Reisig.  Petri Nets: An Introduction , 1985, EATCS Monographs on Theoretical Computer Science.

[15]  C. A. R. Hoare,et al.  Communicating sequential processes , 1978, CACM.

[16]  A. Prasad Sistla,et al.  Can Message Buffers Be Axiomatized in Linear Temporal Logic? , 1984, Inf. Control..

[17]  Thomas A. Henzinger,et al.  Temporal proof methodologies for real-time systems , 1991, POPL '91.

[18]  Gary L. Peterson.  A New Solution to Lamport's Concurrent Programming Problem Using Small Shared Variables , 1983, TOPL.

[19]  Dominique Perrin,et al.  First-Order Logic and Star-Free Sets , 1986, J. Comput. Syst. Sci..

[20]  Dov M. Gabbay,et al.  Investigations in modal and tense logics with applications to problems in philosophy and linguistics , 1976 .

[21]  Amir Pnueli,et al.  Applications of Temporal Logic to the Specification and Verification of Reactive Systems: A Survey of Current Trends , 1986, Current Trends in Concurrency.

[22]  K. Mani Chandy,et al.  A Distributed Graph Algorithm: Knot Detection , 1982, TOPL.

[23]  Dominique Perrin,et al.  Recent Results on Automata and Infinite Words , 1984, MFCS.

[24]  Thomas A. Henzinger,et al.  The benefits of relaxing punctuality , 1991, PODC '91.

[25]  André Arnold,et al.  A Syntactic Congruence for Rational omega-Language , 1985, Theor. Comput. Sci..

[26]  ZOHAR MANNA,et al.  The Correctness of Programs , 1969, J. Comput. Syst. Sci..

[27]  Edsger W. Dijkstra,et al.  Guarded commands, non-determinacy and a calculus for the derivation of programs , 1975, Language Hierarchies and Interfaces.

[28]  Zohar Manna.  Verification of Sequential Programs: Temporal Axiomatization , 1982 .

[29]  Brent Hailpern.  Verifying Concurrent Processes Using Temporal Logic , 1982, Lecture Notes in Computer Science.

[30]  Brent Hailpern,et al.  Modular Verification of Computer Communication Protocols , 1983, IEEE Trans. Commun..

[31]  Van Nguyen,et al.  A model and temporal proof system for networks of processes , 1985, POPL '85.

[32]  P. M. Melliar-Smith,et al.  An Interval-Based Temporal Logic , 1983, Logic of Programs.

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

[34]  Robin Milner,et al.  Communication and concurrency , 1989, PHI Series in computer science.

[35]  Johan Anthory Willem Kamp,et al.  Tense logic and the theory of linear order , 1968 .

[36]  Amir Pnueli,et al.  Impartiality, Justice and Fairness: The Ethics of Concurrent Termination , 1981, ICALP.

[37]  Martín Abadi,et al.  Temporal Logic Programming , 1989, J. Symb. Comput..

[38]  Amir Pnueli,et al.  Verification of multiprocess probabilistic protocols , 1984, PODC '84.

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

[40]  Edsger W. Dijkstra,et al.  Solution of a problem in concurrent programming control , 1965, CACM.

[41]  Zohar Manna,et al.  Completing the Temporal Picture , 1991, Theor. Comput. Sci..

[42]  Neelam Soundararajan,et al.  Axiomatic semantics of communicating sequential processes , 1984, ACM Trans. Program. Lang. Syst..

[43]  Pierre Wolper,et al.  A temporal logic for reasoning about partially ordered computations (Extended Abstract) , 1984, PODC '84.

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

[45]  Drew McDermott,et al.  A Temporal Logic for Reasoning About Processes and Plans , 1982, Cogn. Sci..

[46]  John P. Burgess,et al.  Axioms for tense logic. II. Time periods , 1982, Notre Dame J. Formal Log..

[47]  Masahiro Fujita,et al.  Tokio: Logic Programming Language Based on Temporal Logic and its Compilation to Prolog , 1986, ICLP.

[48]  E. Allen Emerson,et al.  The complexity of tree automata and logics of programs , 1988, [Proceedings 1988] 29th Annual Symposium on Foundations of Computer Science.

[49]  Jonathan S. Ostroff,et al.  Temporal logic for real-time systems , 1989 .

[50]  Ehud Shapiro,et al.  The family of concurrent logic programming languages , 1989, CSUR.

[51]  A. Prasad Sistla,et al.  Can message buffers be characterized in linear temporal logic? , 1982, PODC '82.

[52]  Leslie Lamport,et al.  Specifying Concurrent Program Modules , 1983, TOPL.

[53]  Eike Best,et al.  Fairness and Conspiracies , 1984, Inf. Process. Lett..

[54]  Zohar Manna,et al.  The anchored version of the temporal framework , 1988, REX Workshop.

[55]  Lutz Priese,et al.  An Introduction to the Regular Theory of Fairness , 1987, Theor. Comput. Sci..

[56]  J. Büchi.  Weak Second‐Order Arithmetic and Finite Automata , 1960 .

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

[58]  John P. Burgess,et al.  The decision problem for linear temporal logic , 1985, Notre Dame J. Formal Log..

[59]  Zohar Manna,et al.  A Hardware Semantics Based on Temporal Intervals , 1983, ICALP.

[60]  Benjamin Charles Moszkowski.  Reasoning about Digital Circuits , 1983 .

[61]  Grzegorz Rozenberg,et al.  Infinitary Languages: Basic Theory an Applications to Concurrent Systems , 1986, Current Trends in Concurrency.

[62]  Mordechai Ben-Ari,et al.  The temporal logic of branching time , 1981, POPL '81.

[63]  J. M. Larrazabal,et al.  Reasoning about change , 1991 .

[64]  Leslie Lamport,et al.  What Good is Temporal Logic? , 1983, IFIP Congress.

[65]  David Harel,et al.  Effective transformations on infinite trees, with applications to high undecidability, dominoes, and fairness , 1986, JACM.

[66]  A. Prasad Sistla,et al.  On characterization of safety and liveness properties in temporal logic , 1985, ACM SIGACT-SIGOPS Symposium on Principles of Distributed Computing.

[67]  C. Petri.  Kommunikation mit Automaten , 1962 .

[68]  Ben C. Moszkowski,et al.  Executing temporal logic programs , 1986, Seminar on Concurrency.

[69]  Edmund M. Clarke,et al.  Using Branching Time Temporal Logic to Synthesize Synchronization Skeletons , 1982, Sci. Comput. Program..

[70]  Amir Pnueli,et al.  A Compositional Approach to a CSP-like Language , 1985 .

[71]  Brian F. Chellas.  Modal Logic: Normal systems of modal logic , 1980 .

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

[73]  Leslie Lamport,et al.  Proving Liveness Properties of Concurrent Programs , 1982, TOPL.

[74]  Joseph Y. Halpern,et al.  Decision procedures and expressiveness in the temporal logic of branching time , 1982, STOC '82.

[75]  Krzysztof R. Apt,et al.  Countable nondeterminism and random assignment , 1986, JACM.

[76]  M. Baudinet.  Logic programming semantics: techniques and applications , 1989 .

[77]  N. G. de Bruijn,et al.  Additional comments on a problem in concurrent programming control , 1967, Commun. ACM.

[78]  Marianne Baudinet,et al.  Temporal logic programming is complete and expressive , 1989, POPL '89.

[79]  Jozef Hooman,et al.  The Quest Goes on: A Survey of Proofsystems for Partial Correctness of CSP , 1986, Current Trends in Concurrency.

[80]  Wolfgang Reisig.  Towards a temporal logic of causality and choice in distributed systems , 1988, REX Workshop.

[81]  Z. Manna,et al.  Verification of concurrent programs: a temporal proof system , 1983 .

[82]  Arthur J. Bernstein,et al.  Analysis of Programs for Parallel Processing , 1966, IEEE Trans. Electron. Comput..

[83]  D. Park.  A Predicate Transformer for Weak Fair Iteration , 1981 .

[84]  Saharon Shelah,et al.  Reasoning with Time and Chance , 1982, Inf. Control..

[85]  Ron Koymans.  Specifying message passing systems requires extending temporal logic , 1987, PODC '87.

[86]  Gilles Kahn,et al.  The Semantics of a Simple Language for Parallel Programming , 1974, IFIP Congress.

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

[88]  Donald E. Knuth,et al.  Additional comments on a problem in concurrent programming control , 1966, CACM.

[89]  Willem P. de Roever,et al.  A Proof System for Communicating Sequential Processes , 1980, ACM Trans. Program. Lang. Syst..

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

[91]  Amir Pnueli,et al.  A Framework for the Synthesis of Reactive Modules , 1988, Concurrency.

[92]  Martín Abadi,et al.  Nonclausal deduction in first-order temporal logic , 1990, JACM.

[93]  Zohar Manna,et al.  The Modal Logic of Programs , 1979, ICALP.

[94]  James F. Allen.  Towards a General Theory of Action and Time , 1984, Artif. Intell..

[95]  C. A. R. Hoare,et al.  Monitors: an operating system structuring concept , 1974, CACM.

[96]  永田 守男,et al.  Verifying Properties of Parallel Programs : An Axiomatic Approach , 1976 .

[97]  Robert M. Keller,et al.  Formal verification of parallel programs , 1976, CACM.

[98]  Pierre Wolper,et al.  Reasoning about infinite computation paths , 1983, 24th Annual Symposium on Foundations of Computer Science (sfcs 1983).

[99]  Amir Pnueli,et al.  A Choppy Logic , 1986, LICS.

[100]  Nancy A. Lynch,et al.  Hierarchical correctness proofs for distributed algorithms , 1987, PODC '87.

[101]  Willem P. de Roever,et al.  A Proof System for Partial Correctness of Dynamic Networks of Processes (Extended Abstract) , 1983, Logic of Programs.

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

[103]  André Arnold.  Topological Characterizations of Infinite Behaviours of Transition Systems , 1983, ICALP.

[104]  W-P de Roever,et al.  The quest for compositionality - a survey of assertion - based proof systems for concurrent programs. Part 1 ; concurrency based on shared variables , 1985 .

[105]  Leslie Lamport,et al.  "Sometime" is sometimes "not never": on the temporal logic of programs , 1980, POPL '80.

[106]  P. M. Melliar-Smith,et al.  From State Machines to Temporal Logic: Specification Methods for Protocol Standards , 1982, The Analysis of Concurrent Systems.

[107]  Bengt Jonsson,et al.  Modular verification of asynchronous networks , 1987, PODC '87.

[108]  A. Tarski.  A LATTICE-THEORETICAL FIXPOINT THEOREM AND ITS APPLICATIONS , 1955 .

[109]  Zohar Manna,et al.  Properties of Programs and the First-Order Predicate Calculus , 1969, JACM.

[110]  Leslie Lamport,et al.  Distributed Systems: Methods and Tools for Specification, An Advanced Course, April 3-12, 1984 and April 16-25, 1985, Munich, Germany , 1985, Advanced Course: Distributed Systems.

[111]  Doron A. Peled,et al.  Interleaving set temporal logic , 1987, PODC '87.

[112]  Zohar Manna,et al.  How to cook a temporal proof system for your pet language , 1983, POPL '83.

[113]  Pierre Wolper,et al.  Expressing interesting properties of programs in propositional temporal logic , 1986, POPL '86.

[114]  Zohar Manna,et al.  Proving Precedence Properties: The Temporal Way , 1983, ICALP.

[115]  David Lorge Parnas,et al.  Concurrent control with “readers” and “writers” , 1971, CACM.

[116]  Willem P. de Roever,et al.  Real-time programming and asynchronous message passing , 1983, PODC '83.

[117]  Wolfgang Thomas,et al.  Star-Free Regular Sets of omega-Sequences , 1979, Inf. Control..

[118]  Willem P. de Roever,et al.  Examples of a Real-Time Temporal Logic Specification , 1983, The Analysis of Concurrent Systems.

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

[120]  K. Mani Chandy,et al.  Proving safety and liveness of communicating processes with examples , 1982, PODC '82.

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

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

[123]  John Bacon,et al.  Substance and first-order quantification over individual-concepts , 1980, Journal of Symbolic Logic.

[124]  David Michael Ritchie Park,et al.  On the Semantics of Fair Parallelism , 1979, Abstract Software Specifications.

[125]  Amir Pnueli,et al.  On the extremely fair treatment of probabilistic algorithms , 1983, STOC.