EEMCS

Home > Publications
Home University of Twente
Education
Research
Prospective Students
Jobs
Publications
Intranet (internal)
 
 Nederlands
 Contact
 Sitemap
 Search
 Organisation

EEMCS EPrints Service


8271 A Theory of Deterministic Event Structures
Home Policy Brochure Browse Search User Area Contact Help

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:

PDF
- Requires a PDF viewer such as GSview, Xpdf or Adobe Acrobat Reader
215 Kb

Official URL: http://dx.doi.org/10.1007/3-540-60218-6_12

Abstract

We 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 \sqsubseteq 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 Paper (Full Paper, Talk)
Research Group:EWI-FMT: Formal Methods and Tools
ID Code:8271
Status:Published
Deposited On:04 January 2007
Refereed:Yes
International:Yes
More Information:statistics

Export this item as:

To correct this item please ask your editor

Repository Staff Only: edit this item