Denotational models based on synchronously communicating processes: Refusal, acceptance, safety
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.
KeywordsProcess Operation Complete Lattice Failure Model Denotational Semantic Bounded Tree
Unable to display preview. Download preview PDF.
- [Bro]Brookes, S., (1983), "On the Relationship of CCS and CSP", in Automata, Languages and Programming, LNCS 154.Google Scholar
- [Gol]Golson, W., (1984), "Denotational Models Based on Synchronously Communicating Processes", Ph.D. thesis, University of Michigan.Google Scholar
- [HeM]Hennessy, M. and Milner, R., (1980), "On Observing Nondeterminism and Concurrency", in Automata, Languages and Programming, LNCS 85.Google Scholar
- [Hoa]Hoare, C.A.R., (1978), "Communicating Sequential Processes", CACM 21:8.Google Scholar
- [HBR]Hoare, C.A.R., Brookes, S. and Roscoe, A., (1984), "A Theory of Communicating Sequential Processes", JACM 31:3.Google Scholar
- [Mil]Milner, R., (1980), A Calculus of Communicating Systems, LNCS 92.Google Scholar
- [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
- [RoB]Rounds, W. and Brookes, S., (1981), "Possible Futures, Refusals and Communicating Processes", Proceedings of the 22nd FOCS.Google Scholar
- [Sco]Scott, D., (1982), "Domains for Denotational Semantics", in Automata, Languages and Programming, LNCS 140.Google Scholar