Skip to main content
SpringerLink
Log in

Weak and strong fairness in CCS

  • Communications
  • Conference paper
  • First Online:
Book cover Mathematical Foundations of Computer Science 1984 (MFCS 1984)

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

This work was supported by the UK SERC.

On leave from Istituto di Matematica, Università 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 and transformations dealing with fairness'. Theoretical Computer Science pp.65–100 (1983).

    Google Scholar 

  2. G. Costa and C. Stirling. ‘A fair calculus of communicating systems'. LNCS Vol.158 pp.94–105 (and extended version, Technical Report CSR-137-83, Dept. of Computer Science, Edinburgh). (1983)

    Google Scholar 

  3. G. Costa and C. Stirling. ‘Weak and strong fairness in CCS', to appear as a technical report.

    Google Scholar 

  4. Ph. Darondeau and L. Kott. ‘On the observational semantics of fair parallelism’ LNCS Vol.154 pp.147–159 (1983).

    Google Scholar 

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

    Google Scholar 

  6. M. Hennessy. ‘Modelling finite delay operators', Technical Report CSR-153-83, Dept. of Computer Science, Edinburgh (1983).

    Google Scholar 

  7. M. Hennessy and C. Stirling. ‘The power of the future perfect in program logics', in this volume.

    Google Scholar 

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

    Google Scholar 

  9. R. Milner. ‘A Calculus of Communicating Systems'. LNCS Vol.92, (1980).

    Google Scholar 

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

    Google Scholar 

  11. S. Owicki and L. Lamport. ‘Proving liveness properties of concurrent programs'. ACM Transactions on Programming Languages and Systems pp.455–495 (1982).

    Google Scholar 

  12. D. Park. ‘On the semantics of fair parallelism'. LNCS Vol.85, pp.504–26 (1980).

    Google Scholar 

  13. D. Park. ‘A predicate transformer for weak fair iteration', in Proceedings 6th IBM Symposium on Mathematical Foundations of Computer Science, Hakone, Japan (1981).

    Google Scholar 

  14. G. Plotkin. ‘A powerdomain for countable nondeterminism', LNCS Vol.140 pp.418–28 (1982).

    Google Scholar 

  15. J. Queille and J. Sifakis. ‘Fairness and related properties in transition systems', Acta Informatica 19, pp. 195–220 (1983).

    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

M. P. Chytil V. Koubek

Rights and permissions

Reprints and permissions

Copyright information

© 1984 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Costa, G., Stirling, C. (1984). Weak and strong fairness in CCS. In: Chytil, M.P., Koubek, V. (eds) Mathematical Foundations of Computer Science 1984. MFCS 1984. Lecture Notes in Computer Science, vol 176. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0030305

Download citation

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

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

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

  • Online ISBN: 978-3-540-38929-3

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation