The INFOLOG linear tense propositional logic of events and transactions

Abstract An extended linear tense propositional logic is presented for the specification and verification of the behavior of very dynamic information systems. The temporal evolution of a system is described with causal rules specifying trigger/reaction relationships between events. Besides the presentation of the language, semantics and axiomatization of the proposed triggering logic, a practical proof system is outlined which provides effective tools for proving both safety and liveness properties of the specified systems. Its usefulness is illustrated by proving several properties of a system using semaphores. The relationship between the event structure and the tense structure of the logic is also discussed. The proposed logic is an important fragment of the INFOLOG calculus that is being developed for information systems design.

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

[2]  Erich J. Neuhold,et al.  Towards multi-level and modular conceptual schema specifications , 1984, Inf. Syst..

[3]  Saul A. Kripke.  The Undecidability of Monadic Modal Quantification Theory , 1962 .

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

[5]  A. Pnueli.  The Temporal Semantics of Concurrent Programs , 1979, Theor. Comput. Sci..

[6]  Alan C. Shaw,et al.  Software Descriptions with Flow Expressions , 1978, IEEE Transactions on Software Engineering.

[7]  Helder Coelho,et al.  Towards knowledge-based infolog specifications A case study of information engineering , 1985, Decis. Support Syst..

[8]  R. H. Williams.  Systematics: A new approach to systems analysis , 1974 .

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

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

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

[12]  Jack C. Wileden,et al.  Behavior Modeling During Software Design , 1978, IEEE Transactions on Software Engineering.

[13]  Leslie Lamport,et al.  Time, clocks, and the ordering of events in a distributed system , 1978, CACM.

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

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

[16]  Nancy G. Leveson,et al.  BASIS: A Behavioral Approach to the Specification of Information Systems , 1983, Inf. Syst..

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

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

[19]  B. Dreben,et al.  The decision problem: Solvable classes of quantificational formulas , 1979 .

[20]  Leslie Lamport.  An Axiomatic Semantics of Concurrent Programming Languages , 1984, Logics and Models of Concurrent Systems.

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

[22]  Amir Pnueli,et al.  Now you may compose temporal logic specifications , 1984, STOC '84.

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

[24]  Marco A. Casanova,et al.  A Formal System for Reasoning about Programs Accessing a Relational Database , 1980, ACM Trans. Program. Lang. Syst..

[25]  James Lyle Peterson,et al.  Petri net theory and the modeling of systems , 1981 .

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

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