In: Rozenberg, G.: Lecture Notes in Computer Science, Vol. 609; Advances in Petri Nets 1992, pages 267-291. Springer-Verlag, 1992.
Abstract: Event Structures are a poset based model for describing the behaviour of distributed systems. They give rise to a well understood class of Scott domains. Event structures are also related to Petri nets in a fundamental way. Trace monoids are a string-based formalism for describing the behaviour of distributed systems. They have an independent theory rooted in the theory of formal languages, but are too weak to express more general nets and problems, such as the producer and consumer paradigm for example. Thus extensions of original traces have been looked at. In this paper, we describe connections between Partially Ordered Sets and Traces, using a Transition System, and in order to allow sound generalizations of finite traces to context-sensitive ones. We obtain a representation of generalized trace languages in terms of labelled event structures.
Keywords: Transition Systems: Event Structures; Partial Orders; Trace Languages.