The GCP Language and Its Implementation

  • G. Castelli
  • F. De Cindio
  • G. De Michelis
  • C. Simone
Part of the Management and Information Systems book series (MIS)


Guarded Communicating Processes is a complete language for distributed applications based on Hoare’s CSP.(1) CSP are an “ambitious attempt to find a single simple solution” to the communication and synchronization problems of concurrent processes, that is, to represent in a single frame semaphores, critical regions, monitors, queues, and so on. They are characterized by some choices:
  • synchronous communication;

  • no shared data among processes;

  • nondeterminism.


Array Process Synchronous Communication Compilation Unit Ambitious Attempt Output Command 
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.
    C. A. R. Hoare, Communicating sequential processes, Commun. ACM 21, (8), 666–677 (1978).MathSciNetzbMATHCrossRefGoogle Scholar
  2. 2.
    R. Milner, A Calculus for Communicating Systems, Lecture Notes in Computer Science 92, Springer-Verlag, New York, 1980.Google Scholar
  3. 3.
    P. Wegner, Perspectives of capital intensive software technologies, presented at Capri ‘84 Advanced Personal Computer Technology, 1984.Google Scholar
  4. 4.
    L. Shrira and N. Francez, An experimental implementation of Csp, Proceedings of the Ieee Conference, 1981.Google Scholar
  5. 5.
    T. J. Roper and C. J. Barter, A communicating sequential language and implementation, Software Pract. Exper 11, 612–623, 1981.CrossRefGoogle Scholar
  6. 6.
    F. DE Cinoio et al,A prototype of a distributed application language for a real time microcomputer based system, Proceedings of the Euromicro Conference 82, North-Holland, Amsterdam, 1982.Google Scholar
  7. 7.
    Inmos, Occam, Prentice Hall, Englewood Cliffs, New Jersey, 1984.Google Scholar
  8. 8.
    F. DE Cindio et al,Guarded communicating processes, Proceedings of the fifth Honeywell International Software Conference, Minneapolis, 1981.Google Scholar
  9. 9.
    Mos—Modular operating system, Olivetti, 1981.Google Scholar
  10. 10.
    A. J. Bernstein, Output guards and nondeterminism in communicating sequential processes, ACM TOPLAS 2, (3) 316–323, (1980).Google Scholar
  11. 11.
    G. N. Buckley and A. Silberschatz, An effective implementation for the generalized input output construct in Csp, ACM TOPLAS 5, (2) 223–235, (1983).zbMATHCrossRefGoogle Scholar
  12. 12.
    R. B. Kieburz and A. Silberschatz, Comments on communicating sequential processes, ACM TOPLAS 1, (2) 218–225, (1979).CrossRefGoogle Scholar
  13. 13.
    N. Francez, Distributed termination, ACM TOPLAS 2, (1) 42–55, (1980).zbMATHCrossRefGoogle Scholar
  14. 14.
    E. W. Dijkstra, Guarded commands, nondeterminacy and formal derivation of programs, Commun. ACM 18, (8) 653–657, (1975).MathSciNetCrossRefGoogle Scholar
  15. 15.
    Ada: The Programming Language Ada Reference Manual,Lecture Notes in Computer Science 155, Springer-Verlag, New York, 1983.Google Scholar
  16. 16.
    Pascal+ Reference Manual, Olivetti, 1981.Google Scholar
  17. 17.
    Mos System Primitives, Reference Manual, Olivetti, 1981.Google Scholar
  18. 18.
    Z8000 CPU Technical Manual, Zilog Inc.Google Scholar
  19. 19.
    G. Castelli et al,The Gcp Report: first Draft Version, I.C. Internal Report, 1984.Google Scholar

Copyright information

© Springer Science+Business Media New York 1985

Authors and Affiliations

  • G. Castelli
    • 1
  • F. De Cindio
    • 1
  • G. De Michelis
    • 1
  • C. Simone
    • 1
  1. 1.Istituto di CiberneticaUniversità di MilanoMilanoItaly

Personalised recommendations