In: 91; 3rd Workshop on Concurrency and Compositionality, 1991, Goslar, Germany / Best, E.; et al.: GMD-Studien Nr. 191; Hildesheimer Informatik-Berichte 6, pages 196-200. St. Augustin, Germany: Gesellschaft für Mathematik und Datenverarbeitung mbH --- Universität Hildesheim (Germany), Institut für Informatik, May 1991.
Also as: LRI Rapport de Recherche No. 657, pages 1-5 pp.. Laboratoire de Recherche en Informatique, Universite de Paris-Sud, Centre d'Orsay, France, April 1991.
Abstract: The purpose of the paper is to describe the connections beween Petri Nets, Transition Systems, Partial Order Sets and Traces, in order to allow sound generalizations of finite traces to context-sensitive ones. The aim of the paper is to introduce the widest model of traces, performing it in such a way that PoSet properties are still satiesfied. The paper deals with context dependent extension of finte traces and establishes the connection between event structure and extended traces using transition systems, what offers an alternative theory for them.
Keywords: distributed language, context dependent extension (of) trace(s); transition system; event structure.