Refinement of concurrent systems based on local state transformations (original) (raw)

Lecture Notes in Computer Science, 1990

Abstract

The paper presents a notion of preorder with related equivalence between concurrent systems which supports functional abstraction and refinement. Such abstraction and refinement disregard action names (the action alphabet can be changed) while they require to preserve local state transformations. Since Petri Nets explicitly model both states and state transformations, concurrent systems are considered as modelled by Petri nets, precisely

L. Pomello hasn't uploaded this paper.

Let L. know you want this paper to be uploaded.

Ask for this paper to be uploaded.