Projection Representation of Mazurkiewicz Traces

Authors:
Łukasz Mikulski
Affiliations:
(Correspd.) Faculty of Mathematics and Computer Science, Nicolaus Copernicus University, Chopina 12/18, 87-100 Toruń, Poland. frodo@mat.uni.torun.pl
Venue:
Fundamenta Informaticae - Concurrency Specification and Programming (CS&P)
Year:
2008

Citing 3
Cited 0

Defining process fairness for non-interleaving concurrency

FST and TC 10 Proceedings of the tenth conference on Foundations of software technology and theoretical computer science
Handbook of logic in computer science (vol. 1): background: mathematical structures

Handbook of logic in computer science (vol. 1): background: mathematical structures
The Book of Traces

The Book of Traces

Quantified Score

Hi-index	0.00

Visualization

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.