@incollection{eprints347,
       booktitle = {CONCUR '98 Concurrency Theory},
          editor = {Davide Sangiorgi and Robert de Simone},
          author = {Rocco De Nicola and Simone Veglioni},
       publisher = {Springer},
            year = {1998},
          series = {Lecture Notes in Computer Science},
           title = {Possible Worlds for Process Algebras},
           pages = {179--193},
          volume = {1466},
             url = {http://eprints.imtlucca.it/347/},
        abstract = {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. }
}