Skip to main content
Springer Nature Link
Log in

Asynchronous communication in real space process algebra

  • Session 9A
  • Conference paper
  • First Online:
Formal Techniques in Real-Time and Fault-Tolerant Systems (FTRTFT 1992)

Part of the book series: Lecture Notes in Computer Science ((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.

Partial support received by Esprit basic research action 3006, Concur, and by RACE contract 1046, SPECS. This document does not necessarily reflect the views of the SPECS consortium.

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

Access this chapter

Log in via an institution

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Similar content being viewed by others

References

  1. 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. 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. 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. 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. 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. 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. J.C.M. Baeten & W.P. Weijland, Process algebra, Cambridge Tracts in Theor. Comp. Sci. 18, Cambridge University Press 1990.

    Google Scholar 

  8. J.A. Bergstra, Put and get, primitives for synchronous unreliable message passing, report LGPS 3, Dept. of Philosophy, Utrecht University 1985.

    Google Scholar 

  9. J.A. Bergstra, A mode transfer operator in process algebra, report P8808b, Programming Research Group, University of Amsterdam 1989.

    Google Scholar 

  10. 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. J.A. Bergstra & J.W. Klop, Process algebra for synchronous communication, Inf. & Control 60, 1984, pp. 109–137.

    Google Scholar 

  12. 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. A. Jeffrey, A linear time process algebra, report 61, Programming Methodology Group, Chalmers University 1991, in Proc. CAV 91, Aalborg 1991.

    Google Scholar 

  14. 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. A. Jeffrey, Translating timed process algebra into prioritized process algebra, Programming Methodology Group, Chalmers University 1991.

    Google Scholar 

  16. 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. 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. 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. G.M. Reed & A.W. Roscoe, A timed model for communicating sequential processes, TCS 58, 1988, pp. 249–261.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Software Technology, CWI, P.O.Box 4079, 1009, AB Amsterdam, The Netherlands

    J. C. M. Baeten

  2. Programming Research Group, University of Amsterdam, P.O.Box 41882, 1009, DB Amsterdam, The Netherlands

    J. C. M. Baeten & J. A. Bergstra

  3. Department of Philosophy, Utrecht University, Heidelberglaan 2, 3584, CS Utrecht, The Netherlands

    J. A. Bergstra

  4. Department of Computer Science, Eindhoven University of Technology, P.O. Box 513, 5600, MB Eindhoven, The Netherlands

    J. C. M. Baeten

Authors
  1. J. C. M. Baeten
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. J. A. Bergstra
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Jan Vytopil

Rights and permissions

Reprints and permissions

Copyright information

© 1991 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Baeten, J.C.M., Bergstra, J.A. (1991). Asynchronous communication in real space process algebra. In: Vytopil, J. (eds) Formal Techniques in Real-Time and Fault-Tolerant Systems. FTRTFT 1992. Lecture Notes in Computer Science, vol 571. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-55092-5_26

Download citation

  • DOI: https://doi.org/10.1007/3-540-55092-5_26

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-55092-1

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

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation