De Nicola, Rocco and Veglioni, Simone Possible Worlds for Process Algebras. In: CONCUR '98 Concurrency Theory. Lecture Notes in Computer Science, 1466 . Springer, pp. 179-193. ISBN 3-540-64896-8 (1998)Full text not available from this repository.
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.
|Item Type:||Book Section|
|Subjects:||Q Science > QA Mathematics > QA75 Electronic computers. Computer science|
|Research Area:||Computer Science and Applications|
|Depositing User:||Rocco De Nicola|
|Date Deposited:||13 Jun 2011 14:23|
|Last Modified:||11 Jul 2011 14:36|
Actions (login required)