This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
22nd Annual Symposium on Foundations of Computer Science (FOCS 1981)
Possible futures, acceptances, refusals, and communicating processes
October 28-October 30
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.
Citation:
W. C. Rounds, S. D. Brookes, "Possible futures, acceptances, refusals, and communicating processes," focs, pp.140-149, 22nd Annual Symposium on Foundations of Computer Science (FOCS 1981), 1981
Usage of this product signifies your acceptance of the Terms of Use.