Denotational, Causal, and Operational Determinism in Event Structures

Arend Rensink, H. Kirchner (Editor)

    Research output: Contribution to conferencePaperpeer-review

    1 Citation (Scopus)
    168 Downloads (Pure)


    Determinism of labelled transition systems and trees is a concept of theoretical and practical importance. We study its generalisation to event structures. It turns out that the result depends on what characterising property of tree determinism one sets out to generalise. We present three distinct notions of event structure determinism, and show that none of them shares all the pleasant properties of the one concept for trees.
    Original languageUndefined
    Number of pages15
    Publication statusPublished - 1996
    EventTrees in Algebra and Programming (CAAP) -
    Duration: 1 Jan 19961 Jan 1996


    ConferenceTrees in Algebra and Programming (CAAP)


    • IR-66661
    • EWI-8294

    Cite this