Advertisement

Asynchronous communication in real space process algebra

  • J. C. M. Baeten
  • J. A. Bergstra
Session 9A
Part of the Lecture Notes in Computer Science book series (LNCS, volume 571)

Abstract

A version of classical real space process algebra is given in which messages travel with constant speed through a three-dimensional medium. It follows that communication is asynchronous and has a broadcasting character. A state operator is used to describe asynchronous message transfer and a priority mechanism allows to express the broadcasting mechanism. As an application, a protocol is specified in which the receiver moves with respect to the sender.

Key words & Phrases

process algebra real time process algebra real space process algebra asynchronous communication broadcasting state operator priorities 

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. [BaB88]
    J.C.M. Baeten & J.A. Bergstra, Global renaming operators in concrete process algebra, Information & Computation 78 (3), 1988, pp. 205–245.Google Scholar
  2. [BaB91a]
    J.C.M. Baeten & J.A. Bergstra, Real time process algebra, Formal Aspects of Computing 3 (2), 1991, pp. 142–188. (Report version appeared as report P8916, Programming Research Group, University of Amsterdam 1989.)Google Scholar
  3. [BaB91b]
    J.C.M. Baeten & J.A. Bergstra, Real space process algebra, in Proc. CONCUR'91, Amsterdam (J.C.M. Baeten & J.F. Groote, eds.), Springer LNCS 527, 1991, pp. 96–110.Google Scholar
  4. [BaB91c]
    J.C.M. Baeten & J.A. Bergstra, The state operator in real time process algebra, report P9104, Programming Research Group, University of Amsterdam 1991. To appear in Proc. REX Workshop Real-Time: Theory in Practice, Mook 1991.Google Scholar
  5. [BaB91d]
    J.C.M. Baeten & J.A. Bergstra, Process algebra with signals and conditions, report CS-R9103, CWI Amsterdam 1991. To appear in Proc. NATO Summer School, Marktoberdorf 1990 (M. Broy et al., eds.), Springer Verlag.Google Scholar
  6. [BaBK86]
    J.C.M. Baeten, J.A. Bergstra & J.W. Klop, Syntax and defining equations for an interrupt mechanism in process algebra, Fund. Inf. IX (2), 1986, pp. 127–168.Google Scholar
  7. [BaW90]
    J.C.M. Baeten & W.P. Weijland, Process algebra, Cambridge Tracts in Theor. Comp. Sci. 18, Cambridge University Press 1990.Google Scholar
  8. [Be85]
    J.A. Bergstra, Put and get, primitives for synchronous unreliable message passing, report LGPS 3, Dept. of Philosophy, Utrecht University 1985.Google Scholar
  9. [Be89]
    J.A. Bergstra, A mode transfer operator in process algebra, report P8808b, Programming Research Group, University of Amsterdam 1989.Google Scholar
  10. [Be90]
    J.A. Bergstra, A process creation mechanism in process algebra, in: Applications of Process Algebra (J.C.M. Baeten, ed.), Cambridge Tracts in TCS 17, Cambridge University Press 1990, pp. 81–88.Google Scholar
  11. [BeK84]
    J.A. Bergstra & J.W. Klop, Process algebra for synchronous communication, Inf. & Control 60, 1984, pp. 109–137.Google Scholar
  12. [BeKT85]
    J.A. Bergstra, J.W. Klop & J.V. Tucker, Process algebra with asynchronous communication mechanisms, in: Proc. Seminar on Concurrency (S.D. Brookes, A.W. Roscoe & G. Winskel, eds.), Springer LNCS 197, 1985, pp. 76–95.Google Scholar
  13. [J91a]
    A. Jeffrey, A linear time process algebra, report 61, Programming Methodology Group, Chalmers University 1991, in Proc. CAV 91, Aalborg 1991.Google Scholar
  14. [J91b]
    A. Jeffrey, Observation spaces and timed processes, in Proc. CONCUR'91, Amsterdam (J.C.M. Baeten & J.F. Groote, eds.), Springer LNCS 527, 1991, pp. 332–345.Google Scholar
  15. [J91c]
    A. Jeffrey, Translating timed process algebra into prioritized process algebra, Programming Methodology Group, Chalmers University 1991.Google Scholar
  16. [K91]
    A.S. Klusener, Completeness in real time process algebra, report CS-R9106, CWI Amsterdam 1991. Extended abstract in Proc. CONCUR'91, Amsterdam (J.C.M. Baeten & J.F. Groote, eds.), Springer LNCS 527, 1991, pp. 376–392.Google Scholar
  17. [MT90]
    F. Moller & C. Tofts, A temporal calculus of communicating systems, in: Proc. CONCUR'90, Amsterdam (J.C.M. Baeten & J.W. Klop, eds.), Springer LNCS 458, 1990, pp. 401–415.Google Scholar
  18. [Mu91]
    D.V.J. Murphy, Testing, betting and timed true concurrency, in Proc. CONCUR'91, Amsterdam (J.C.M. Baeten & J.F. Groote, eds.), Springer LNCS 527, 1991, pp. 439–454.Google Scholar
  19. [RR88]
    G.M. Reed & A.W. Roscoe, A timed model for communicating sequential processes, TCS 58, 1988, pp. 249–261.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1991

Authors and Affiliations

  • J. C. M. Baeten
    • 1
    • 2
    • 4
  • J. A. Bergstra
    • 2
    • 3
  1. 1.Department of Software TechnologyCWIAB AmsterdamThe Netherlands
  2. 2.Programming Research GroupUniversity of AmsterdamDB AmsterdamThe Netherlands
  3. 3.Department of PhilosophyUtrecht UniversityCS UtrechtThe Netherlands
  4. 4.Department of Computer ScienceEindhoven University of TechnologyMB EindhovenThe Netherlands

Personalised recommendations