Branching versus linear logics yet again

A brief overview is given of the temporal logics used in concurrent program verification and in database and systems specification. The properties of the underlying modal frame structures are analysed. The relative advantages of the linear and branching approaches are discussed. The state versus path formulas controversy is revisited. A meta-linear operatorL is proposed and compared with the “in all trajectories” operator considered in the language CTL*. The usefulness of the new operator within the context of a layered methodology for database and information systems specification and verification is illustrated. The operator is seen as a “frame change operator” and other interesting operators of this class are referred. Finitary and infinitary axiomatisations are given for the operatorL. The proof of the completeness of the infinitary axiomatisation is briefly outlined. This proof requires an appropriate extension of the usual Henkin methods.

[1]  James F. Allen.  Maintaining knowledge about temporal intervals , 1983, CACM.

[2]  Alberto Zanardo.  A complete deductive-system for since-until branching-time logic , 1991, J. Philos. Log..

[3]  C. Kung.  A Tableaux Approach for Consistency Checking , 1985, TFAIS.

[4]  José Luiz Fiadeiro,et al.  Specification and verification of database dynamics , 1988, Acta Informatica.

[5]  Amir Pnueli,et al.  Specification and Development of Reactive Systems (Invited Paper) , 1986, IFIP Congress.

[6]  José Carmo.  The INFOLOG Branching Logic of Events , 1985, TFAIS.

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

[8]  José Luiz Fiadeiro,et al.  The INFOLOG linear tense propositional logic of events and transactions , 1986, Inf. Syst..

[9]  José Luiz Fiadeiro,et al.  Abstract Object Types: A Temporal Perspective , 1987, Temporal Logic in Specification.

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

[11]  Antonio L. Furtado,et al.  A Temporal Framework for Database Specifications , 1982, VLDB.

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

[13]  Joseph Sifakis,et al.  Specification and Development of Reactive Systems - Response , 1986, IFIP Congress.

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

[15]  E. A Emerson,et al.  Alternative Semantics for Temporal Logics , 1981, Theor. Comput. Sci..

[16]  Alasdair Urquhart,et al.  Temporal Logic , 1971 .

[17]  Herbert B. Enderton,et al.  A mathematical introduction to logic , 1972 .

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

[19]  Erich J. Neuhold,et al.  Formal techniques for data base design , 1986 .

[20]  Joseph Y. Halpern,et al.  “Sometimes” and “not never” revisited: on branching versus linear time temporal logic , 1986, JACM.

[21]  C. A. R. HOARE,et al.  An axiomatic basis for computer programming , 1969, CACM.

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

[23]  G. Boolos.  The Unprovability of Consistency: An Essay in Modal Logic , 1979 .

[24]  Antonio L. Furtado,et al.  Towards Simpler and Yet Complete Formal Specifications , 1986, TFAIS.

[25]  Edsger W. Dijkstra,et al.  Guarded commands, nondeterminacy and formal derivation of programs , 1975, Commun. ACM.

[26]  Cristina Sernadas,et al.  Abstract Object Types for Databases , 1988, OODBS.

[27]  Amílcar Sernadas,et al.  Formal techniques for systems specification and verification , 1991, Inf. Syst..

[28]  Max J. Cresswell,et al.  A New Introduction to Modal Logic , 1998 .

[29]  Fred Kröger,et al.  Temporal Logic of Programs , 1987, EATCS Monographs on Theoretical Computer Science.

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

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

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

[33]  Colin Stirling,et al.  Comparing Linear and Branching Time Temporal Logics , 1987, Temporal Logic in Specification.

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

[35]  Johan van Benthem,et al.  The Logic of Time , 1983 .

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

[37]  Edmund M. Clarke,et al.  A Synthesis of Two Approaches for Verifying Finite State Concurrent Systems , 1989, J. Log. Comput..

[38]  Cristina Sernadas,et al.  Object-Oriented Specification of Databases: An Algebraic Approach , 1987, VLDB.

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

[40]  Amílcar Sernadas,et al.  Inevitability in Branching Time , 1989, Logic at Botik.

[41]  Vaughan R. Pratt,et al.  SEMANTICAL CONSIDERATIONS ON FLOYD-HOARE LOGIC , 1976, FOCS 1976.

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

[43]  Colette Rolland,et al.  Tools For Information System Dynamics Management , 1979, Fifth International Conference on Very Large Data Bases, 1979..

[44]  Amílcar Sernadas,et al.  A Temporal Logic Framework for a Layered Approach to Systems Specification and Verification , 1987, Temporal Aspects in Information Systems.

[45]  Wolfgang Reisig.  Concurrency is more fundamental than interleaving , 1988, Bull. EATCS.

[46]  Vaughan R. Pratt,et al.  Modeling concurrency with partial orders , 1986, International Journal of Parallel Programming.

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

[48]  Hirokazu Nishimura.  Descriptively complete process logic , 2004, Acta Informatica.

[49]  Yde Venema,et al.  Expressiveness and Completeness of an Interval Tense Logic , 1990, Notre Dame J. Formal Log..

[50]  Udo W. Lipeck,et al.  Transformation of Dynamic Integrity Constraints into Transaction Specifications , 1990, Theor. Comput. Sci..

[51]  Forouzan Golshani,et al.  A Modal System of Algebras for Database Specification and Query/Update Language Support , 1983, VLDB.

[52]  Storrs McCall.  The strong future tense , 1979, Notre Dame J. Formal Log..

[53]  Martin Gogolla,et al.  Specifying Admissibility of Dynamic Database Behaviour Using Temporal Logic , 1985, TFAIS.

[54]  Glynn Winskel,et al.  Petri Nets, Event Structures and Domains , 1979, Semantics of Concurrent Computation.

[55]  Glynn Winskel,et al.  Petri Nets, Event Structures and Domains, Part I , 1981, Theor. Comput. Sci..

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

[57]  Dov M. Gabbay,et al.  Tense systems with discrete moments of time, part I , 1972, J. Philos. Log..

[58]  Amir Pnueli.  The Temporal Semantics of Concurrent Programs , 1981, Theor. Comput. Sci..

[59]  David Harel,et al.  Process Logic: Expressiveness, Decidability, Completeness , 1980, FOCS.

[60]  Antonio L. Furtado,et al.  On the Description of Database Transition Constraints Using Temporal Languages , 1982, Advances in Data Base Theory.

[61]  Amílcar Sernadas,et al.  Temporal aspects of logical procedure definiton , 1980, Inf. Syst..