Synchronization Expressions: Characterization Results and Implementation

  • Kai Salomaa
  • Sheng Yu


Synchronization expressions are defined as restricted regular expressions that specify synchronization constraints between parallel processes and their semantics is defined using the synchronization languages. In this paper we survey results on synchronization languages, in particular, various approaches to obtain a characterization of this language family using closure under a set of rewriting rules. Also, we discuss the use and implementation of synchronization expressions in a programming language designed for a parallel or distributed computing environment.


Regular Language Finite Automaton Deterministic Finite Automaton Distribute Computing Environment Formal Language Theory 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    Book, R. V., Otto, F. (1993) String-Rewriting Systems. Texts and Monographs in Computer Science. Springer-Verlag.MATHGoogle Scholar
  2. 2.
    Cheung H. Salomaa K., Wu X., Yu, S. (1997) An efficient implementation of regular languages using r-AFA. In: Proceedings of the Second International Workshop on Implementing Automata, WIA’97, 33–42.Google Scholar
  3. 3.
    Ciobanu G., Salomaa K., Yu S. Synchronization languages and ST semantics, manuscript in preparation.Google Scholar
  4. 4.
    Clerbout, M. Latteux, M., Roos, Y. (1995) Semi-commutations. In: The Book of Traces. (Diekert, V., Rozenberg, G. eds.) World Scientific, Singapore, 487–552.CrossRefGoogle Scholar
  5. 5.
    Clerbout, M., Roos, Y., Ryl, I. Synchronization languages. Theoret. Comput. Sci., to appear.Google Scholar
  6. 6.
    Clerbout M. Ros Y. RylI. (1998) Langages de synchronization et systèmes de réécriture. Tech. Rep. IT-98–311, Université des Sciences et Technologies de Lille.Google Scholar
  7. 7.
    Diekert V., Métivier Y. (1997) Partial commutation and traces. In: Handbook of Formal Languages, Vol. III. (Rozenberg G., Salomaa A. eds.) Springer-Verlag, 457–533.CrossRefGoogle Scholar
  8. 8.
    Govindarajan R. Guo L. Yu S. Wang P. (1991) ParC Project: Practical constructs for parallel programming languages. In: Proc. of the 15th Annual IEEE International Computer Software &, Applications Conference, 183–189.Google Scholar
  9. 9.
    Guo L., Salomaa K., Yu S. (1994) Synchronization expressions and languages. In: Proc. of the 6th IEEE Symposium on Parallel and Distributed Processing, (Dallas, Texas). IEEE Computer Society Press, 257–264.Google Scholar
  10. 10.
    Guo, L., Salomaa, K., Yu, S. (1996) On synchronization languages. Fundamenta Inform. 25, 423–436.MathSciNetMATHGoogle Scholar
  11. 11.
    Hennessy, M. (1989) Algebraic Theory of Processes. The MIT Press, Cambridge, Mass.Google Scholar
  12. 12.
    Huerter S., Salomaa K., Wu X., Yu S. (1998) Implementing reversed alternating finite automaton (r-AFA) operations. In: Proc. of the Third International Workshop on Implementing Automata, WIA’98, 54–64.Google Scholar
  13. 13.
    Osterhaug, A. (ed.) (1989) Guide to Parallel Programming — On Sequent Computer Systems. Prentice Hall, Englewood Cliffs, New Jersey.Google Scholar
  14. 14.
    Ryl, I., Roos, Y., Clerbout, M. (1997) Partial characterization of synchronization lanuages. In: Proc. of 22nd International Symposium on Mathematical Foundations of Computer Science, MFCS’97. Lect. Notes Comput. Sci. 1295, 209–218.MathSciNetCrossRefGoogle Scholar
  15. 15.
    Ryl, I., Roos, Y., Clerbout, M. (1998) About synchronization languages. In: Proc. of 23rd International Symposium on Mathematical Foundations of Computer Science, MFCS’98. Lect. Notes Comput. Sci. 1450, 533–542.MathSciNetCrossRefGoogle Scholar
  16. 16.
    Ryl, I., Roos, Y., Clerbout, M. (1998) Generalized synchronization languages and commutations. Tech. Rep. IT-315, L.I.F.L., Univ. Lille 1.Google Scholar
  17. 17.
    Salomaa, A. (1973) Formal Languages. Academic Press, New York.MATHGoogle Scholar
  18. 18.
    Salomaa, K., Yu, S. (1998) Synchronization expressions with extended join operation. Theoret. Comput. Sci. 207, 73–88.MathSciNetMATHCrossRefGoogle Scholar
  19. 19.
    Sassone, V., Nielsen, M., Winskel, G. (1996) Models of concurrency: Towards a classification. Theoret. Comput. Sci. 170, 297–348.MathSciNetMATHGoogle Scholar
  20. 20.
    Yu, S. (1997) Regular languages. In: Handbook of Formal Languages, Vol. I. (Rozenberg, G., Salomaa, A. eds.) Springer-Verlag, 41–110.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1999

Authors and Affiliations

  • Kai Salomaa
  • Sheng Yu

There are no affiliations available

Personalised recommendations