A Theory of Deterministic Event Structures
Rensink, A. (1995) A Theory of Deterministic Event Structures. In: Concurrency Theory (CONCUR), Long Island, USA (pp. pp. 160174).

PDF
219kB 
Abstract:  We present an omegaU+00edU+00b0U+0080complete 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 y iff x + y = y; therefore, the effect of fixpoints can be captured by an infinitary proof rule, yielding a complete proof system for recursively defined deterministic event structures. 
Item Type:  Conference or Workshop Item 
Faculty:  Electrical Engineering, Mathematics and Computer Science (EEMCS) 
Research Group:  
Link to this item:  http://purl.utwente.nl/publications/66652 
Official URL:  http://dx.doi.org/10.1007/3540602186_12 
Export this item as:  BibTeX EndNote HTML Citation Reference Manager 
Repository Staff Only: item control page