Skip to main content

Dimensions of the Time Modeling Problem

  • Chapter
  • First Online:
Modeling Time in Computing

Abstract

In this chapter, we present the dimensions of the time modeling problem. Despite its intuitive evidence, the mathematical modeling of time has produced highly diversified approaches and notations. The dimensions presented in this chapter will guide their presentation and comparison throughout the following chapters. A first basic dimension is whether the domain adopted to describe time is discrete or dense. A second dimension distinguishes whether the time domain is only ordered or is provided with a metric. A third dimension separates linear time domains from branching ones. Then, we distinguish between deterministic, nondeterministic, and probabilistic system models; we discuss the problem of formalizing time progress; we introduce the issue of modular composition and its impact on timing analysis.

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

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info
Hardcover Book
USD 54.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

Notes

  1. 1.

    A property is decidable if there exists an algorithmic procedure that can determine, in finite time, whether the property holds in any given system model; otherwise, it is undecidable. Chapter 6 introduces the notion with more precision for readers unfamiliar with the theory of computability.

  2. 2.

    The following three sentences refer to some real historical facts mentioned in Alessandro Manzoni’s The Betrothed; the dates and figures are plausible but not necessarily accurate.

  3. 3.

    This quotation is usually attributed to Abraham Lincoln, but this is allegedly apocryphal.

  4. 4.

    Circa 490–425 B.C.

  5. 5.

    Kilkenny, 1685–Oxford, 1753.

References

  1. Alur, R., Henzinger, T.A.: Logics and models of real time: a survey. In: Real Time: Theory in Practice. Lecture Notes in Computer Science, vol. 600, pp. 74–106. Springer, Berlin/New York (1992)

    Google Scholar 

  2. Andrews, G.R.: Foundations of Multithreaded, Parallel, and Distributed Programming. Addison-Wesley, Reading (2000)

    Google Scholar 

  3. Ben-Ari, M.: Principles of Concurrent and Distributed Programming, 2nd edn. Addison-Wesley, Harlow/New York (2006)

    Google Scholar 

  4. Benedetto, J.J., Ferreira, P.J. (eds.): Modern Sampling Theory. Birkhäuser, Boston (2001)

    Google Scholar 

  5. Booch, G., Bryan, D.: Software Engineering with ADA. Addison-Wesley, Boston (1994)

    Google Scholar 

  6. Burns, A., Hayes, I.J.: A timeband framework for modelling real-time systems. Real-Time Syst. 45(1–2), 106–142 (2010)

    Google Scholar 

  7. Cocco, N., Mandrioli, D., Milanese, V.: The Ada task system and real-time applications: an implementation schema. J. Comput. Lang. 10(3/4), 189–209 (1985)

    Google Scholar 

  8. Corsetti, E., Crivelli, E., Mandrioli, D., Morzenti, A., Montanari, A., San Pietro, P., Ratto, E.: Dealing with different time scales in formal specifications. In: Proceedings of the 6th International Workshop on Software Specification and Design, pp. 92–101. IEEE, Los Alamitos (1991)

    Google Scholar 

  9. Deming, W.E.: Some Theory of Sampling. Dover, New York (2010)

    Google Scholar 

  10. Emerson, E.A.: Temporal and modal logic. In: van Leeuwen, J. (ed.) Handbook of Theoretical Computer Science, vol. B, pp. 996–1072. Elsevier, Amsterdam/New York (1990)

    Google Scholar 

  11. Emerson, E.A., Halpern, J.Y.: “Sometimes” and “not never” revisited: on branching versus linear time temporal logic. J. ACM 33(1), 151–178 (1986)

    Google Scholar 

  12. Francez, N.: Fairness. Monographs in Computer Science. Springer, New York (1986)

    Google Scholar 

  13. Furia, C.A., Rossi, M.: A theory of sampling for continuous-time metric temporal logic. ACM Trans. Comput. Log. 12(1), 1–40 (2010). Article 8

    Google Scholar 

  14. Furia, C.A., Pradella, M., Rossi, M.: Automated verification of dense-time MTL specifications via discrete-time approximation. In: Cuéllar, J., Maibaum, T., Sere, K. (eds.) Proceedings of the 15th International Symposium on Formal Methods (FM’08). Lecture Notes in Computer Science, vol. 5014, pp. 132–147. Springer, Berlin/New York (2008)

    Google Scholar 

  15. Gargantini, A., Mandrioli, D., Morzenti, A.: Dealing with zero-time transitions in axiom systems. Inf. Comput. 150(2), 119–131 (1999)

    Google Scholar 

  16. Ghezzi, C., Jazayeri, M., Mandrioli, D.: Fundamentals of Software Engineering, 2nd edn. Prentice Hall, Harlow (2002)

    Google Scholar 

  17. Kamp, J.A.W.: Tense logic and the theory of linear order. Ph.D. thesis, University of California at Los Angeles (1968)

    Google Scholar 

  18. Koymans, R.: (Real) time: a philosophical perspective. In: de Bakker, J.W., Huizing, C., de Roever, W.P., Rozenberg, G. (eds.) Proceedings of the REX Workshop: “Real-Time: Theory in Practice”. Lecture Notes in Computer Science. vol. 600, pp. 353–370. Springer, Berlin/New York (1992)

    Google Scholar 

  19. Kučera, A., Strejček, J.: The stuttering principle revisited. Acta Inform. 41(7/8), 415–434 (2005)

    Google Scholar 

  20. Lamport, L.: “Sometime” is sometimes “not never”: on the temporal logic of programs. In: Proceedings of the 7th ACM Symposium on Principles of Programming Languages (SIGPLAN-SIGACT), pp. 174–185. ACM, New York (1980)

    Google Scholar 

  21. Lamport, L.: What good is temporal logic? In: Mason, R.E.A. (ed.) Proceedings of the 9th IFIP World Congress. Information Processing, vol. 83, pp. 657–668. North-Holland, Amsterdam/New York/Oxford (1983)

    Google Scholar 

  22. Lygeros, J., Tomlin, C., Sastry, S.: Hybrid Systems: modeling, Analysis and Control. Available online https://inst.eecs.berkeley.edu/~ee291e/sp09/handouts/book.pdf (2008)

  23. Mandrioli, D., Zicari, R., Ghezzi, C., Tisato, F.: Modeling the Ada task system by Petri nets. J. Comput. Lang. 10(1), 43–61 (1985)

    Google Scholar 

  24. Peled, D., Wilke, T.: Stutter-invariant temporal properties are expressible without the next-time operator. Inf. Process. Lett. 63(5), 243–246 (1997)

    Google Scholar 

  25. Pfleeger, S.L., Atlee, J.: Software Engineering: Theory and Practice, 3rd edn. Prentice Hall, Upper Saddle River (2005)

    Google Scholar 

  26. Pnueli, A.: The temporal logic of programs. In: Proceedings of the 18th IEEE Symposium on Foundations of Computer Science (FOCS’77), pp. 46–67. IEEE, New York/Long Beach (1977)

    Google Scholar 

  27. Pressman, R.: Software Engineering: A Practitioner’s Approach, 7th edn. McGraw-Hill, Dubuque (2009)

    Google Scholar 

  28. Roman, G.C.: Formal specification of geographic data processing requirements. IEEE Trans. Knowl. Data Eng. 2(4), 370–380 (1990)

    Google Scholar 

  29. van der Schaft, A., Schumacher, H.: An Introduction to Hybrid Dynamical Systems. Lecture Notes in Control and Information Sciences, vol. 251. Springer, London/New York (2000)

    Google Scholar 

  30. Wirth, N.: Toward a discipline of real-time programming. Commun. ACM 20(8), 577–583 (1977)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Rights and permissions

Reprints and permissions

Copyright information

© 2012 Springer-Verlag Berlin Heidelberg

About this chapter

Cite this chapter

Furia, C.A., Mandrioli, D., Morzenti, A., Rossi, M. (2012). Dimensions of the Time Modeling Problem. In: Modeling Time in Computing. Monographs in Theoretical Computer Science. An EATCS Series. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-32332-4_3

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-32332-4_3

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-32331-7

  • Online ISBN: 978-3-642-32332-4

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics