Abstract
Projections into free monoids are one of possible ways of describing finite traces. That approach is used to expand them to infinite traces, which are defined as members of a proper subfamily of cartesian product of mentioned free monoids, completed with least upper bounds in the Scott’s sense. Elements of the cartesian product are called projection sets and elements of the proper subfamily are called reconstructible projection sets. The proposed description gives useful methods of investigation. Especially, it contains a constructive operation that turns an arbitrary element of cartesian product to the closest trace. Then, we define constructively a proper subclass of projection sets, called internal conflict-free projection sets, and show using structural induction that it is precisely equal to subfamily of reconstructible projection sets. This is the main result of the paper. The proofs are ommited becouse of the page limit.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Cartier, P., Foata, D.: Problèmes combinatoires de commutation et réarrangements. Lecture Notes in Mathematics, vol. 85. Springer, Berlin (1969)
Diekert, V.: Combinatorics on Traces. Springer, Berlin (1990)
Diekert, V., Rozenberg, G. (eds.): The Book of Traces. World Scientific, Singapore (1995)
Gastin, P.: Infinite traces. In: Guessarian, I. (ed.) LITP 1990. LNCS, vol. 469, pp. 277–308. Springer, Heidelberg (1990)
Gastin, P., Petit, A.: Infinite traces. In: Diekert, V., Rozenberg, G. (eds.) The Book of Traces, ch. 11, pp. 393–486. World Scientific, Singapore (1995)
Kwiatkowska, M.Z.: Defining process fairness for non-interleaving concurrency. Foundations of Software Technology and Theoretical Computer Science 10, 286–300 (1990)
Mazurkiewicz, A.: Concurrent program schemes and their interpretations. Daimi report pb-78, Aarhus University (1977)
Mikulski, Ł.: Projection representation of Mazurkiewicz traces. Fundamenta Informaticae 85, 399–408 (2008)
Shields, M.W.: Concurrent machines. The Computer Journal 28(5), 449–465 (1985)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2009 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Mikulski, Ł. (2009). Internal Conflict-Free Projection Sets. In: Cyran, K.A., Kozielski, S., Peters, J.F., Stańczyk, U., Wakulicz-Deja, A. (eds) Man-Machine Interactions. Advances in Intelligent and Soft Computing, vol 59. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-00563-3_52
Download citation
DOI: https://doi.org/10.1007/978-3-642-00563-3_52
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-00562-6
Online ISBN: 978-3-642-00563-3
eBook Packages: EngineeringEngineering (R0)