Projection Representation of Mazurkiewicz Traces

• Autorzy: Mikulski Ł
• Języki publikacji: EN

Abstrakty

EN

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.

Słowa kluczowe

EN

Mazurkiewicz traces

• Wydawca: Polskie Towarzystwo Matematyczne
• Czasopismo: Fundamenta Informaticae
• Rocznik: 2008
• Tom: Vol. 85, nr 1-4
• Strony: 399--408
• Opis fizyczny: bibliogr. 6 poz.

Twórcy

autor

Mikulski Ł

• Faculty of Mathematics and Computer Science, Nicolaus Copernicus University, Chopina 12/18, 87-100 Toruń, Poland,

Bibliografia

• [1] Abramsky, S., Gabbay, D. M., Maibaum, T. S. E., Eds.: Handbook of Logic in Computer Science, Vol 1, Oxford University Press, 1992.
• [2] Cori, R., Perrin, D.: Automates et Commutations Partielles, ITA, 19(1), 1985, 21-32.
• [3] Diekert, V., Rozenberg, G., Eds.: The Book of Traces, World Scientific, Singapore, 1995.
• [4] Gastin, P., Petit, A.: Infinite traces, in: The Book of Traces [3] (V. Diekert, G. Rozenberg, Eds.), chapter 11, World Scientific, Singapore, 1995, 393-486.
• [5] Kwiatkowska, M. Z.: Defining Process Fairness for Non-Interleaving Concurrency, FSTTCS: Foundations of Software Technology and Theoretical Computer Science, 10, 1990, 286-300.
• [6] Shields, M. W.: ConcurrentMachines, The Computer Journal, 28(5), 1985, 449-465.