Skip to main content

Abstractions from time

  • Chapter
Programming Methodology

Part of the book series: Monographs in Computer Science ((MCS))

Abstract

Mathematical models of the timed behaviour of system components form a hierarchy of timing concepts. This is demonstrated for systems that communicate via input and output streams. We distinguish non-timed streams, discrete streams with discrete and with continuous time, and dense streams with continuous time. We demonstrate how exchanges of the timing models during the system-development process are captured as classical abstraction steps.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

eBook
USD 16.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 149.00
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info
Hardcover Book
USD 109.99
Price excludes VAT (USA)
  • Durable hardcover edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Similar content being viewed by others

References

  1. R. Alur, D. Dill. A theory of timed automata. Theoretical Computer Science 126, 1994, 183–235

    Article  MathSciNet  MATH  Google Scholar 

  2. R. Alur, C. Courcoubetis, N. Halbwachs, T.A. Henzinger, P.-H. Ho, X. Nicollin, A. Olivero, J. Sifakis, S. Yovine. Algorithmic analysis of hybrid systems. Theoretical Computer Science 138, 1995, 3–34

    Article  MathSciNet  MATH  Google Scholar 

  3. J.C.M. Baeten, J.A. Bergstra. Real Time Process Algebra. Formal Aspects of Computing 3, 1991, 142–188

    Article  MATH  Google Scholar 

  4. G. Berry, G. Gonthier. The ESTEREL Synchronous Programming Language: Design, Semantics, Implementation. INRIA, Research Report 842, 1988

    Google Scholar 

  5. G. Berry. Preemption in Concurrent Systems. In: Proceedings of the FSTTCS ‘83, Lecture Notes in Computer Science 761, Springer Verlag 1993, 72–93

    Google Scholar 

  6. A. Bernstein, P.K. Harter. Proving Real Time Properties of Programs with Temporal Logic. In: Proceedings of the 8th Annual ACM Symposium on Operating Systems, 1981, 1–11

    Google Scholar 

  7. M. Broy. Applicative real time programming. In: Information Processing 83 IFIP World CongressParis 1983, North Holland 1983, 259–264

    Google Scholar 

  8. M. Broy. Functional Specification of Time Sensitive Communicating Systems. ACM Transactions on Software Engineering and Methodology 2: 1, January 1993, 1–46

    Article  Google Scholar 

  9. D. Harel. Statecharts: A Visual Formalism for Complex Systems. Science of Computer Programming 8, 1987, 231–274

    Article  MathSciNet  MATH  Google Scholar 

  10. M. Joseph. Problems, promises and performance: Some questions for real-time system specification. In: Real Time: Theory in Practice, REX workshop. Lecture Notes in Computer Science 600, 1991, 315–324

    Google Scholar 

  11. H. Kopetz. Sparse Time versus Dense Time in Distributed Real-Time Systems. In: Proceedings of the 12th International Conference on Distributed Computing Systems. IEEE Computer Society Press 1992, 460–467

    Google Scholar 

  12. L. Lamport. TIMESETS: a new method for temporal reasoning about programs. In: D. Kozen (ed.): Logics of Programs. Lecture Notes in Computer Science 131, 1981, 177–196

    Google Scholar 

  13. N. Lynch, F. Vaandrager. Action Transducers and Time Automata. Formal Aspects of Computing 8, 1996, 499–538

    Article  MATH  Google Scholar 

  14. N. Lynch, F Vaandrager. Forward and Backward Simulations, Part II: Timing-Based Systems. Information and Computation 128: 1, 1996

    Article  MathSciNet  MATH  Google Scholar 

  15. T. Melham. Higher Order Logic and Hardware Verification. Cambridge University Press. 1993

    Google Scholar 

  16. O. Müller, P. Scholz. Functional Specification of Real-Time and Hybrid Systems. In: HART’97, Proc. of the 1st Int. Workshop on Hybrid and Real-Time Systems, Lecture Notes in Computer Science 1201, 1997, 273–286

    Google Scholar 

  17. D. Park. On the Semantics of Fair Parallelism. In: D. Bjdrner (ed.): Abstract Software Specification. Lecture Notes in Computer Science 86, Springer 1980, 504–526

    Chapter  Google Scholar 

  18. D. Park. The “Fairness” Problem and Nondeterministic Computing Networks. Proc. 4th Foundations of Computer Science, Mathematical Centre Tracts 159, Mathematisch Centrum Amsterdam, (1983) 133–161

    Google Scholar 

  19. Specification and Description Language (SDL), Recommendation Z.100. Technical Report, CCITT, 1988

    Google Scholar 

  20. N. Wirth. Towards a Discipline of Real Time Programming. Communications of the ACM 20: 8, 1977, 577–583

    Article  MATH  Google Scholar 

  21. Zhou Chaochen, C.A.R. Hoare, A.P. Ravn. A Calculus of Durations. Information Processing Letters 40: 5, 1991, 269–276

    Article  MathSciNet  MATH  Google Scholar 

Download references

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2003 Springer Science+Business Media New York

About this chapter

Cite this chapter

Broy, M. (2003). Abstractions from time. In: McIver, A., Morgan, C. (eds) Programming Methodology. Monographs in Computer Science. Springer, New York, NY. https://doi.org/10.1007/978-0-387-21798-7_5

Download citation

  • DOI: https://doi.org/10.1007/978-0-387-21798-7_5

  • Publisher Name: Springer, New York, NY

  • Print ISBN: 978-1-4419-2964-8

  • Online ISBN: 978-0-387-21798-7

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics