Pivotal Synchronization Languages: A Framework for Alignments
We propose pivotal synchronization languages (PSLs) that represent alignments of parallel processes. PSLs are closely related to synchronization languages , but the strings in PSLs are partitioned into sequences of pivots. In the partitioned representation, each pivot gathers and aligns simultaneous process boundaries (starts and terminations). The paper demonstrates that PSLs (and new join operators) provide a unified framework for implementing some independent formalisms. In particular, we show that at least two existing formalisms, generalized synchronization expressions  and interleave-disjunction-lockexpressions  have PSL-based counterparts. Furthermore, we sketch tentatively a new formalism that adapts the ideas of the operator of generalized restriction  to PSLs. All this suggests that the union of these formalisms might be implementable.
KeywordsNatural Language Processing Parallel Execution Process Symbol Natural Language Generation Regular Operation
Unable to display preview. Download preview PDF.
- 2.Beesley, K.R., Karttunen, L.: Finite State Morphology. CSLI Studies in Computational Linguistics. CSLI Publications, Stanford (2003)Google Scholar
- 3.Bird, S., Ellison, T.M.: One-level phonology: Autosegmental representations and rules as finite automata. Computational Linguistics 20(1), 55–90 (1994)Google Scholar
- 7.Koskenniemi, K.: Two-level morphology: a general computational model for word-form recognition and production. Publications of the Department of General Linguistics, vol. 11, University of Helsinki, Yliopistopaino, Helsinki (1983)Google Scholar
- 11.Yli-Jyrä, A.M., Koskenniemi, K.: Compiling contextual restrictions on strings into finite-state automata. In: Cleophas, L., Watson, B.W. (eds.) The Eindhoven FASTAR Days, Proceedings, Computer Science Reports 04/40, Technische Universiteit Eindhoven, Eindhoven, The Netherlands, September 3–4 (2004)Google Scholar