A set-theoretic model for real-time specification and reasoning

  • C. J. Fidge
  • I. J. Hayes
  • A. P. Martin
  • A. K. Wabenhorst
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 1422)


Timed-trace formalisms have emerged as a powerful method for specifying and reasoning about concurrent real-time systems. We present a simple variant which builds methodically on set theory, and is thus suitable for use by programmers with little formal methods experience.


Formal Method Observation Interval Concatenation Operator Free Occurrence Specific Endpoint 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    S. Atkinson and D. Scholefield. Transformational vs reactive refinement in real-time systems. Information Processing Letters, 55:201–210, 1995.CrossRefGoogle Scholar
  2. 2.
    E. J. Billington, D. Donovan, B. D. Jones, S. Oates-Williams, and A. Street. Discrete Mathematics: Logic and Structures. Longman, 1990.Google Scholar
  3. 3.
    J. G. Bollinger and N. A. Duffie. Computer Control of Machines and Processes. Addison-Wesley, 1988.Google Scholar
  4. 4.
    S. M. Brien, M. Engel, He Jifeng, A. Ravn, and H. Rischel. Z description of duration calculus. Draft, Oxford University Computing Laboratory, August 1993.Google Scholar
  5. 5.
    K. Duddy, L. Everett, C. Millerchip, B. Mahony, and I. J. Hayes. Z-based notation for the specification of timing properties. Draft, Department of Computer Science, University of Queensland, June 1995.Google Scholar
  6. 6.
    M. R. Hansen and Zhou Chaochen. Duration calculus: Logical foundations. Formal Aspects of Computing, 9(3):283–330, 1997.CrossRefGoogle Scholar
  7. 7.
    B. Mahony and I. J. Hayes. Using continuous real functions to model timed histories. In Proc. Sixth Australian Software Engineering Conference (ASWEC'91), Sydney, July 1991.Google Scholar
  8. 8.
    B. P. Mahony. The refinement calculus and data-flow processes. In Proc. Second Australasian Refinement Workshop, pages 1–28, Brisbane, September 1992.Google Scholar
  9. 9.
    B. P. Mahony and I. J. Hayes. A case-study in timed refinement: A mine pump. IEEE Transactions on Software Engineering, 18(9):817–826, September 1992.CrossRefGoogle Scholar
  10. 10.
    A. Margaris. First Order Mathematical Logic. Blaisdell, 1967.Google Scholar
  11. 11.
    C. Millerchip, B. Mahony, and I. J. Hayes. The generic problem competition: A whole system specification of the boiler system. Software Verification Research Centre, University of Queensland, June 1993.Google Scholar
  12. 12.
    B. Moszkowski. Executing Temporal Logic Programs. Cambridge University Press, 1986.Google Scholar
  13. 13.
    E.-R. Olderog, A. P. Ravn, and J. U. Skakkebök. Refining system requirements to program specifications. In C. Heitmeyer and D. Mandrioli, editors, Formal Methods for Real-Time Computing, volume 5 of Trends in Software, chapter 5, pages 107–134. Wiley, 1996.Google Scholar
  14. 14.
    A. P. Ravn. Design of Embedded Real-Time Computing Systems. PhD thesis, Department of Computer Science, Technical University of Denmark, 1995.Google Scholar
  15. 15.
    D. Scholefield, H. Zedan, and He Jifeng. A specification-oriented semantics for the refinement of real-time systems. Theoretical Computer Science, 131:219–241, 1994.CrossRefMathSciNetGoogle Scholar
  16. 16.
    J. U. Skakkebaek. A Verification Assistant for a Real-Time Logic. PhD thesis, Department of Computer Science, Technical University of Denmark, 1994.Google Scholar
  17. 17.
    J. M. Spivey. The Z Notation: A Reference Manual. Prentice Hall International, 1989.Google Scholar
  18. 18.
    G. B. Thomas, Jr. Calculus and Analytic Geometry. Addison-Wesley, 4th edition, 1968.Google Scholar
  19. 19.
    S. H. Valentine. An algebraic introduction of real numbers into Z. In H. Habrias, editor, 7th International Conference on: Putting into practice methods and tools for information system design, Z Twenty Years On — What is its Future?, Nantes, France, October 1995.Google Scholar
  20. 20.
    Zhou Chaochen. Duration calculi: An overview. In D. Bjorner, M. Broy, and I. Pottosin, editors, Formal Methods in Programming and Their Applications, volume 735 of Lecture Notes in Computer Science, pages 256–266. Springer-Verlag, 1993. Extended abstract.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1998

Authors and Affiliations

  • C. J. Fidge
    • 1
  • I. J. Hayes
    • 1
    • 2
  • A. P. Martin
    • 1
  • A. K. Wabenhorst
    • 1
  1. 1.Software Verification Research CentreThe University of QueenslandAustralia
  2. 2.Department of Computer Science and Electrical EngineeringThe University of QueenslandAustralia

Personalised recommendations