A temporal logic for reasoning about partially ordered computations (Extended Abstract)

Current Temporal Logics are all oriented towards the description of totally ordered sequences. This limits their usefulness for reasoning about systems whose computations cannot easily be mapped into totally ordered sequences. Here, we propose a temporal logic geared towards describing partially ordered sets and apply it to dynamic distributed systems. Even though the logic we define does not have the finite model property, we establish that it has a one exponential decision procedure and a complete axiomatization.

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

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

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

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

[5]  Edmund M. Clarke,et al.  Design and Synthesis of Synchronization Skeletons Using Branching-Time Temporal Logic , 1981, Logic of Programs.

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

[7]  Robert S. Streett.  Propositional Dynamic Logic of looping and converse , 1981, STOC '81.

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

[9]  Zohar Manna,et al.  Verification of concurrent programs, Part I: The temporal framework , 1981 .

[10]  Robert S. Boyer,et al.  The Correctness Problem in Computer Science , 1982 .

[11]  Mordechai Ben-Ari,et al.  The Temporal Logic of Branching Time , 1981, POPL.

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

[13]  Vaughan R. Pratt,et al.  On the composition of processes , 1982, POPL '82.

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