Denotational, Causal, and Operational Determinism in Event Structures

Arend Rensink; H. Kirchner

doi:10.1007/3-540-61064-2_43

Denotational, Causal, and Operational Determinism in Event Structures

Arend Rensink, H. Kirchner (Editor)

Research output: Contribution to conference › Paper › peer-review

1 Citation (Scopus)

218 Downloads (Pure)

Abstract

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 language	Undefined
Pages	272-286
Number of pages	15
DOIs	https://doi.org/10.1007/3-540-61064-2_43
Publication status	Published - 1996
Event	Trees in Algebra and Programming (CAAP) - Duration: 1 Jan 1996 → 1 Jan 1996

Conference

Conference	Trees in Algebra and Programming (CAAP)
Period	1/01/96 → 1/01/96

Keywords

IR-66661
EWI-8294

Access to Document

10.1007/3-540-61064-2_43

Cite this

@conference{639f053d07714a2298c2f2472c8d9af3,

title = "Denotational, Causal, and Operational Determinism in Event Structures",

abstract = "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.",

keywords = "IR-66661, EWI-8294",

author = "Arend Rensink and H. Kirchner",

year = "1996",

doi = "10.1007/3-540-61064-2_43",

language = "Undefined",

pages = "272--286",

note = "Trees in Algebra and Programming (CAAP) ; Conference date: 01-01-1996 Through 01-01-1996",

}

TY - CONF

T1 - Denotational, Causal, and Operational Determinism in Event Structures

AU - Rensink, Arend

A2 - Kirchner, H.

PY - 1996

Y1 - 1996

N2 - 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.

AB - 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.

KW - IR-66661

KW - EWI-8294

U2 - 10.1007/3-540-61064-2_43

DO - 10.1007/3-540-61064-2_43

M3 - Paper

SP - 272

EP - 286

T2 - Trees in Algebra and Programming (CAAP)

Y2 - 1 January 1996 through 1 January 1996

ER -