Skip to main content
SpringerLink
Log in

Observing localities

  • Contributions
  • Conference paper
  • First Online:
Mathematical Foundations of Computer Science 1991 (MFCS 1991)

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

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. G. Boudol and I. Castellani. On the semantics of concurrency: partial orders and transition systems. In Proceedings of TAPSOFT 87, number 249 in Lecture Notes in Computer Science, pages 123–137, 1987.

    Google Scholar 

  2. G. Boudol and I. Castellani. Permutation of transitions: an event structure semantics for CCS and SCCS. In Proceedings of Linear Time, Branching Time and Partial Order in Logics and Models for Concurrency, number 354 in Lecture Notes in Computer Science, pages 411–427, 1989.

    Google Scholar 

  3. J. Bergstra and J.W. Klop. Algebra of communicating processes with abstraction. Theoretical Computer Science, (37):77–121, 1985.

    Google Scholar 

  4. I. Castellani. Bisimulations for Concurrency. Ph.d. thesis, University of Edinburgh, 1988.

    Google Scholar 

  5. I. Castellani and M. Hennessy. Distributed bisimulations. JACM, 10(4):887–911, 1989.

    Google Scholar 

  6. P. Degano and P. Darondeau. Causal trees. In Proceedings of ICALP 88, number 372 in Lecture Notes in Computer Science, pages 234–248, 1989.

    Google Scholar 

  7. P. Degano, R. De Nicola, and U. Montanari. A distributed operational semantics for CCS based on condition/event systems. Acta Informatica, 26:59–91, 1988.

    Google Scholar 

  8. M. Hennessy. Axiomatising finite concurrent processes. SIAM Journal of Computing, 17(5):997–1017, 1988.

    Google Scholar 

  9. C.A.R. Hoare. Communicating Sequential Processes. Prentice-Hall, 1985.

    Google Scholar 

  10. A. Kiehn. Distributed bisimulations for finite CCS. Report 7/89, University of Sussex, 1989.

    Google Scholar 

  11. R. Milner. Communication and Concurrency. Prentice-Hall, 1989.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. INRIA, Sophia-Antipolis, USA

    G. Boudol & I. Castellani

  2. CSAI, University of Sussex, UK

    M. Hennessy

  3. TUM, Munich

    A. Kiehn

Authors
  1. G. Boudol
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. I. Castellani
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. M. Hennessy
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. A. Kiehn
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Andrzej Tarlecki

Rights and permissions

Reprints and permissions

Copyright information

© 1991 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Boudol, G., Castellani, I., Hennessy, M., Kiehn, A. (1991). Observing localities. In: Tarlecki, A. (eds) Mathematical Foundations of Computer Science 1991. MFCS 1991. Lecture Notes in Computer Science, vol 520. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-54345-7_52

Download citation

  • DOI: https://doi.org/10.1007/3-540-54345-7_52

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-54345-9

  • Online ISBN: 978-3-540-47579-8

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation