Skip to main content
SpringerLink
Log in
Book cover

International Colloquium on Automata, Languages, and Programming

ICALP 1983: Automata, Languages and Programming pp 695–711Cite as

Synchronisation trees

  • Conference paper
  • First Online:

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

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

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Arbib, M.A.,and Manes,E.G., Arrows, Structures and Functors, The catcgorical imperative. Academic Press (1975).

    Google Scholar 

  2. Brookes, S.D., On the relationship of CCS and CSP, ICALP 1983.

    Google Scholar 

  3. Hoare, C.A.R., A Model for Communicating Sequential Processes. Report of the Programming Research Group, Oxford University (1978).

    Google Scholar 

  4. Hoare, C.A.R., Brookes, S.D., and Roscoe, A.W., A Theory of Communicating Processes, Technical Report PRG-16, Programming Research Group, University of Oxford (1981); to appear also in JACM.

    Google Scholar 

  5. Hennessy, M.C.B. and Milner, R., On observing nondeterminism and concurrency, Springer LNCS Vol. 85. (1979).

    Google Scholar 

  6. Hennessy, M.C.B., and de Nicola, R., Testing Equivalences for Processes, Internal Report, University of Edinburgh, (July 1982).

    Google Scholar 

  7. Hennessy, M.C.B. and Plotkin, G., A term model for CCS, Proceedings of the 9th Conference on Mathematical Foundations of Computer Science, Springer-Verlag LNCS Vol. 88. (1980)

    Google Scholar 

  8. Maclane, S., Categories for the Working Mathematician. Graduate Texts in Mathematics,Springer-Verlag (1972).

    Google Scholar 

  9. Milne, G., Synchronised Behaviour Algebras; a model for interacting systems. Report of Comp. Sc. Dept., University of Southern California (1979).

    Google Scholar 

  10. Milner, R., A Calculus of Communicating Systems. Springer-Verlag Lecture Notes in Comp. Sc. vol. 92 (1980).

    Google Scholar 

  11. Milner, R., Calculi for Synchrony and Asynchrony, Dept. of Comp. Sci. report, University of Edinburgh (1982).

    Google Scholar 

  12. Nielsen, M., Plotkin, G., Winskel, G., Petri nets, Event structures and Domains, part 1. Theoretical Computer Science, vol. 13 (1981) pp.85–108.

    Google Scholar 

  13. Scott, D., Domains for Denotational Semantics, Springer-Verlag Lecture Notes in Comp. Sc. 140 (1982).

    Google Scholar 

  14. Winskel, G., Events in Computation. Ph.D. thesis, University of Edinburgh (1980).

    Google Scholar 

  15. Winskel, G., Event structure semantics of CCS and related languages, Springer-Verlag Lecture Notes in Comp. Sc. 140 (1982).

    Google Scholar 

  16. Winskel, G., Event structure semantics of CCS and related languages, Report of the Computer Sc. Dept., University of Aarhus, Denmark (1982).

    Google Scholar 

  17. Winskel, G., A new definition of morphism on Petri nets. Submitted to FCT 1983.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Computer Science, Carnegie-Mellon University, 15213, Pittsburgh, Pennsylvania

    Glynn Winskel

Authors
  1. Glynn Winskel
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Josep Diaz

Rights and permissions

Reprints and permissions

Copyright information

© 1983 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Winskel, G. (1983). Synchronisation trees. In: Diaz, J. (eds) Automata, Languages and Programming. ICALP 1983. Lecture Notes in Computer Science, vol 154. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0036949

Download citation

  • DOI: https://doi.org/10.1007/BFb0036949

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-12317-0

  • Online ISBN: 978-3-540-40038-7

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation