Abstract
We introduce and investigate some shuffle-like operations on ω-words and ω-languages. The approach is applicable to concurrency, providing a method to define the parallel composition of processes. It is also applicable to parallel computation. The operations are introduced using a uniform method based on the notion of an ω-trajectory. As a consequence, we obtain a very intuitive geometrical interpretation of the parallel composition operation. Our main results concern associativity. A rather surprising interconnection between associativity and periodicity will be exhibited.
The work reported here has been partially supported by the Project 11281 of the Academy of Finland and the ESPRIT Basic Research Working Group ASMICS II. All correspondence to Alexandru Mateescu.
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
References
J. C. M. Baeten and W. P. Weijland, Process Algebra, Cambridge University Press, 1990.
P. M. Cohn, Universal Algebra, D. Reidel Publishing Company, New York, 1980.
J. S. Golan, The Theory of Semirings with Applications in Mathematics and Theoretical Computer Science, Longman Scientific and Technical, Harlow, Essex, 1992.
M. Hennessy, Algebraic Theory of Processes, The MIT Press, Cambridge, Massachusetts, London, 1988.
W. Kuich and A. Salomaa, Semirings, Automata, Languages, EATCS Monographs on Theoretical Computer Science, Springer-Verlag, Berlin, 1986.
A. Mateescu and A. Salomaa, “Formal Languages: an Introduction and a Synopsis”, Chapter 1, in Handbook of Formal Languages, eds. G. Rozenberg and A. Salomaa, Springer-Verlag, to appear.
A. Mateescu, G. Rozenberg and A. Salomaa, “Shuffle on Trajectories: Syntactic Constraints”, Technical Report 96-18, University of Leiden, 1996.
R. Milner, Communication and Concurrency, Prentice Hall International, 1989.
D. Perrin and J. E. Pin, Mots Infinis, Report LITP 93.40, 1993.
A. Salomaa, Formal Languages, Academic Press, New York, 1973.
W. Thomas, “Automata on Infinite Objects”, in Handbook of Theoretical Computer Science, Volume B, ed. J. van Leeuwen, Elsevier, 1990, 135–191.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1997 Springer-Verlag Berlin Heidelberg
About this chapter
Cite this chapter
Mateescu, A., Mateescu, G.D., Rozenberg, G., Salomaa, A. (1997). Shuffle-like operations on ω-words. In: Păun, G., Salomaa, A. (eds) New Trends in Formal Languages. Lecture Notes in Computer Science, vol 1218. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-62844-4_28
Download citation
DOI: https://doi.org/10.1007/3-540-62844-4_28
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-62844-6
Online ISBN: 978-3-540-68703-0
eBook Packages: Springer Book Archive