TY  - CHAP
AV  - none
TI  - Possible Worlds for Process Algebras
ID  - eprints347
UR  - http://dx.doi.org/10.1007/BFb0055623
EP  - 193
PB  - Springer
SP  - 179
T3  - Lecture Notes in Computer Science
T2  - CONCUR '98 Concurrency Theory
A1  - De Nicola, Rocco
A1  - Veglioni, Simone
M1  - 1466
ED  - Sangiorgi, Davide
ED  - de Simone, Robert
N2  - A non-deterministic process is viewed as a set of deterministic ones: its possible worlds. Each world represents a particular ?solution? of non-determinism. Under this view of non-determinism as underspecification, nodeterministic processes are specifications, and the possible worlds represent the model space and thus the set of possible implementations. Then, refinement is inclusion of sets of possible worlds and can be used for stepwise specifications. This notion of refinement naturally induces new preorders (and equivalences) for processes that we characterize denotationally, operationally and axiomatically for a basic process algebra with nil, prefix and choice. 
SN  - 3-540-64896-8
Y1  - 1998///
ER  -