Skip to main content
SpringerLink
Log in

About Fair Asynchrony

  • Conference paper
Logics and Models of Concurrent Systems

Part of the book series: NATO ASI Series ((NATO ASI F,volume 13))

  • 156 Accesses

Abstract

This paper studies the joint influence of fairness and asynchrony on the modelling of a CCS-like language. Programs in the language are provided with an implementation preorder which reflects their observational properties. A fully abstract model of the preorder is constructed in the framework of infinitary languages, preferred here to more classical domains. The case of bounded parallelism is analyzed: there, infinitary rational expressions may be used to specify the observationally meaningful properties of programs, and no induction is needed to prove those semantic properties.

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

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 109.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Ben-Ari M., Manna Z., Pnueli A. “The Temporal Logic of Branching Time” 8th Ann. ACM Symp. on POPL (1981)

    Google Scholar 

  2. Brookes S.D., Hoare C.A.R., Roscoe A.W. “A theory of Communicating Sequential Processes” JACM. Vol 31 n° 3, July 84, pp. 560–599

    Google Scholar 

  3. Costa G., Stirling C. “A fair Calculus of Communicating Systems” Proc. FCT 83, Springer-Verlag LNCS Vol. 158

    Google Scholar 

  4. Darondeau Ph., Kott L. “On the Observational Semantics of Fair Parallelism” Proc. ICALP 83, Springer-Verlag LNCS Vol. 154

    Google Scholar 

  5. Full Version of the above -INRIA Report 262 (1983)

    Google Scholar 

  6. Darondeau Ph., Kott L. “A Formal Proof System for Infinitary Rational Expressions” INRIA Report 218 (1983)

    Google Scholar 

  7. Darondeau Ph. “Infinitary Languages and Fully Abstract Models of Fair Asynchrony” INRIA Report 330 (1984)

    Google Scholar 

  8. Eilenberg S. “Automata, Languages and Machines”, Vol. A. Academic Press, New York (1974)

    MATH  Google Scholar 

  9. Gabbay D., Pnueli A., Shelah S., Stavi J. “On the Temporal Analysis of Fairness” Proc. 7th Ann. ACM Symp. on POPL (1980)

    Google Scholar 

  10. Hennessy M. “Synchronous and Asynchronous Experiments on Processes” Internal Report CSR -125–82, University of Edinburgh (1982)

    Google Scholar 

  11. Jorrand Ph. “Specification of Communicating Processes and Process Implementation Correctness” Proc. 5th Int. Symp. on Programming Springer-Verlag LNCS Vol 137 (1982)

    Google Scholar 

  12. Milner R. “Fully Abstract Models of Typed A-Calculi” TCS Vol 4 n°1, 1977, pp. 1–23

    Google Scholar 

  13. Milner R. “A Calculus of Communicating Systems” Springer-Verlag LNCS Vol. 92 (1980)

    Google Scholar 

  14. Milner R. “Calculi for Synchrony and Asynchrony” TCS Vol. 25 n°3, 1983, pp. 267–310

    Google Scholar 

  15. Milner R. “A finite Delay Operator for Synchronous CCS” Internal Report CSR 116–82 University of Edinburgh (1982)

    Google Scholar 

  16. Park D. “On the Semantics of Fair Parallelism” in Abstract Software Specifications Springer-Verlag LNCS Vol. 86 (1980)

    Google Scholar 

  17. Plotkin G. “A Structural Approach to Operational Semantics” DAIMI FN-19, Computer Science Dept. Aarhus University (1981)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. IRISA -Campus de Beaulieu-, 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

Editors and Affiliations

  1. L.I.T.P., Université Paris 7, 2, Place Jussieu, 75251, Paris, France

    Krzysztof R. Apt

Rights and permissions

Reprints and permissions

Copyright information

© 1985 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Darondeau, P. (1985). About Fair Asynchrony. In: Apt, K.R. (eds) Logics and Models of Concurrent Systems. NATO ASI Series, vol 13. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-82453-1_12

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-82453-1_12

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-82455-5

  • Online ISBN: 978-3-642-82453-1

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation