Skip to main content

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 4710))

  • 340 Accesses

Abstract

This paper focuses on how we can engineer systems so that they can meet their timing requirements. Four separate, but related, issues are addressed: a time band model that caters for the broad set of granularities found in a typical complex system, the delay and deadline statements that allow timing requirements to be specified, scheduling analysis that enables a set of concurrent deadlines to be verified and timing analysis that enables sequential code to be inspected to determine its worst case behaviour. These four topics together with a number of other techniques and tool described in the paper allow real-time behaviour to be delivered.

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

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.

References

  1. Allen, J.: Towards a general theory of actions and time. Artificial Intelligence 23, 123–154 (1984)

    Article  MATH  Google Scholar 

  2. Amin, M.: Toward self-healing infrastructure systems. Computer, 44–52 (August 2000)

    Google Scholar 

  3. Arnold, R., Mueller, F., Whalley, D.: Bounding worst-case instruction cache performance. In: Proceedings 15th IEEE Real Time Systems Symposium, pp. 172–181. IEEE Computer Society Press, Los Alamitos (1994)

    Google Scholar 

  4. Audsley, N.C., Burns, A., Richardson, M., Tindell, K., Wellings, A.J.: Applying new scheduling theory to static priority preemptive scheduling. Software Engineering Journal 8(5), 284–292 (1993)

    Article  Google Scholar 

  5. Audsley, N.C., Tindell, K., Burns, A.: The end of the line for static cyclic scheduling? In: Proceedings of the Fifth Euromicro Workshop on Real-Time Systems, Oulu, Finland, pp. 36–41. IEEE Computer Society Press, Los Alamitos (1993)

    Chapter  Google Scholar 

  6. Baker, T.P.: A stack-based resource allocation policy for realtime processes. In: Proceedings 11th IEEE Real-Time Systems Symposium, pp. 191–200. IEEE Computer Society Press, Los Alamitos (1990)

    Google Scholar 

  7. Baker, T.P.: Stack-based scheduling of realtime processes. Real-Time Systems 3(1) (March 1991)

    Google Scholar 

  8. Bernat, G., Colin, A., Petters, S.M.: WCET analysis of probabilistic hard real–time systems. In: Proceedings of the 23rd Real-Time Systems Symposium, pp. 279–288 (2002)

    Google Scholar 

  9. Bernat, G., Newby, M., Burns, A.: Probabilistic timing analysis, an approach using Copulas. Journal of Embbedded Computing 1(2), 179–194 (2005)

    Google Scholar 

  10. Burns, A., Baxter, G.D.: Time bands in systems structure. In: Structure for Dependability, pp. 74–90. Springer, Heidelberg (2006)

    Google Scholar 

  11. Burns, A., Hayes, I.J., Baxter, G., Fidge, C.J.: Modelling temporal behaviour in complex socio-technical systems. Computer Science Technical Report YCS 390, University of York (2005)

    Google Scholar 

  12. Burns, A., Lin, T.-M.: Adding temporal annotations and associated verification to Ravenscar profile. In: Rosen, J.-P., Strohmeier, A. (eds.) Ada-Europe 2003. LNCS, vol. 2655, pp. 80–91. Springer, Heidelberg (2003)

    Chapter  Google Scholar 

  13. Burns, A., Lin, T.-M.: An engineering process for the verification of real-time systems. Formal Aspects of Computing 19, 111–136 (2007)

    Article  MATH  Google Scholar 

  14. Burns, A., Wellings, A.J.: Real-Time Systems and Programming Languages, 3rd edn. Addison Wesley Longman, Redwood City, CA, USA (2001)

    Google Scholar 

  15. Buttazzo, G.C.: Hard Real-Time Computing Systems. Springer, Heidelberg (2005)

    MATH  Google Scholar 

  16. Ciapessoni, E., Corsetti, E., Montanari, A., San Pietro, P.: Embedding time granularity in a logical specification language for synchronous real-time systems. Science of Computer Programming 20, 141–171 (1993)

    Article  MATH  MathSciNet  Google Scholar 

  17. Colin, A., Petters, S.M.: Experimental evaluation of code properties for WCET analysis. In: Proceedings 24th IEEE Real-Time Systems Symposium, IEEE Computer Society Press, Los Alamitos (2003)

    Google Scholar 

  18. Colin, A., Petters, S.M.: Experimental evaluation of code properties for WCET analysis. In: Proceedings of the 24rd Real-Time Systems Symposium, pp. 190–199 (2003)

    Google Scholar 

  19. Conn, A.P.: Time affordances: the time factor in diagnostic usability heuristics. In: Proceedings of the SIGCHI conference on Human factors in computing systems, pp. 186–193 (1995)

    Google Scholar 

  20. Cornhill, D., Sha, L., Lehoczky, J.P., Rajkumar, R., Tokuda, H.: Limitations of Ada for real-time scheduling. In: Proceedings of the International Workshop on Real Time Ada Issues, ACM Ada Letters, pp. 33–39. ACM Press, New York (1987)

    Google Scholar 

  21. Corsetti, E., Montanari, A., Ratto, E.: Dealing with different time granularities in formal specifications of real-time systems. Journal of Real-Time Systems 3(2) (1991)

    Google Scholar 

  22. Davis, R., Burns, A.: Hierarchical fixed priority preemptive scheduling. In: IEEE Real-Time Systems Symposium, pp. 389–398. IEEE Computer Society Press, Los Alamitos (2005)

    Google Scholar 

  23. Davis, R.I., Wellings, A.J.: Dual priority scheduling. In: Proceedings 16th IEEE Real-Time Systems Symposium, pp. 100–109. IEEE Computer Society Press, Los Alamitos (1995)

    Chapter  Google Scholar 

  24. Edgar, S., Burns, A.: Statistical analysis of WCET for scheduling. In: Proceedings 22nd IEEE Real-Time Systems Symposium, IEEE Computer Society Press, Los Alamitos (2001)

    Google Scholar 

  25. Fidge, C.J., Hayes, I.J., Watson, G.: The deadline command. IEEE Software — Special Issue on Real-Time Systems 146(2), 104–111 (1999)

    Google Scholar 

  26. Finnie, G.: SPARK - the SPADE Ada kernel, Ed 3.3. Technical report, Praxis Plc (1997)

    Google Scholar 

  27. Fraisse, P.: The psychology of time. Harper and Row, New York (1963)

    Google Scholar 

  28. Friedman, W.: About time: Inventing the fourth dimension. MIT Press, Cambridge, MA (1990)

    Google Scholar 

  29. Ghosal, A., Henzinger, T.A., Iercan, D., Kirsch, C.M., Sangiovanni-Vincentelli, A.: A hierarchical coordination language for interacting real-time tasks. In: EMSOFT. Proceedings of the 6th International Embedded Software Conference (2006)

    Google Scholar 

  30. Healy, C.A., Whalley, D.B.: Integrating the timing analysis of pipelining and instruction caching. In: Proceedings Real Time Systems Symposium, pp. 288–297 (1995)

    Google Scholar 

  31. Heckmann, R., Langenbach, M., Thesing, S., Wilhelm, R.: IEEE Proceedings on Real-Time Systems, vol. 91, pp. 1038–1054 (2003)

    Google Scholar 

  32. Hollnagel, E.: Human Reliability Analysis: Context and Control. Academic Press, London (1993)

    Google Scholar 

  33. Hutchesson, S.G., Hayes, N.: Technology transfer and certification issues in safety critical real-time systems. In: Digest of the IEE Colloquium on Real-Time Systems, vol. 98/306 (April 1998)

    Google Scholar 

  34. Jones, C.B.: Reasoning about interference in an object-based design method. In: Larsen, P.G., Woodcock, J.C.P. (eds.) FME 1993. LNCS, vol. 670, pp. 1–18. Springer, Heidelberg (1993)

    Chapter  Google Scholar 

  35. Joseph, M., Pandya, P.: Finding response times in a real-time system. BCS Computer Journal 29(5), 390–395 (1986)

    Article  MathSciNet  Google Scholar 

  36. Lauer, H., Satterwaite, E.: The impact of Mesa on system design. In: Proceedings of the 4th International Conference on Software Engineering, pp. 174–182. IEEE, Los Alamitos (1979)

    Google Scholar 

  37. Lehoczky, J.P., Sha, L., Strosnider, J.K.: Enhanced aperiodic responsiveness in a hard real-time environment. In: Proceedings 8th IEEE Real-Time Systems Symposium, pp. 261–270. IEEE Computer Society Press, Los Alamitos (1987)

    Google Scholar 

  38. Leung, J.Y.T., Whitehead, J.: On the complexity of fixed-priority scheduling of periodic, real-time tasks. Performance Evaluation (Netherlands) 2(4), 237–250 (1982)

    Article  MATH  MathSciNet  Google Scholar 

  39. Levine, R.: A geography of time. Guilford Press, New York (1997)

    Google Scholar 

  40. Liu, C.L., Layland, J.W.: Scheduling algorithms for multiprogramming in a hard real-time environment. JACM 20(1), 46–61 (1973)

    Article  MATH  MathSciNet  Google Scholar 

  41. Liu, J.-C., Lee, H.-J.: Deterministic upperbounds of the worst-case execution times of caches programs. In: Proceedings Real Time Systems Symposium, pp. 182–191 (1994)

    Google Scholar 

  42. Liu, J.W.S.: Real-Time Systems. Prentice-Hall, Englewood Cliffs (2000)

    Google Scholar 

  43. Newell, A.: Unified theories of cognition. Harvard University Press, Cambridge, MA (1990)

    Google Scholar 

  44. Paul, J.M., Thomas, D.E., Cassidy, A.S.: High-level modeling and simulation of single-chip programmable heterogeneous multiprocessors. ACM Transactions on Design Automation of Electronic Systems 10(3), 431–461 (2005)

    Article  Google Scholar 

  45. Puschner, P., Koza, C.: Calculating the maximum execution time of real-time programs. The Journal of Real-Time Systems 1, 159–176 (1989)

    Article  Google Scholar 

  46. Puschner, P.P., Schedl, A.V.: Computing maximum task execution times - a graph-based approach. Real-Time Systems 13(1), 67–91 (1997)

    Article  Google Scholar 

  47. Roeckelein, J.E.: The concept of time in psychology: A resource book and annotated bibliography. Greenwood Press, CT (2000)

    Google Scholar 

  48. Sha, L., Rajkumar, R., Lehoczky, J.P.: Priority inheritance protocols: An approach to real-time synchronisation. IEEE Transactions on Computers 39(9), 1175–1185 (1990)

    Article  MathSciNet  Google Scholar 

  49. Spuri, M.: Analysis of deadline scheduled real-time systems. Technical Report RR-2772, INRIA (1996)

    Google Scholar 

  50. Tindell, K., Burns, A., Wellings, A.J.: An extendible approach for analysing fixed priority hard real-time tasks. Real-Time Systems 6(2), 133–151 (1994)

    Article  Google Scholar 

  51. Whysall, P.J.: Object Oriented Specification and Refinement. PhD thesis, Department of Computer Science, The University of York (1991)

    Google Scholar 

  52. Wilhelm, R., Engblom, J., Ermedahl, A., Holsti, N., Thesing, S., Whalley, D., Bernat, G., Ferdinand, C., Heckmann, R., Mitra, T., Mueller, F., Puant, I., Puschner, P., Staschulat, J., Stenstrom, P.: The worst case execution time problem - overview of methods and survey of tools. ACMTransactions on Embedded Systems (to appear)

    Google Scholar 

  53. Zhang, N., Burns, A., Nicholson, M.: Pipelined processors and worst case execution time. Real-Time Systems 5(4), 319–343 (1993)

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Chris W. George Zhiming Liu Jim Woodcock

Rights and permissions

Reprints and permissions

Copyright information

© 2007 Springer-Verlag Berlin Heidelberg

About this chapter

Cite this chapter

Burns, A., Wellings, A. (2007). Delivering Real-Time Behaviour. In: George, C.W., Liu, Z., Woodcock, J. (eds) Domain Modeling and the Duration Calculus. Lecture Notes in Computer Science, vol 4710. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-74964-6_1

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-74964-6_1

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-74963-9

  • Online ISBN: 978-3-540-74964-6

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics