Process algebra with asynchronous communication mechanisms

  • J. A. Bergstra
  • J. W. Klop
  • J. V. Tucker
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 197)


Axiom System Process Algebra External View Concurrent Process Asynchronous Communication 
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. [1]
    ADJ (GOGUEN, J.A., THATCHER, J.W., WAGNER, G.E. & J.B. WRIGHT), Initial algebra semantics and continuous algebras, JACM Vol. 24, Nr. 1, p.68–95 (1975).Google Scholar
  2. [2]
    AUSTRY, D. & G. BOUDOL, Algèbre de processus et synchronisation, Theoretical Computer Science 30 (1984), p.91–131.Google Scholar
  3. [3]
    DE BAKKER, J.W. & J.I. ZUCKER, Denotational semantics of concurrency, Proc. 14th ACM Symp. on Theory of Computing, p.153–158, 1982.Google Scholar
  4. [4]
    DE BAKKER, J.A. & J.I. ZUCKER, Processes and the denotational semantics of concurrency, Information and Control, Vol. 54, No. 1/2, p.70–120, 1982.Google Scholar
  5. [5]
    BERGSTRA, J. A., HEERING, J., KLINT, P., & J.W. KLOP, Een analyse van de case-study HμP, mimeographed notes, Centrum voor Wiskunde en Informatica, Amsterdam 1984.Google Scholar
  6. [6]
    BERGSTRA, J.A. & J.W. KLOP, A process algebra for the operational semantics of static data flow networks, Report IW 222/83, Mathematisch Centrum, Amsterdam 1983.Google Scholar
  7. [7]
    BERGSTRA, J.A. & J.W. KLOP, Process algebra for communication and mutual exclusion. Revised version, Report CS-R8409, Centrum voor Wiskunde en Informatica, Amsterdam 1984.Google Scholar
  8. [8]
    BERGSTRA, J.A., KLOP, J.W. & J.V. TUCKER, Algebraic tools for system construction, in: Logics of Programs, Proceedings 1983 (eds. E. Clarke and D. Kozen), Springer LNCS 164, 1984.Google Scholar
  9. [9]
    BRANQUART, P., LOUIS, G. & P. WODON, An analytical description of CHILL, the CCITT High Level Language, Springer LNCS 128, 1982.Google Scholar
  10. [10]
    BROCK, J.D. & W.B. ACKERMAN, Scenarios: A model of non-determinate computation, in: Proc. Formalization of Programming Concepts (eds. J. Diaz and I. Ramos), p.252–259, Springer LNCS 107, 1981.Google Scholar
  11. [11]
    BROOKES, S.D., On the relationship of CCS and CSP, Proc. 10th ICALP, Barcelona 1983 (ed. J. Diaz), Springer LNCS 154, p.83–96, 1983.Google Scholar
  12. [12]
    BROOKES, S.D. & W.C. ROUNDS, Behavioural equivalence relations induced by programming logics, Proc. 10th ICALP, Barcelona 1983, Springer LNCS 154 (ed. J. Diaz), p.97–108, 1983.Google Scholar
  13. [13]
    EBERGEN, J., On VLSI design, NGI-SION Proceedings 1984, p.144–150, Nederlands Genootschap voor Informatica, Amsterdam 1984.Google Scholar
  14. [14]
    HENNESSY, M., A term model for synchronous processes, Information and Control 51, p.58–75 (1981).Google Scholar
  15. [15]
    HOARE, C.A.R., Communicating Sequential Processes, C. ACM 21 (1978), p.666–677.Google Scholar
  16. [16]
    HOARE, C.A.R., A model for Communicating Sequential Processes in: "On the construction of programs" (eds. R.M. McKeag and A.M. McNaughton), Cambridge University Press (1980), p.229–243.Google Scholar
  17. [17]
    HOARE, C., BROOKES, S. & W. ROSCOE, A theory of communicating sequential processes, Programming Research Group, Oxford University (1981). To appear in JACM.Google Scholar
  18. [18]
    KAHN, G., The semantics of a simple language for parallel programming, in: PROC. IFIP 74, North-Holland, Amsterdam 1974.Google Scholar
  19. [19]
    KOYMANS, R., VYTOPIL, J. & W.P. DE ROEVER, Real-time programming and asynchronous message passing, in: Proc. of the Second Annual ACM Symposium on Principles of Distributed Computing, Montreal, 1983.Google Scholar
  20. [20]
    KUIPER, R. & W.R. DE ROEVER, Fairness assumptions for CSP in a temporal logic framework, TC2 Working Conference on the Formal Description of Programming Concepts, Proc., Garmisch 1982.Google Scholar
  21. [21]
    LAMPORT, L. 'sometime’ is sometimes ‘NOT never', Tutorial on the temporal logics of programs, SRI International CSL-86, 1979.Google Scholar
  22. [22]
    MILNE, G.J., CIRCAL: A calculus for circuit description, Integration, Vol. 1, No. 2 & 3, 1983, p.121–160.Google Scholar
  23. [23]
    MILNER, R., A Calculus of Communicating Systems, Springer LNCS 92, 1980.Google Scholar
  24. [24]
    MILNER, R., Calculi for synchrony and asynchrony, Theor. Comp. Sci. 25 (1983), p.267–310.Google Scholar
  25. [25]
    OBBINK, H., personal communication, April 1984.Google Scholar
  26. [26]
    PNUELI, A., The temporal logic of programs, in: Proc. 19th Ann. Symp. on Foundations of Computer Science, IEEE, p.46–57, 1977.Google Scholar
  27. [27]
    REM, M., Partially ordered computations, with applications to VLSI design, Proc. 4th Advanced Course on Foundations of Computer Science, Part 2 (eds. J.W. de Bakker and J. van Leeuwen), Mathematical Centre Tracts 159, p.1–44, Mathematisch Centrum, Amsterdam 1983.Google Scholar
  28. [28]
    DE SIMONE, R., On MEIJE and SCCS: infinite sum operators vs. non-guarded definitions, Theoretical Computer Science 30 (1984), p.133–138.Google Scholar
  29. [29]
    VAN DE SNEPSCHEUT, J.L.A., Trace Theory and VLSI Design, Ph.D. Thesis, Eindhoven University of Technology, 1983.Google Scholar
  30. [31]
    WINSKEL, G., Event structure semantics for CCS and related languages, Proc. ICALP 82, Springer LNCS 140, p.561–576, 1982.Google Scholar
  31. [32]
    WINSKEL, G., Synchronisation trees, Proc. 10th ICALP (ed. J. Diaz), Barcelona 1983, Springer LNCS 154, p.695–711.Google Scholar

Copyright information

© Springer-Verlag 1985

Authors and Affiliations

  • J. A. Bergstra
    • 1
  • J. W. Klop
    • 1
  • J. V. Tucker
    • 2
  1. 1.Centre for Mathematics and Computer ScienceAmsterdamThe Netherlands
  2. 2.Department of Computer StudiesUniversity of LeedsLeedsEngland

Personalised recommendations