Real-time behaviour of asynchronous agents

  • Wang Yi 
Selected Presentations
Part of the Lecture Notes in Computer Science book series (LNCS, volume 458)


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.


Inference Rule Parallel Composition Atomic Action Label Transition System Weak Equivalence 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. [C82]
    Cardelli L. Real Time Agents, LNCS, 140, 1982.Google Scholar
  2. [KK88]
    Koymans R. and Kuiper R. Paradigms for Real-time Systems, LNCS, 331, 1988.Google Scholar
  3. [M80]
    Milner R. A calculus of communicating systems, LNCS 92, 1980.Google Scholar
  4. [M83]
    Milner R. Calculi for Synchrony and Asynchrony, TCS, Vol 25, 1983.Google Scholar
  5. [M86]
    Milner R. Process Constructors and Interpretations, Information Processing 86, H,J. Kugler (ed), Elsevier Science Publishers (Noth-Holland), 1986.Google Scholar
  6. [M89]
    Milner R. Communication and Concurrency, Prentice Hall International Series in Computer Science, 1988.Google Scholar
  7. [MT89]
    Moller F. and Tofte C. A Temperal Calculus of Communicating Systems, LFCS report, University of Edingburgh, December 1989.Google Scholar
  8. [RH89]
    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. [RR86]
    Reed G.M. and Roscoe A.W. A Timed Model for Communicating Sequential Processes, LNCS 226, 1986.Google Scholar
  10. [S90]
    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. [T89]
    Tofte C. Timing Concurrent Processes, LFCS report, University of Edingburgh, December 1989.Google Scholar
  12. [W90]
    Wang Y. A Calculus of Real-Time Communicating Systems (in preparation), Dept. of Computer Sciences, Chalmers University, Sweden, 1990.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1990

Authors and Affiliations

  • Wang Yi 
    • 1
  1. 1.Department of Computer SciencesChalmers University of Technology and the University of GöteborgGöteborgSweden

Personalised recommendations