Skip to main content
SpringerLink
Log in

Denotational models based on synchronously communicating processes: Refusal, acceptance, safety

  • 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:

Abstract

An improvement to the failures model of concurrency is presented. We derive our model from first principles and show it to be a generalization of failures. Our approach gives rise to a natural treatment of the hiding operation not possible in the failures model. In addition, we employ the above technique to construct acceptance-refusal models leading to similar satisfactory treatments of hiding.

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. Brookes, S., (1983), "On the Relationship of CCS and CSP", in Automata, Languages and Programming, LNCS 154.

    Google Scholar 

  2. Golson, W., (1984), "Denotational Models Based on Synchronously Communicating Processes", Ph.D. thesis, University of Michigan.

    Google Scholar 

  3. Hennessy, M. and Milner, R., (1980), "On Observing Nondeterminism and Concurrency", in Automata, Languages and Programming, LNCS 85.

    Google Scholar 

  4. Hoare, C.A.R., (1978), "Communicating Sequential Processes", CACM 21:8.

    Google Scholar 

  5. Hoare, C.A.R., Brookes, S. and Roscoe, A., (1984), "A Theory of Communicating Sequential Processes", JACM 31:3.

    Google Scholar 

  6. Milner, R., (1980), A Calculus of Communicating Systems, LNCS 92.

    Google Scholar 

  7. Rounds, W., (1983), "On the Relationship Between Scott Domains, Synchronization Trees, and Metric Spaces", University of Michigan, Computing Research Laboratory Technical Report, CRL-TR-25-83.

    Google Scholar 

  8. Rounds, W. and Brookes, S., (1981), "Possible Futures, Refusals and Communicating Processes", Proceedings of the 22nd FOCS.

    Google Scholar 

  9. Scott, D., (1982), "Domains for Denotational Semantics", in Automata, Languages and Programming, LNCS 140.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Computer Science, Rice University, 77251, Houston, Texas

    William G. Golson

Authors
  1. William G. Golson
    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

Golson, W.G. (1985). Denotational models based on synchronously communicating processes: Refusal, acceptance, safety. 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_18

Download citation

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

  • 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