Skip to main content
SpringerLink
Log in

Deducing causal relationships in CCS

  • Concurreny
  • Conference paper
  • First Online:
Foundations of Software Technology and Theoretical Computer Science (FSTTCS 1989)

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

Abstract

We introduce purely parallel processes, a class of finite CCS processes defined by a restricted syntax which allows synchronization but forbids choice. Such processes are deterministic in the sense of Milner,

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.

References

  1. J. Gunawardena, “Purely Parallel Processes”, Technical Memo, Hewlett-Packard Laboratories, Information Systems Centre, HPL-ISC-TM-89-002, March 1989; submitted to Information and Computation.

    Google Scholar 

  2. J. Gunawardena, “Causal Automata I: Confluence ≡ {AND, OR} Causality”, Technical Memo, Hewlett-Packard Laboratories, Information Systems Centre, HPL-ISC-TM-89-078, July 1989.

    Google Scholar 

  3. C.A.R. Hoare, “Communicating Sequential Processes”, International Series in Computer Science, Prentice-Hall, 1985.

    Google Scholar 

  4. H.T. Kung, “Deadlock Avoidance for Systolic Communication”, Journal of Complexity, 4, pp. 87–105, 1988.

    Article  Google Scholar 

  5. A. Marshall, G. Proudler, “Cryptographic key management for a store-and-forward messaging system”, Proceedings of SECURICOM '87, 5th Worldwide Congress on Computer and Communications Security and Protection, Paris, France, 4–6th March 1987.

    Google Scholar 

  6. R. Milner, “A Calculus of Communicating Systems”, Springer Lecture Notes in Computer Science No 92, Springer-Verlag 1980.

    Google Scholar 

  7. R. Milner, “Communication and Concurrency”, International Series in Computer Science, Prentice-Hall, 1989.

    Google Scholar 

  8. J. Parrow, “Verifying a CSMA/CD-Protocol with CCS”, LFCS Report ECS-LFCS-87-18, University of Edinburgh, January 1987.

    Google Scholar 

  9. V. Pratt, “Modelling Concurrency with Partial Orders”, International Journal of Parallel Programming, 15(1), pp 33–71, 1986.

    Article  Google Scholar 

  10. F. W. Vaandrager, “Determinism → (Event structure isomorphism = Step sequence equivalence)”, Report CS-R8839, CWI Amsterdam, October 1988.

    Google Scholar 

  11. G. Winskel, “Event Structures”, in W. Brauer, W. Reisig, G. Rozenberg (eds), “Advances in Petri Nets”, SLNCS 255, Springer-Verlag.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Hewlett-Packard Laboratories, Information Systems Centre, Filton Road, Stoke Gifford, BS12 6QZ, Bristol

    Jeremy Gunawardena

Authors
  1. Jeremy Gunawardena
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

C. E. Veni Madhavan

Rights and permissions

Reprints and permissions

Copyright information

© 1989 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Gunawardena, J. (1989). Deducing causal relationships in CCS. In: Veni Madhavan, C.E. (eds) Foundations of Software Technology and Theoretical Computer Science. FSTTCS 1989. Lecture Notes in Computer Science, vol 405. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-52048-1_41

Download citation

  • DOI: https://doi.org/10.1007/3-540-52048-1_41

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

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

  • Online ISBN: 978-3-540-46872-1

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation