For the most recent entries see the Petri Nets Newsletter.

An Event-Based SOS for a Language with Refinement.

Rensink, Arend

In: Desel, J.: Structures in Concurrency Theory, Proceedings of the International Workshop on Structures in Concurrency Theory (STRICT), Berlin, 11-13 May 1995, pages 294-309. 1995.

Abstract: The notion of action refinement has been studied intensively in the past few years. It is usually introduced in the form of an operator in a process algebraic language, for which a denotational semantics in a suitable model is then given. In this paper we complement this approach by defining a corresponding operational semantics for refinement, in the form of derivation rules for a transition relation. Because of the (well-known) fact that ordinary transition systems are not expressive enough to capture the effects of refinement, we use an event-based transition system model described elsewhere in the literature. The operational semantics of refinement this defined is equivalent (in fact event isomorphic) to the usual denotational semantics.


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

Back to the Petri Nets Bibliography