22nd Annual Symposium on Foundations of Computer Science (sfcs 1981) (1981)

Oct. 28, 1981 to Oct. 30, 1981

ISSN: 0272-5428

pp: 140-149

DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/SFCS.1981.36

ABSTRACT

Two distinct models for the notion of communicating processes are introduced, developed and related. The first, called the possible-futures model, is a generalization to nondeterministic systems of the familiar derivative (Nerode equivalence class) construction. The second, called the acceptance-refusals model, is a slight strengthening of a model introduced by Hoare, Brookes, and Roscoe. The PF model can be mapped onto the AR model homomorphically, and the equivalence classes of this map can be characterized by imposing a very natural equivalence relation on the PF model. The resulting quotient algebra admits a complete partial order structure in which the algebraic operations are continuous.

INDEX TERMS

CITATION

W. C. Rounds and S. D. Brookes, "Possible futures, acceptances, refusals, and communicating processes,"

*22nd Annual Symposium on Foundations of Computer Science (sfcs 1981)(FOCS)*, vol. 00, no. , pp. 140-149, 1981.

doi:10.1109/SFCS.1981.36

CITATIONS