For the most recent entries see the Petri Nets Newsletter.

Equivalences and Refinement.

van Glabbeek, Rob J.; Goltz, Ursula

In: Guessarian, I.: Lecture Notes in Computer Science, Vol. 469; Semantics of Systems of Concurrent Processes. Proceedings of the LITP Spring School on Theoretical Computer Science, 1990, La Roche Posay, France, pages 309-333. Berlin, Germany: Springer-Verlag, 1990.

Also as: 12/90 A: SFB-Bericht No. 342. München, Germany: Technische Universiät, Institut für Informatik, Sonderforschungsbereich ``Methoden und Werkzeuge für die Nutzung paralleler Rechnerarchitekturen'', July 1990.

Abstract: The authors investigate equivalence notions for concurrent sytems. They consider ``linear time'' approaches where the system behaviour is characrerised as the set of possible runs as well as ``branching time'' approaches where the conflict structure of the system is taken into account. The authors show that the ususal interleaving equivalences based on steps are not preserved by refinement of actions. They prove that ``linear time'' partial order semantics, where causality in runs is explicit, is invariant under refinement. Finally, the authors consider various bisimulation equivalences based on partial orders.

Keywords: refinement (of actions); linear time partial order semantics; branching time; interleaving equivalence; bisimulation equivalence.

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

Back to the Petri Nets Bibliography