Projection Representation of Mazurkiewicz Traces

Issue title: Concurrency Specification and Programming (CS&P)

Article type: Research Article

Authors: Mikulski, Łukasz

Affiliations: Faculty of Mathematics and Computer Science, Nicolaus Copernicus University, Chopina 12/18, 87-100 Toruń, Poland. frodo@mat.uni.torun.pl

Note: [] Address for correspondence: Wydział Matematyki i Informatyki, ul. Chopina 12/18, 87-100 Toruń, Poland

Abstract: The behavior of infinite traces is an interesting field for studies. Infinite traces can be described using projections to word monoids. Such projection representations can be generalized to projection sets. To complete simple descriptions, the binary operation from projection sets to traces has been defined. After such preparations some properties of infinite traces are discussed.

Journal: Fundamenta Informaticae, vol. 85, no. 1-4, pp. 399-408, 2008