Real-Time and the Mu-Calculus (Preliminary Report)

We argue that the Mu-Calculus provides a conceptually advantageous framework for specifying and reasoning about Real-Time Systems. We show that mechanical reasoning can be done efficiently in a quantitative formulation of the Mu-Calculus. Our work also suggests a new complexity theory for reactive systems.

[1]  Edsger W. Dijkstra,et al.  A Discipline of Programming , 1976 .

[2]  John P. Burgess,et al.  Basic Tense Logic , 1984 .

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

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

[5]  Harry R. Lewis,et al.  A logic of concrete time intervals , 1990, [1990] Proceedings. Fifth Annual IEEE Symposium on Logic in Computer Science.

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

[7]  Thomas A. Henzinger,et al.  The temporal specification and verification of real-time systems , 1991 .

[8]  Dexter Kozen,et al.  Results on the Propositional µ-Calculus , 1982, ICALP.

[9]  Victor Yodaiken,et al.  Specifying and verifying a real-time priority queue with modal algebra , 1990, [1990] Proceedings 11th Real-Time Systems Symposium.

[10]  Jozef Hooman,et al.  Specification and Compositional Verification of Real-Time Systems , 1991, Lecture Notes in Computer Science.

[11]  R. Alur.  Techniques for automatic verification of real-time systems , 1991 .

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

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

[14]  Farnam Jahanian,et al.  A Method for Verifying Properties of Modechart Specifications , 1988, RTSS.

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

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

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

[18]  Michael C. Browne,et al.  An Improved Algorithm for the Automatic Verification of Finite State Systems Using Temporal Logic , 1986, LICS.

[19]  A. Prasad Sistla,et al.  The complexity of propositional linear temporal logics , 1982, STOC '82.

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

[21]  Orna Grumberg,et al.  Research on Automatic Verification of Finite-State Concurrent Systems , 1987 .

[22]  Andy Boucher,et al.  A Timed Failures Model for Extended Communicating Processes , 1987, ICALP.

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

[24]  Karl R. Abrahamson.  Decidability and expressiveness of logics of processes , 1980 .

[25]  C. Rattray,et al.  Specification and Verification of Concurrent Systems , 1990, Workshops in Computing.

[26]  A. Prasad Sistla,et al.  Automatic verification of finite state concurrent system using temporal logic specifications: a practical approach , 1983, POPL '83.

[27]  A. Prasad Sistla,et al.  Quantitative Temporal Reasoning , 1990, CAV.

[28]  Ron Koymans,et al.  Specifying Message Passing and Time-Critical Systems with Temporal Logic , 1992, Lecture Notes in Computer Science.

[29]  E. Allen Emerson,et al.  An Automata Theoretic Decision Procedure for the Propositional Mu-Calculus , 1989, Inf. Comput..

[30]  Amir Pnueli,et al.  Checking that finite state concurrent programs satisfy their linear specification , 1985, POPL.

[31]  Rance Cleaveland,et al.  A linear-time model-checking algorithm for the alternation-free modal mu-calculus , 1993, Formal Methods Syst. Des..

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

[33]  Willem P. de Roever,et al.  Recursive program schemes: semantics and proof theory , 1976, Mathematical Centre Tracts.

[34]  Chin-Laung Lei,et al.  Modalities for Model Checking: Branching Time Logic Strikes Back , 1987, Sci. Comput. Program..

[35]  E. A Emerson,et al.  Using Branching Time Logic to Synthesize Synchronization Skeletons , 1982 .

[36]  Joseph Sifakis,et al.  Specification and verification of concurrent systems in CESAR , 1982, Symposium on Programming.

[37]  Rajeev Alur,et al.  Model-checking for real-time systems , 1990, [1990] Proceedings. Fifth Annual IEEE Symposium on Logic in Computer Science.

[38]  E. Allen Emerson,et al.  Temporal and Modal Logic , 1991, Handbook of Theoretical Computer Science, Volume B: Formal Models and Sematics.

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

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

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

[42]  Amir Pnueli,et al.  Applications of Temporal Logic to the Specification of Real-time Systems , 1988, FTRTFT.

[43]  Amir Pnueli,et al.  On the synthesis of a reactive module , 1989, POPL '89.

[44]  Fred Krögr.  Temporal Logic Of Programs , 1987 .

[45]  Paul Crubillé,et al.  A Linear Algorithm to Solve Fixed-Point Equations on Transition Systems , 1988, Inf. Process. Lett..

[46]  J. W. de Bakker,et al.  Mathematical theory of program correctness , 1980, Prentice-Hall international series in computer science.