eprintid: 347
rev_number: 9
eprint_status: archive
userid: 32
dir: disk0/00/00/03/47
datestamp: 2011-06-13 14:23:35
lastmod: 2011-07-11 14:36:26
status_changed: 2011-06-13 14:23:35
type: book_section
metadata_visibility: show
item_issues_count: 0
creators_name: De Nicola, Rocco
creators_name: Veglioni, Simone
creators_id: r.denicola@imtlucca.it
creators_id: 
title: Possible Worlds for Process Algebras
ispublished: pub
subjects: QA75
divisions: CSA
full_text_status: none
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. 
date: 1998
date_type: published
series: Lecture Notes in Computer Science
volume: 1466
publisher: Springer
pagerange: 179-193
id_number: 10.1007/BFb0055623
refereed: TRUE
isbn: 3-540-64896-8
book_title: CONCUR '98 Concurrency Theory
editors_name: Sangiorgi, Davide
editors_name: de Simone, Robert
official_url: http://dx.doi.org/10.1007/BFb0055623
citation:   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)