Advertisement

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

  • William G. Golson
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 197)

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.

Keywords

Process Operation Complete Lattice Failure Model Denotational Semantic Bounded Tree 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. [Bro]
    Brookes, S., (1983), "On the Relationship of CCS and CSP", in Automata, Languages and Programming, LNCS 154.Google Scholar
  2. [Gol]
    Golson, W., (1984), "Denotational Models Based on Synchronously Communicating Processes", Ph.D. thesis, University of Michigan.Google Scholar
  3. [HeM]
    Hennessy, M. and Milner, R., (1980), "On Observing Nondeterminism and Concurrency", in Automata, Languages and Programming, LNCS 85.Google Scholar
  4. [Hoa]
    Hoare, C.A.R., (1978), "Communicating Sequential Processes", CACM 21:8.Google Scholar
  5. [HBR]
    Hoare, C.A.R., Brookes, S. and Roscoe, A., (1984), "A Theory of Communicating Sequential Processes", JACM 31:3.Google Scholar
  6. [Mil]
    Milner, R., (1980), A Calculus of Communicating Systems, LNCS 92.Google Scholar
  7. [Rou]
    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. [RoB]
    Rounds, W. and Brookes, S., (1981), "Possible Futures, Refusals and Communicating Processes", Proceedings of the 22nd FOCS.Google Scholar
  9. [Sco]
    Scott, D., (1982), "Domains for Denotational Semantics", in Automata, Languages and Programming, LNCS 140.Google Scholar

Copyright information

© Springer-Verlag 1985

Authors and Affiliations

  • William G. Golson
    • 1
  1. 1.Department of Computer ScienceRice UniversityHouston

Personalised recommendations