An Event-Based SOS for a Language with Refinement

J. Desel (Editor), Arend Rensink

    Research output: Contribution to conferencePaperpeer-review

    117 Downloads (Pure)


    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 thus defined is equivalent (in fact event isomorphic) to the usual denotational semantics.
    Original languageUndefined
    Number of pages16
    Publication statusPublished - 1995
    EventStructures in Concurrency Theory - Berlin, Germany
    Duration: 1 Jan 19951 Jan 1995


    WorkshopStructures in Concurrency Theory


    • IR-66649
    • EWI-8268

    Cite this