Trajectories have been introduced as mechanisms to control the shuffle operation, traditionally important in the study of parallelism and concurrency. A variant, nondeterministic trajectory will be introduced in this paper. It provides more leeway in the control of the shuffle operation. Ordinary trajectories will be obtained as a special case of nondeterministic ones. The paper investigates basic properties of nondeterministic trajectories, emphasizing algebraic aspects, interconnections with language theory and the property of fairness.
KeywordsRegular Language Language Theory Parallel Composition Semantic Constraint Commutative Monoid
Unable to display preview. Download preview PDF.
- 1.J.S. Golan, The Theory of Semirings with Applications in Mathematics and Theoretical Computer Science, Longman Scientific and Technical, Harlow, Essex, 1992.Google Scholar
- 2.W. Kuich and A. Salomaa, Semirings, Automata, Languages, EATCS Monographs on Theoretical Computer Science, Springer-Verlag, Berlin, 1986.Google Scholar
- 3.A. Mateescu, “On (Left ) Partial Shuffle”, Results and Trends in Theoretical Computer Science, LNCS 812, Springer-Verlag, (1994) 264–278.Google Scholar
- 6.G. Rozenberg and A. Salomaa (Eds.), Handbook of Formal Languages, Springer-Verlag, 1997, Vol. 1–3.Google Scholar