A Temporal Logic for Real-Time Partial Ordering with Named Transactions

We extend Lamport's partial-ordering models[10] for real-time computing and invent to use the concept of named transactions to reference groups of related events. We then propose Transaction Partial-Ordering Logic (TPOL) as a new specification language with special syntax and high-level semantics tailored to describe the interaction among transactions in a distributed real-time system. Finally we examine TPOL satisfiability problems with different restrictions.

[1]  Cliff B. Jones,et al.  Systematic software development using VDM , 1986, Prentice Hall International Series in Computer Science.

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

[3]  Farn Wang,et al.  Distributed real-time system specification and verification in APTL , 1993, TSEM.

[4]  Aloysius K. Mok,et al.  Modechart: A Specification Language for Real-Time Systems , 1994, IEEE Trans. Software Eng..

[5]  Roger S. Pressman,et al.  Software Engineering: A Practitioner's Approach , 1982 .

[6]  Cliff B. Jones.  A pi-Calculus Semantics for an Object-Based Design Notation , 1993, CONCUR.

[7]  J. A. Robinson,et al.  A Machine-Oriented Logic Based on the Resolution Principle , 1965, JACM.

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

[9]  Aloysius K. Mok,et al.  Safety analysis of timing properties in real-time systems , 1986, IEEE Transactions on Software Engineering.

[10]  Richard C. T. Lee,et al.  Symbolic logic and mechanical theorem proving , 1973, Computer science classics.

[11]  J.A. Stankovic,et al.  Misconceptions about real-time computing: a serious problem for next-generation systems , 1988, Computer.

[12]  Robert S. Boyer,et al.  A computational logic handbook , 1979, Perspectives in computing.

[13]  J. Michael Spivey,et al.  The Z notation - a reference manual , 1992, Prentice Hall International Series in Computer Science.

[14]  Emil L. Post.  A variant of a recursively unsolvable problem , 1946 .

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

[16]  Aloysius K. Mok,et al.  A Graph-Theoretic Approach for Timing Analysis and its Implementation , 1987, IEEE Transactions on Computers.

[17]  Abraham Silberschatz,et al.  Operating System Concepts , 1983 .

[18]  Farn Wang,et al.  RTL and Refutation by Positive Cycles , 1994, FME.

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

[20]  Jeffrey D. Ullman,et al.  Introduction to Automata Theory, Languages and Computation , 1979 .

[21]  Thomas A. Henzinger,et al.  A really temporal logic , 1989, 30th Annual Symposium on Foundations of Computer Science.