Unifying proof methodologies of duration calculus and timed linear temporal logic

Abstract.Linear temporal logic (LTL) has been widely used for specification and verification of reactive systems. Its standard model is sequences of states (or state transitions), and formulas describe sequencing of state transitions. When LTL is used to model real-time systems, a state is extended with a time stamp to record when a state transition takes place. Duration calculus (DC) is another well studied approach for real-time systems development. DC models behaviours of a system by functions from the domain of reals representing time to the system states. This paper extends this time domain to the Cartesian product of the real and the natural numbers. With the extended time domain, we provide the chop modality with a non-overlapping interpretation. This allows some linear temporal operators explicitly dealing with the discrete dimension of time to be derivable from the chop modality in essentially the same way that their continuous-time counterparts are in the classical DC. This provides a nice embedding of some timed LTL (TLTL) modalities into DC to unify the methods from DC and LTL for real-time systems development: Requirements and high level design decisions are interval properties and are therefore specified and reasoned about in DC, while properties of an implementation, as well as the refinement relation between two implementations, are specified and verified compositionally and inductively in LTL. Implementation properties are related to requirement and design properties by rules for lifting LTL formulas to DC formulas.

[1]  Martín Abadi,et al.  An old-fashioned recipe for real time , 1991, TOPL.

[2]  Michael R. Hansen,et al.  Duration calculus: Logical foundations , 1997, Formal Aspects of Computing.

[3]  Mathai Joseph,et al.  Real-time systems - specification, verification and analysis , 1995, Prentice Hall International series in computer science.

[4]  Qiwen Xu,et al.  Semantics and Verifikation of Extended Phase Transition Systems in Duration Calculus , 1997, HART.

[5]  Thomas A. Henzinger,et al.  Temporal Proof Methodologies for Timed Transition Systems , 1994, Inf. Comput..

[6]  Robert M. Keller,et al.  Formal verification of parallel programs , 1976, CACM.

[7]  Martín Abadi,et al.  The Existence of Refinement Mappings , 1988, LICS.

[8]  Leslie Lamport,et al.  Proving the Correctness of Multiprocess Programs , 1977, IEEE Transactions on Software Engineering.

[9]  Michael R. Hansen,et al.  Chopping a point , 1996 .

[10]  Anders P. Ravn,et al.  Engineering of Real-Time Systems with an Experiment in Hybrid Control , 1996, European Educational Forum: School on Embedded Systems.

[11]  Martín Abadi,et al.  The existence of refinement mappings , 1988, [1988] Proceedings. Third Annual Information Symposium on Logic in Computer Science.

[12]  Zhi-Ming Liu,et al.  Compositional Inductive Verification of Duration Properties of Real-Time Systems , 1997 .

[13]  Anders P. Ravn,et al.  Design of embedded real-time computing systems , 1994 .

[14]  Zohar Manna,et al.  The Temporal Logic of Reactive and Concurrent Systems , 1991, Springer New York.

[15]  J. Davenport Editor , 1960 .

[16]  Michael R. Hansen,et al.  An Adequate First Order Interval Logic , 1997, COMPOS.

[17]  Leslie Lamport,et al.  The temporal logic of actions , 1994, TOPL.

[18]  Anders P. Ravn,et al.  Verifying duration properties of timed transition systems , 1998, PROCOMET.

[19]  Martín Abadi,et al.  An old-fashioned recipe for real time , 1994, TOPL.

[20]  C. A. R. Hoare,et al.  A Calculus of Durations , 1991, Inf. Process. Lett..

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

[22]  Anders P. Ravn,et al.  Specifying and Verifying Requirements of Real-Time Systems , 1993, IEEE Trans. Software Eng..

[23]  Leslie Lamport,et al.  Hybrid Systems in TLA+ , 1992, Hybrid Systems.

[24]  Robert S. Boyer,et al.  The Correctness Problem in Computer Science , 1982 .

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

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

[27]  Thomas A. Henzinger,et al.  Real-Time Logics: Complexity and Expressiveness , 1993, Inf. Comput..