For the most recent entries see the Petri Nets Newsletter.

Partial Order Semantics for Refinement of Actions --- Neither Necessary nor Always Sufficient but Appropriate when Used with Care.

van Glabbeek, Rob; Goltz, Ursula

Note CS-N8901. Amsterdam, The Netherlands: Centre for Mathematics and Computer Science, 1989.

Abstract: In this paper it is shown that there are several equivalences based on partial orders which are not preserved by refinement (namely when taking the choice structure of systems into account); that nevertheless a ``branching time'' partial order equivalence can be found that is preserved under refinement; but that, in order to achieve preservation under refinement it is not necessary to employ partial order semnatics: there exist equivalences that abstract from the causal structure of concurrent systems and are still preserved under refinement.

Keywords: partial order semantics; refinement (of actions); branching time partial order equivalence; causal structure.

Do you need a refined search? Try our search engine which allows complex field-based queries.

Back to the Petri Nets Bibliography