In: de Bakker, J.W.; et al.: Lecture Notes in Computer Science, Vol. 354: Linear Time, Branching Time and Partial Order in Logics and Models for Concurrency., pages 285-363. Springer Verlag, 1989.
Abstract: Traces represent concurrent processes in the same way as strings represent sequential ones. The theory of traces can be used as a tool for reasoning about nets and it is hoped that applying this theory one can get a calculus of the concurrent processes analogous to that available for sequential systems. The following topics are discussed in the paper: algebraic properties of traces, trace models of some concurent phenomena, fixed-point calculus for finding the behaviour of nets, modularity, and some applications of the presented theory.