Nederlands
Contact
Sitemap
Search
OrganisationEEMCS EPrints Service
 |
|
|
||||||||||||||||||||||||||||||
|
|
|
|
|
||||||||||||||||||||||||||||
|
|
|
||||||||||||||||||||||||||||||
|
|
|
|
|
||||||||||||||||||||||||||||
|
|
Rensink, A.
(1996)
Denotational, Causal, and Operational Determinism in Event Structures.
In: Trees in Algebra and Programming (CAAP).
pp. 272-286.
Lecture Notes in Computer Science 1059.
Springer Verlag.
ISSN 0302-9743
ISBN 978-3-540-61064-9
Full text available as:
Official URL: http://dx.doi.org/10.1007/3-540-61064-2_43 AbstractDeterminism 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.
Export this item as: To correct this item please ask your editor Repository Staff Only: edit this item |
|
|
||||||||||||||||||||||||||||
|
|
|
||||||||||||||||||||||||||||||
|
|
|
|
|
||||||||||||||||||||||||||||
|
|
|
||||||||||||||||||||||||||||||
