EEMCS EPrints Service
|
||||||||||||||||||||||||||||||||
|
Rensink, A.
(1995)
A Theory of Deterministic Event Structures.
In: Concurrency Theory (CONCUR), Long Island, USA.
pp. 160-174.
Lecture Notes in Computer Science 962.
Springer Verlag.
ISSN 0302-9743
ISBN 978-3-540-60218-7
Full text available as:
Official URL: http://dx.doi.org/10.1007/3-540-60218-6_12 AbstractWe present an omega-í°€complete algebra of a class of deterministic event structures which are labelled prime event structures where the labelling function satises a certain distinctness condition. The operators of the algebra are summation sequential composition and join. Each of these gives rise to a monoid in addition a number of distributivity properties hold Summation loosely corresponds to choice and join to parallel composition with however some nonstandard aspects The space of models is a complete partial order in fact a complete lattice, in which all operators are continuous hence minimal fixpoints can be defined inductively. Moreover the submodel relation can be captured within the algebra by summation x
Export this item as: To correct this item please ask your editor Repository Staff Only: edit this item |
||||||||||||||||||||||||||||||||