Skip to main content

Real-time behaviour of asynchronous agents

  • Selected Presentations
  • Conference paper
  • First Online:
CONCUR '90 Theories of Concurrency: Unification and Extension (CONCUR 1990)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 458))

Included in the following conference series:

Abstract

In this paper, we present a calculus for real-time communicating systems. The calculus is an extension of Milner's CCS with explicit time. In SCCS,

means that if P exists at time r, it will proceed to Q at time r + 1. The time delay is exactly one unit. We extend this idea to asynchronous agents by allowing arbitrary delays. We write

to mean that aftert units of time, P will become Q, where ε stands for idling. Based on the notion of bisimulation, two equivalence relations over agents are defined. It has been shown that the strong equivalence is a congruence and the weak one is preserved by all operators except summation and recursion [W90]. Various examples are given to illustrate the approach.

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

Access this chapter

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Cardelli L. Real Time Agents, LNCS, 140, 1982.

    Google Scholar 

  2. Koymans R. and Kuiper R. Paradigms for Real-time Systems, LNCS, 331, 1988.

    Google Scholar 

  3. Milner R. A calculus of communicating systems, LNCS 92, 1980.

    Google Scholar 

  4. Milner R. Calculi for Synchrony and Asynchrony, TCS, Vol 25, 1983.

    Google Scholar 

  5. Milner R. Process Constructors and Interpretations, Information Processing 86, H,J. Kugler (ed), Elsevier Science Publishers (Noth-Holland), 1986.

    Google Scholar 

  6. Milner R. Communication and Concurrency, Prentice Hall International Series in Computer Science, 1988.

    Google Scholar 

  7. Moller F. and Tofte C. A Temperal Calculus of Communicating Systems, LFCS report, University of Edingburgh, December 1989.

    Google Scholar 

  8. de Roever W.P. and Hooman J.J.M. Design and Verification of Real-time Distributed Computing: an Introduction to Compositional Methods, Proceeding of the 9th IFIP WG 6.1 International Symposium on Protocol Specification, Testing and Verification, 1989.

    Google Scholar 

  9. Reed G.M. and Roscoe A.W. A Timed Model for Communicating Sequential Processes, LNCS 226, 1986.

    Google Scholar 

  10. Sifakis J. et al. ATP: an Algebra for Timed Processes, Laboratoire de Genie Informatique, IMAG-Campus, B.P.53X, 38041 Grenoble Cedex, France, 1990.

    Google Scholar 

  11. Tofte C. Timing Concurrent Processes, LFCS report, University of Edingburgh, December 1989.

    Google Scholar 

  12. Wang Y. A Calculus of Real-Time Communicating Systems (in preparation), Dept. of Computer Sciences, Chalmers University, Sweden, 1990.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

J. C. M. Baeten J. W. Klop

Rights and permissions

Reprints and permissions

Copyright information

© 1990 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Wang, Y. (1990). Real-time behaviour of asynchronous agents. In: Baeten, J.C.M., Klop, J.W. (eds) CONCUR '90 Theories of Concurrency: Unification and Extension. CONCUR 1990. Lecture Notes in Computer Science, vol 458. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0039080

Download citation

  • DOI: https://doi.org/10.1007/BFb0039080

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-53048-0

  • Online ISBN: 978-3-540-46395-5

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics