Skip to main content

Rigorous specification of real-time systems

  • Conference paper
  • 117 Accesses

Part of the book series: Workshops in Computing ((WORKSHOPS COMP.))

Abstract

This paper provides an introduction to the use of timed CSP in reasoning about real-time systems. The language of timed CSP and the denotational timed failures model are reviewed, and the underlying theory is discussed. The algebraic style of specification is discussed, followed by the behavioural requirement specification approach. A simple timed buffer example is treated using both methods.

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

Buying options

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

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. R. Alur, C. Courcoubetis, and D. Dill, Model-checking in dense real-time, Information and Computation (1993).

    Google Scholar 

  2. R. Alur and D. Dill, The theory of timed automata, LNCS 600 (1991).

    Google Scholar 

  3. J.C.M Baeten and J.A. Bergstra, Real-time process algebra, Formal As-pec ts of Computing (1991).

    Google Scholar 

  4. T. Bolognesi and F. Lucidi, Timed process algebras with urgent interactions and a unique powerful binary operator, LNCS 600 (1991).

    Google Scholar 

  5. Liang Chen, Timed processes: models, axioms and decidability, PhD thesis, University of Edinburgh (1992).

    Google Scholar 

  6. J.E. Coolahan and N. Roussopoulos, A timed Petri net methodology for specifying real-time system timing constraints, in Proceedings, International Workshop on Timed Petri Nets, Torino, Italy, 1985.

    Google Scholar 

  7. J.W. Davies and S.A. Schneider, Factorising proofs in Timed CSP, LNCS 442 (1990).

    Google Scholar 

  8. J.W. Davies and S.A. Schneider, Recursion induction for real-time processes, Formal Aspects of Computing to appear (1993).

    Google Scholar 

  9. J.W. Davies, Specification and proof in real-time CSP, Cambridge University Press (1993).

    Google Scholar 

  10. M. Hennessy and A.J.R.G. Milner, Algebraic laws for nondeterminism and concurrency, Journal of ACM (1985).

    Google Scholar 

  11. M. Hennessy, An algebraic theory of processes, M.I.T press (1988).

    Google Scholar 

  12. M. Hennessy and T. Regan, A process algebra for timed systems, report 5/91, University of Sussex (1991).

    Google Scholar 

  13. C.A.R. Hoare, Communicating Sequential Processes, Prentice-Hall (1985).

    Google Scholar 

  14. J Hooman, Specification and compositional verification of real-time systems, PhD thesis, Eindhoven University of Technology (1991).

    Google Scholar 

  15. R.L.C. Koymans, Specifying message passing and time-critical systems with temporal logic, PhD thesis, Eindhoven University of Technology (1989).

    Google Scholar 

  16. N. Lynch and F. Vaandrager, Forward and backward simulations for timing-based systems, LNCS 600 (1991).

    Google Scholar 

  17. F. Moller and C. Tofts, A temporal calculus of communicating systems, LNCS 458 (1990).

    Google Scholar 

  18. M.W. Mislove, A.W. Roscoe, and S.A. Schneider, Fixed points without completeness, submitted for publication (1992).

    Google Scholar 

  19. X. Nicollin, X and J. Sifakis, The algebra of timed processes ATP: theory and application, RT-C26, Projet SPECTRE, Laboratoire de Génie Informatique de Grenoble (1990).

    Google Scholar 

  20. J. Quemada and A. Fernandez, Introduction of quantitative relative time into LOTOS, in Protocol Specification, Testing and VerificationVIT North Holland (1987).

    Google Scholar 

  21. G.M. Reed, A Uniform Mathematical Theory for Real-Time Distributed Computing, Oxford University DPhil thesis (1988).

    Google Scholar 

  22. G. M. Reed and A. W. Roscoe, A Timed Model for Communicating Sequential Processes, Theoretical Computer Science (1988).

    Google Scholar 

  23. S.A. Schneider, Unbounded nondeterminism for real-time processes, Oxford University Technical Report 13–92 (1992).

    Google Scholar 

  24. S.A. Schneider, An operational semantics for timed CSP, Information and Computation, to appear.

    Google Scholar 

  25. W.A. Sutherland, Introduction to metric and topological spaces, Oxford University Press (1975).

    Google Scholar 

  26. Wang Yi, A calculus of real time systems, Ph.D. Thesis, Chalmers University of Technology, Sweden (1991).

    Google Scholar 

  27. Zhou Chaochen, C.A.R. Hoare, and A.P. Ravn, A calculus of durations, in Information Processing Letters40, 5 (1991).

    MathSciNet  Google Scholar 

  28. J.J. Zic, A comparison of two real-time description techniques, University of New South Wales, SCS&E Report 9308 (1993).

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 1994 British Computer Society

About this paper

Cite this paper

Schneider, S. (1994). Rigorous specification of real-time systems. In: Nivat, M., Rattray, C., Rus, T., Scollo, G. (eds) Algebraic Methodology and Software Technology (AMAST’93). Workshops in Computing. Springer, London. https://doi.org/10.1007/978-1-4471-3227-1_6

Download citation

  • DOI: https://doi.org/10.1007/978-1-4471-3227-1_6

  • Publisher Name: Springer, London

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

  • Online ISBN: 978-1-4471-3227-1

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics