research-article

Open access

Compositional verification of real-time systems with Explicit Clock Temporal Logic

Authors:

Ruurd KuiperAuthors Info & Claims

Formal Aspects of Computing, Volume 8, Issue 3

Pages 294 - 323

https://doi.org/10.1007/BF01214917

Published: 01 May 1996 Publication History

Abstract

To specify and verify real-time systems, we consider a real-time version of temporal logic called Explicit Clock Temporal Logic. Timing properties are specified by extending the classical framework of temporal logic with a special variable which explicitly refers to a global notion of time. Programs are written in an Occam-like real-time language with synchronous message passing. To show that a program satisfies a specification, we formulate a proof system which is proved to be sound and relatively complete. The proof system is compositional, which makes it possible to decompose the design of a large system into the design of subsystems. This is shown by the verification of a small part of an avionics system.

References

References

[1]

Alur, R. and Henzinger, T. A.: Real-time logics: Complexity and expressiveness. InProc. Symposium on Logic in Computer Science, pages 390–401, 1990.

[2]

Abadi, M. and Lamport, L.: Composing specifications. InStepwise Refinement of Distributed Systems, pages 1–41. J.W. de Bakker, W.-P. de Roever, and G. Rozenberg (Eds.), LNCS 430, Springer-Verlag, 1990.

[3]

Abadi, M. and Lamport, L.: Conjoining specifications. Research Report 118, Digital Equipment Corporation, Systems Research Center, 1993.

[4]

Abadi M. and Lamport L. An old-fashioned recipe for real time ACM Transactions on Programming Languages and Systems 1994 16 1543-1571

Digital Library

[5]

Baeten J. C. M. and Bergstra J. A. Real time process algebra Formal Aspects of Computing 1991 3 2 142-188

Digital Library

[6]

Bernstein, A. and Harter, Jr. P. K.: Proving real-time properties of programs with temporal logic. InProc. of the 8th Annual ACM Symposium on Operating System Principles, pages 1–11, 1981.

[7]

Barringer, H., Kuiper, R. and Pnueli, A.: Now you may compose temporal logic specifications. InProc. of the 16th Annual ACM Symposium on Theory of Computing, pages 51–63, 1984.

[8]

Zhou Chaochen, Hoare C. A. R., and Ravn A. P. A calculus of durations Information Processing Letters 1991 40 269-276

[9]

Zhou Chaochen, Hansen, M. R., Ravn, A. P. and Rischel, H.: Duration specifications for shared processors. InFormal Techniques in Real-Time and Fault-Tolerant Systems, pages 21–32. J. Vytopil (Ed.), LNCS 571, Springer-Verlag, 1992.

[10]

Zhou Chaochen and Li Xiaoshan. A mean value calculus of durations. InA Classical Mind, Essays in Honour of C.A.R. Hoare, pages 431–451. A.W. Roscoe (Ed.), Prentice Hall, 1994.

[11]

Dijkstra, E. W.:A Discipline of Programming. Prentice Hall, 1976.

[12]

Harel E. Temporal analysis of real-time systems Master's thesis 1988 Rehovot, Israel The Weizmann Institute of Science

[13]

Huizing, C., Gerth, R. and de Roever, W.-R: Full abstraction of a real-time denotational semantics for anoccam-like language. InProc. of the 14th ACM Symposium on Principles of Programming Languages, pages 223–237, 1987.

[14]

Hooman, J., Kuiper, R. and Zhou, P.: A compositional proof system for real-time systems based on explicit clock temporal logic. InProc. of the 6th International Workshop on Software Specification and Design, pages 110–117. IEEE Computer Society Press, 1991.

[15]

Harel, E., Lichtenstein, O., and Pnueli, A.: Explicit clock temporal logic. InProc. Symposium on Logic in Computer Science, pages 402–413, 1990.

[16]

Henzinger, T. A., Manna, Z. and Pnueli, A.: Timed transition systems. InReal-Time: Theory in Practice, pages 226–251. J.W. de Bakker, C. Huizing, W.-P. de Roever, and G. Rozenberg (Ed.), LNCS 600, Springer-Verlag, 1992.

[17]

Hooman, J.:Specification and Compositional Verification of Real-Time Systems. LNCS 558, Springer-Verlag, 1991.

[18]

Hooman, J. and Widom, J.: A temporal-logic based compositional proof system for real-time message passing. InParallel Architectures and Languages Europe, volume II, pages 424–441. LNCS 366, Springer-Verlag, 1989.

[19]

Jones, C. B.:Software Development A Rigorous Approach. Prentice Hall, 1980.

[20]

Jones, C. B.:Systematic Software Development using VDM. Prentice Hall, 1990.

[21]

Koymans, R.:Specifying Message Passing and Time-Critical Systems with Temporal Logic. LNCS 651, Springer-Verlag, 1992.

[22]

Koymans R., Shyamasundar R.K., de Roever W.-P, Gerth R., and Arun-Kumar S. Compositional semantics for real-time distributed computing Information and Computation 1988 79 3 210-256

Digital Library

[23]

Koymans, R, Vytopyl, J., and de Roever, W.-P.: Real-time programming and asynchronous message passing. InProc. of the 2nd ACM Symposium on Principles of Distributed Computing, pages 187–197, 1983.

[24]

Manna, Z, and Pnueli, A.: Verification of concurrent programs: a temporal proof system. InFoundations of Computer Science IV, Distributed Systems: Part 2, volume 159 ofMathematical Centre Tracts, pages 163–255, 1982.

[25]

Manna, Z. and Pnueli, A.:The Temporal Logic of Reactive and Concurrent Systems: Specification. Springer-Verlag, 1991.

[26]

Nicollin, X., Richier, J.-L., Sifakis, J. and Voiron, J.: ATP: an algebra for timed processes. InProgramming Concepts and Methods, pages 415–442. M. Broy and C.B. Jones (Eds.), 1990.

[27]

INMOS Limited.Occam2 Reference Manual, 1988.

[28]

Owicki S. and Lamport L. Proving liveness poperties of concurrent programs ACM Transactions on Programming Languages and Systems 1982 4 3 455-495

Digital Library

[29]

Ostroff, J.:Temporal Logic for Real-Time Systems. Advanced Software Development Series. Research Studies Press, 1989.

[30]

Pnueli, A. and Harel, E.: Applications of temporal logic to the specification of real-time systems. InFormal Techniques in Real-Time and Fault-Tolerant Systems, pages 84–98. M. Joseph (Ed.), LNCS 331, 1988.

[31]

Pnueli, A.: The temporal logic of programs. InProc. of the 18th Symposium on Foundations of Computer Science, pages 46–57, 1977.

[32]

Place, P., Wood, W. and Tudball, M.: Survey of formal specification techniques for reactive systems. Technical Report CMU/SEI-90-TR-5, Software Engineering Institute, Carnegie-Mellon University, 1990.

[33]

Reed, G. and Roscoe, A.: A timed model for Communicating Sequential Processes. InProc. of ICALP '86: Automata, Languages, and Programming, pages 314–323. LNCS 226, Springer-Verlag, 1986.

[34]

Ravn A., Rischel H., and Hansen K. Specifying and verifying requirements of real-time systems IEEE Transactions on Software Engineering 1993 19 1 41-55

Digital Library

[35]

Shasha, D. E., Pnueli, A. and Ewald, W.: Temporal verification of carrier-sense local area network protocols. InProc. 11th ACM Symposium on Principles of Programming Languages, pages 54–65, 1984.

Cited By

Sun MWu JLiu CYang H(2017)The Method of Test Oracle Generation Based on Event Temporal Logic2017 International Conference on Computer Technology, Electronics and Communication (ICCTEC)10.1109/ICCTEC.2017.00149(664-670)Online publication date: Dec-2017
https://doi.org/10.1109/ICCTEC.2017.00149
Dignum FKuiper R(1998)Obligations and Dense Time for Specifying DeadlinesProceedings of the Thirty-First Annual Hawaii International Conference on System Sciences-Volume 5 - Volume 510.1109/HICSS.1998.648312Online publication date: 6-Jan-1998
https://dl.acm.org/doi/10.1109/HICSS.1998.648312
Dignum FKuiper R(1998)Specifying deadlines with continuous time using deontic and temporal logicInternational Journal of Electronic Commerce10.1080/10864415.1998.115183343:2(67-85)Online publication date: 1-Dec-1998
https://dl.acm.org/doi/10.1080/10864415.1998.11518334

Index Terms

Compositional verification of real-time systems with Explicit Clock Temporal Logic

Index terms have been assigned to the content through auto-classification.

Recommendations

A Proof System for a Unified Temporal Logic
Computing and Combinatorics
Abstract
Theorem proving is a widely used approach to the verification of computer systems, and its theoretical basis is generally a proof system for formal derivation of logic formulas. In this paper, we propose a proof system for Propositional Projection ...
Compositional Verification of Multi-Agent Systems in Temporal Multi-Epistemic Logic

Compositional verification aims at managing the complexity of the verification process by exploiting compositionality of the system architecture. In this paper we explore the use of a temporal epistemic logic to formalize the process of verification of ...
Automated compositional proofs for real-time systems

We present a framework for formally proving that the composition of the behaviors of the different parts of a complex, real-time system ensures a desired global specification of the overall system. The framework is based on a simple compositional rely/...

Comments

Information & Contributors

Information

Published In

cover image Formal Aspects of Computing

Formal Aspects of Computing Volume 8, Issue 3

May 1996

132 pages

ISSN:0934-5043

EISSN:1433-299X

Issue’s Table of Contents

© BCS 1996.

Publisher

Springer-Verlag

Berlin, Heidelberg

Publication History

Published: 01 May 1996

Accepted: 15 April 1995

Received: 15 February 1993

Published in FAC Volume 8, Issue 3

Author Tags

Qualifiers

Research-article

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

3
Total Citations
View Citations
42
Total Downloads

Downloads (Last 12 months)30
Downloads (Last 6 weeks)9

Reflects downloads up to 23 Dec 2024

Other Metrics

View Author Metrics

Citations

Cited By

Sun MWu JLiu CYang H(2017)The Method of Test Oracle Generation Based on Event Temporal Logic2017 International Conference on Computer Technology, Electronics and Communication (ICCTEC)10.1109/ICCTEC.2017.00149(664-670)Online publication date: Dec-2017
https://doi.org/10.1109/ICCTEC.2017.00149
Dignum FKuiper R(1998)Obligations and Dense Time for Specifying DeadlinesProceedings of the Thirty-First Annual Hawaii International Conference on System Sciences-Volume 5 - Volume 510.1109/HICSS.1998.648312Online publication date: 6-Jan-1998
https://dl.acm.org/doi/10.1109/HICSS.1998.648312
Dignum FKuiper R(1998)Specifying deadlines with continuous time using deontic and temporal logicInternational Journal of Electronic Commerce10.1080/10864415.1998.115183343:2(67-85)Online publication date: 1-Dec-1998
https://dl.acm.org/doi/10.1080/10864415.1998.11518334

View Options

View options

PDF

View or Download as a PDF file.

eReader

View online with eReader.

Login options

Check if you have access through your login credentials or your institution to get full access on this article.

Full Access

Get this Article

Media

Figures

Other

Tables

View Issue’s Table of Contents