Partial Characterization of Synchronization Languages

Synchronization languages are associated with synchronization expressions, a high-level construct which allows a programmer to express synchronization constraints in a distributed context. We give a negative answer to a conjecture enunciated by L. Guo, K. Salomaa and S. Yu which aims at characterizing synchronization languages in terms of regular languages closed under a rewriting system. Then we propose an extension of the system which gives a positive answer for a class of regular languages.

[1]  Robert Cori,et al.  Automates et Commutations Partielles , 1985, RAIRO Theor. Informatics Appl..

[2]  M. Clerbout,et al.  Semi-commutations , 1987, Inf. Comput..

[3]  Sheng Yu,et al.  On Synchronization Languages , 1996, Fundam. Informaticae.

[4]  Sheng Yu,et al.  Synchronization expressions and languages , 1994, Proceedings of 1994 6th IEEE Symposium on Parallel and Distributed Processing.

[5]  Yves Métivier.  Contribution à l'étude des monoi͏̈des de commutations , 1987 .

[6]  R. Govindarajan,et al.  ParC project: practical constructs for parallel programming languages , 1991, [1991] Proceedings The Fifteenth Annual International Computer Software & Applications Conference.