Skip to main content

Real-Time Calculi and Expansion Theorems

Extended Abstract

  • Conference paper
NAPAW 92

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

  • 40 Accesses

Abstract

During the last few years various process calculi have been extended to include real-time in order to handle quantitative aspects of real-time systems, for instance that some critical event must not or should happen within a certain time period. A number of extensions of classical process calculi with explicit timing constraints has emerged in the last few years. We mention the calculi defined in [Wan90] and in [Che91], all being extensions of CCS [Mi189], and the ones defined in [NSY91] and [BB89]. Common to these real-time calculi is that time is represented by some dense time domain, e.g. as in this paper the non-negative reals. Other timed calculi based on discrete time include [NRSV90, DS89, HR91].

TFL is the Danish telecommunication research laboratory.

Address:Dep. of Math. and Comp. Sc., Aalborg University, Fredrik Bajers Vej 7, 9220 Aalborg, Denmark. This work has been supported by the Danish Research Council through the DART project. The first author is supported by a scholarship from Aalborg University.

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. Rajeev Alur, Costas Courcoubetis, and David Dill. Model-checking for real-time systems. In Proceedings of the Fifth IEEE Symposium on Logic in Computer Science, 1990.

    Google Scholar 

  2. Rajeev Alur and David Dill. Automata for modelling real-time systems. In Automata, Languages and Programming: Proceedings of the 17th ICALP, LNCS 443. Springer-Verlag, 1990.

    Google Scholar 

  3. J.C.M. Baeten and J.A. Bergstra. Real time process algebra. Tech-nical Report P8916, University of Amsterdam, 1989.

    Google Scholar 

  4. Liang Chen. An interleaving model for real-time systems. Technical report, LFCS, University of Edinburgh, Scotland, 1991. Preliminary version.

    Google Scholar 

  5. D.L. Dill. Timing assumptions and verification of finite-state con-current systems. Lecture Notes in Computer Science, 407, 1989.

    Google Scholar 

  6. Jim Davis and Steve Schneider. An introduction to timed CSP. Technical Report PRG-75, Oxford University Computing Laboratory, 1989.

    Google Scholar 

  7. Jens Chr. Godskesen and Kim G. Larsen. Real-time calculi and ex-pansion theorems. In Twelfth Conference on the FST and TCS, Lecture Notes in Computer Science. Springer-Verlag, December 1992. To appear.

    Google Scholar 

  8. Uno Holmer, Kim Larsen, and Yi Wang. Deciding properties of regular timed processes. In Kim G. Larsen and Arne Skou, editors, Proceedings of the Third Workshop on Computer Aided Verification„ volume 575 of Lecture Notes in Computer Science. Springer-Verlag, 1991.

    Google Scholar 

  9. Matthew Hennessy and Tim Regan. A process algebra for timed systems. Technical Report 5/91, University of Sussex, 1991.

    Google Scholar 

  10. Robin Milner. Communication and Concurrency. Series in Com-puter Science. Prentice-Hall International, 1989.

    Google Scholar 

  11. Faron Moller and Chris Tofts. A temporal calculus of communi-cating systems. In CONCUR’90, volume 458 of Lecture Notes in Computer Science. Springer-Verlag, 1990.

    Google Scholar 

  12. X. Nicollin, J.-L. Richier, Joseph Sifakis, and J. Voiron. ATP: an algebra for timed processes. In Proceedings of the IFIP TC 2 Working Conference on Programming Concepts and Methods, Sea of Gallilee, Israel, April 1990.

    Google Scholar 

  13. Xavier Nicollin, Joseph Sifakis, and Sergio Yovine. From ATP to timed graphs and hybrid systems. In Real-Time: Theory in Practice, volume 600 of Lecture Notes in Computer Science. Springer-Verlag, 1991.

    Google Scholar 

  14. Kârlis Cerâns. Decidability of bisimulation equivalences for pro-cesses with parallel timers. To appear in Proceedings of CAV’92, 1992.

    Google Scholar 

  15. Yi Wang. Real-time behaviour of asynchronous agents. In CONCUR ‘80, volume 458 of Lecture Notes in Computer Science. Springer-Verlag, 1990.

    Google Scholar 

  16. Yi Wang. A Calculus of Real Time Systems. PhD thesis, Chalmers University of Technology, GSteborg, Sweden, 1991.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 1993 British Computer Society

About this paper

Cite this paper

Godskesen, J.C., Larsen, K.G. (1993). Real-Time Calculi and Expansion Theorems. In: Purushothaman, S., Zwarico, A. (eds) NAPAW 92. Workshops in Computing. Springer, London. https://doi.org/10.1007/978-1-4471-3217-2_1

Download citation

  • DOI: https://doi.org/10.1007/978-1-4471-3217-2_1

  • Publisher Name: Springer, London

  • Print ISBN: 978-3-540-19822-2

  • Online ISBN: 978-1-4471-3217-2

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics