Distributed CCS | SpringerLink
Skip to main content
Springer Nature Link
Log in

Distributed CCS

  • Selected Presentations
  • Conference paper
  • First Online:
CONCUR '91 (CONCUR 1991)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 527))

Included in the following conference series:

Abstract

In this paper we describe a technique to extend a process language such as CCS which does not model many aspects of distributed computation to one which does. The idea is to use a concept of location which represents a virtual node. Processes at different locations can evolve independently. Furthermore, communication between processes at different locations occurs via explicit message passing. We extend CCS with locations and message passing primitives and present its operational semantics. We show that the equivalences induced by the new semantics and its properties are similar to the equivalences in CCS. We also show how the semantics of configuration and routing can be handled.

The author acknowledges support from the Danish Research Council

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. G. Berry and G. Boudol. The Chemical Abstract Machine. Technical Report 1133, INRIA-Sophia Antipolis, December 1989.

    Google Scholar 

  2. J. P. Banatre, A. Coutant, and D. Metayer. A Parallel Machine for Multiset Transformation and its Programming Style. Future Generation Computer Systems, 4:133–144, 1988.

    Google Scholar 

  3. A.D. Birrell and B.J. Nelson. Implementing Remote Procedure Calls. ACM Transactions on Computer Systems, 2(4):39–59, February 1981.

    Google Scholar 

  4. K. L. Clark and S Gregory. PARLOG:A Parallel Logic Programming Language. Technical Report 5, Imperial College, May 1983.

    Google Scholar 

  5. I. Castellani and M. Hennessy. Distributed Bisimulations. Journal of the Association for Computing Machinery, 36(4):887–911, October 1989.

    Google Scholar 

  6. K. M. Chandy and J. Misra. Parallelsim and Programming: A Perspective. In Foundations of Software Technology and Theoretical Computer Science, LNCS 287, pages 173–194. Springer Verlag, 1987.

    Google Scholar 

  7. P. Degano, R. DeNicola, and U. Montanari. A Distributed Operational Semantics for CCS Based on Condition/Event Systems. Acta Informatica, 26:59–91, 1988.

    Google Scholar 

  8. R. DeNicola and M. C. B. Hennessy. Testing Equivalences for Processes. Theoretical Computer Science, 34:83–133, 1984.

    Google Scholar 

  9. D. Gelernter. Generative Communication in Linda. ACM Transactions on Programming Language and Systems, 7(1):80–112, Jan 1985.

    Google Scholar 

  10. P. Hudak. Parafunctional Programming. IEEE Computer, 19(8):60–71, 1986.

    Google Scholar 

  11. INMOS Ltd. occam-2 Reference Manual. Prentice Hall, 1988.

    Google Scholar 

  12. A. Kiehn, M. Hennessy, I. Castellani, and G. Boudol. Observing Localities. In Workshop on Concurrency and Compositionality: Goslar, 1991.

    Google Scholar 

  13. B. Liskov and L. Shrira. Promises: Linguistic Support for Efficient Asynchronous Procedure Calls in Distributed Systems. SIGPLAN Conference on Programming Language Design and Implementation, pages 260–267, 1988.

    Google Scholar 

  14. S. T. March, editor. ACM Computing Surveys, volume 21,3. ACM, 1989.

    Google Scholar 

  15. R. Milner. A Calculus of Communicating Systems. Lecture Notes on Computer Science Vol. 92. Springer Verlag, 1980.

    Google Scholar 

  16. D. Park. Concurrency and Automata on Infinite Sequences. In Proceedings of the 5th GI Conference, LNCS-104. Springer Verlag, 1981.

    Google Scholar 

  17. G. D. Plotkin. A Structural Approach to Operational Semantics. Technical Report DAIMI FN-19, Computer Science Department, Aarhus University, 1981.

    Google Scholar 

  18. R. Russell. The CRAY-1 Computer System. CACM, January 1978.

    Google Scholar 

  19. P. Treleaven, D. Brownbridge, and R. Hopkins. Data Driven and Demand Driven Computer Architectures. ACM Computing Surveys, 14(1), 1982.

    Google Scholar 

  20. R. J. van Glabbeek and F. W. Vaandrager. Petri Net Models for Algebraic Theories of Concurrency. In J. W. deBakker, A. J. Nijman, and P. C. Treleaven, editors, PARLE-II, LNCS 259. Springer Verlag, 1987.

    Google Scholar 

Download references

Author information

Author notes

  1. Padmanabhan Krishnan

    Present address: Department of Computer Science, Aarhus University, Ny Munkegade Building 540, DK 8000, Aarhus C, Denmark

Authors and Affiliations

    Authors
    1. Padmanabhan Krishnan
      View author publications

      You can also search for this author in PubMed Google Scholar

    Editor information

    Jos C. M. Baeten Jan Frisco Groote

    Rights and permissions

    Reprints and permissions

    Copyright information

    © 1991 Springer-Verlag Berlin Heidelberg

    About this paper

    Cite this paper

    Krishnan, P. (1991). Distributed CCS. In: Baeten, J.C.M., Groote, J.F. (eds) CONCUR '91. CONCUR 1991. Lecture Notes in Computer Science, vol 527. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-54430-5_102

    Download citation

    • DOI: https://doi.org/10.1007/3-540-54430-5_102

    • Published:

    • Publisher Name: Springer, Berlin, Heidelberg

    • Print ISBN: 978-3-540-54430-2

    • Online ISBN: 978-3-540-38357-4

    • eBook Packages: Springer Book Archive

    Publish with us

    Policies and ethics

    Search

    Navigation