Applications of Modal Logic for the Specification of Real-Time Systems

We propose a real-time modal logic with recursion for the specification of real-time systems. All modalities of Timed Computational Tree Logic (TCTL) are definable in it. We also present a model checker, a tableau system, which allows us to test whether or not a real-time system expressed as a timed transition system has or satisfies a property given by a formula in a finite model. The tableau system is independent of the choice of time domain, allowing time to be discrete or dense.

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

[2]  Faron Moller,et al.  A Temporal Calculus of Communicating Systems , 1990, CONCUR.

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

[4]  Robin Milner,et al.  Communication and concurrency , 1989, PHI Series in computer science.

[5]  Kim G. Larsen,et al.  Proof System for Hennessy-Milner Logic with Recursion , 1988, CAAP.

[6]  Liang Chen,et al.  An Interleaving Model for Real-Time Systems , 1992, LFCS.

[7]  Robin Milner,et al.  Algebraic laws for nondeterminism and concurrency , 1985, JACM.

[8]  David Walker,et al.  Local Model Checking in the Modal mu-Calculus , 1991, Theor. Comput. Sci..

[9]  Amir Pnueli,et al.  Explicit clock temporal logic , 1990, [1990] Proceedings. Fifth Annual IEEE Symposium on Logic in Computer Science.

[10]  Colin Stirling,et al.  Modal and temporal logics , 1993, LICS 1993.

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