Skip to main content
SpringerLink
Log in

A fair calculus of communicating systems

  • Conference paper
  • First Online:
Book cover Foundations of Computation Theory (FCT 1983)

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

Included in the following conference series:

Abstract

We contrast a two level operational approach to fairness with a single level approach. The latter involves presenting a set of rules which generate all and only the fair execution sequences of a concurrent language. This we do for a subset of Milner's CCS.

This work was supported by an SERC grant

On leave from Istituto di Matematica, Universita di Genova, Italy.

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. K. Apt and E. Olderog. ‘Proof rules dealing with fairness'. Bericht Nr. 8104, Inst. für Informatik und Praktische Mathematik, Kiel University (1981).

    Google Scholar 

  2. G. Costa and C. Stirling. ‘A fair calculus of communicating systems'. To appear.

    Google Scholar 

  3. G. Costa and C. Stirling. ‘Fair rules for a concurrent guarded command language'. In preparation.

    Google Scholar 

  4. D. Gabbay, A. Pnueli, S. Shelah and J. Stavi. ‘On the temporal analysis of fairness'. Proc. 7th ACM POPL, Las Vegas (1980).

    Google Scholar 

  5. M. Hennessy. ‘Axiomatising finite delay operators'. Technical Report CSR-124-82, Dept. of Computer Science, Edinburgh University (1982).

    Google Scholar 

  6. D. Lehmann, A. Pnueli and J. Stavi. ‘Impartiality, justice and fairness: the ethics of concurrent termination'. LNCS 115, pp. 264–77, Springer-Verlag (1981).

    Google Scholar 

  7. R. Milner. ‘A Calculus of Communicating Systems'. LNCS 92, Springer-Verlag (1980).

    Google Scholar 

  8. R. Milner. ‘A finite delay operator in synchronous CCS'. Technical Report CSR-116-82, Dept. of Computer Science, Edinburgh University (1982).

    Google Scholar 

  9. S. Owicki and L. Lamport. ‘Proving liveness properties of concurrent programs'. Technical Report, SRI International (1980).

    Google Scholar 

  10. D. Park. ‘On the semantics of fair parallelism'. LNCS 86, pp. 504–26, Springer-Verlag (1980).

    Google Scholar 

  11. G. Plotkin. ‘A powerdomain for countable non-determinism'. LNCS 140, pp. 418–28, Springer-Verlag (1982).

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Dept. of Computer Science, Edinburgh University, UK

    Gerardo Costa & Colin Stirling

Authors
  1. Gerardo Costa
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Colin Stirling
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Marek Karpinski

Rights and permissions

Reprints and permissions

Copyright information

© 1983 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Costa, G., Stirling, C. (1983). A fair calculus of communicating systems. In: Karpinski, M. (eds) Foundations of Computation Theory. FCT 1983. Lecture Notes in Computer Science, vol 158. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-12689-9_96

Download citation

  • DOI: https://doi.org/10.1007/3-540-12689-9_96

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-12689-8

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

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation