Lecture Notes in Computer Science, Vol. 454, pages 1-164 pp.. Berlin, Germany: Springer-Verlag, 1990.
Abstract: The author presents the algebraic and combinatorial foundations of trace theory, develops a new theory of replacement systems for trace monoids, and enlarges the range of application of the theory to a much wider class of Petri nets than previously considered. The first chapter starts with an example. Following this example, the author gives basic definitions and theorems. Chapter 2 is dedicated to recognizable and rational sets (trace languages). Chapter 3 is devoted to an application of this theory to a modular approach for the computation of Petri net languages. The last two chapters cover replacement systems.
Keywords: algebraic (and) combinatorial (foundation of) trace theory; replacement system; trace language; recognizable (and) rational set, trace language; modularization (of) net language computation.
Back to the Petri Nets Bibliography