Skip to main content
SpringerLink
Log in

A fully abstract model of fair asynchrony

extended abstract

  • Conference paper
  • First Online:
Seminar on Concurrency (CONCURRENCY 1984)

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

Included in the following conference series:

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. Hennessy M, de Nicola R, Testing equivalences for Processes. Proc. ICALP 83, LNCS 154 — 1983-

    Google Scholar 

  2. Hennessy M, Modelling Finite Delay Operators Report CSR 153–83, University of Edinburgh — 1983-

    Google Scholar 

  3. Milner R, A calculus of Communicating Systems. LNCS 92 — 1980-

    Google Scholar 

  4. Milner R, Fully Abstract Models of Typed Lambda — Calculi TCS 4, 1 (pp. 1–23) — 1977-

    Google Scholar 

  5. Park D, On the Semantics of fair parallelism In abstract Software Specifications, LNCS 86 — 1980-

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Campus de Beaulieu, IRISA, F 35042, Rennes Cedex, France

    Philippe Darondeau

Authors
  1. Philippe Darondeau
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Stephen D. Brookes Andrew William Roscoe Glynn Winskel

Rights and permissions

Reprints and permissions

Copyright information

© 1985 Springer-Verlag

About this paper

Cite this paper

Darondeau, P. (1985). A fully abstract model of fair asynchrony. In: Brookes, S.D., Roscoe, A.W., Winskel, G. (eds) Seminar on Concurrency. CONCURRENCY 1984. Lecture Notes in Computer Science, vol 197. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-15670-4_21

Download citation

  • DOI: https://doi.org/10.1007/3-540-15670-4_21

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-15670-3

  • Online ISBN: 978-3-540-39593-5

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation