- Trace theory
In
mathematics andcomputer science , trace theory aims to provide a concrete mathematical underpinning for the study ofconcurrent computation andprocess calculi . The underpining is provided by an algebraic definition of thefree partially commutative monoid ortrace monoid , or equivalently, thehistory monoid , which provides a concrete algebraic foundation, analogous to the way that thefree monoid provides the underpining forformal language s.The power of trace theory stems from the fact that the algebra of
dependency graph s (such asPetri net s) isisomorphic to that of trace monoids, and thus, one can apply both algebraicformal language tools, as well as tools fromgraph theory .Trace theory was first formulated by
Antoni Mazurkiewicz in the 1970s, in an attempt to evade some of the problems in the theory of concurrent computation, including the problems of interleaving and non-deterministic choice with regards to refinement in process calculi.References
* V. Diekert, G. Rozenberg, eds. "The Book of Traces", (1995) World Scientific, Singapore ISBN 9810220588
* Volker Diekert, Yves Metivier, " [http://citeseer.ist.psu.edu/diekert97partial.html Partial Commutation and Traces] ", In G. Rozenberg and A. Salomaa, editors, "Handbook of Formal Languages", Vol. 3, Beyond Words, pages 457--534. Springer-Verlag, Berlin, 1997.
Wikimedia Foundation. 2010.