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.
|Number of pages||15|
|Publication status||Published - 1996|
|Event||Trees in Algebra and Programming (CAAP) - |
Duration: 1 Jan 1996 → 1 Jan 1996
|Conference||Trees in Algebra and Programming (CAAP)|
|Period||1/01/96 → 1/01/96|