relation: http://eprints.imtlucca.it/347/
title: Possible Worlds for Process Algebras
creator: De Nicola, Rocco
creator: Veglioni, Simone
subject: QA75 Electronic computers. Computer science
description: 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. 
publisher: Springer
contributor: Sangiorgi, Davide
contributor: de Simone, Robert
date: 1998
type: Book Section
type: PeerReviewed
identifier:   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)  
relation: http://dx.doi.org/10.1007/BFb0055623
relation: 10.1007/BFb0055623