Skip to main content
SpringerLink
Log in

Generalized synchronization languages

  • Conference paper
  • First Online:
Fundamentals of Computation Theory (FCT 1999)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 1684))

Included in the following conference series:

  • 378 Accesses

Abstract

Generalized synchronization languages are a model used to describe the behaviors of distributed applications whose synchronization constraints are expressed by generalized synchronization expressions — an extension of synchronization expressions. Generalized synchronization languages were conjectured by Salomaa and Yu to be characterized by a semi-commutation. We show that this semi-commutation characterizes the images of generalized synchronization languages by a morphism-like class of rational functions.

Topics. Automata and formal languages, theory of parallel and distributed computation.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 109.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Cori, R., Sopena, E., Latteux, M., and Roos, Y. 2-asynchronous automata. Theoretical Computer Science 61 (1988), 93–102.

    Article  MATH  MathSciNet  Google Scholar 

  2. De Simone, R. Langages infinitaires et produit de mixage. Theoretical Computer Science 31 (1984), 83–100.

    Article  MATH  MathSciNet  Google Scholar 

  3. Diekert, V., and Rozenberg, G., Eds. The Book of Traces. World Scientific, Singapore, 1995.

    Google Scholar 

  4. Diekert, V., Y. Mètivier, Partial Commutation and Traces. Handbook of Formal Languages (1997), 457–533.

    Google Scholar 

  5. Duboc, C.Commutations dans les Monoïdes libres: un Cadre Thèorique pour l’Ètude du Parallèlisme. PhD thesis, Universitè de Rouen, 1986.

    Google Scholar 

  6. Govindarajan, R., Guo, L., Yu, S., and Wang, P. ParC project: Practical constructs for parallel programming languages. In Proc. IEEE 15th Annual Internationnal Computer Software & Applications Conference (1991), pp. 183–189.

    Google Scholar 

  7. Mètivier, Y. Contribution à l’ètude des monoïdes de commutations. Thèse d’ètat, Universitè de Bordeaux I, 1987.

    Google Scholar 

  8. Roos, Y.Contribution à l’Ètude des Fonctions de Commutation Partielle. PhD thesis, Universitè des Sciences et Technologies de Lille, Lille, France, 1989.

    Google Scholar 

  9. Ryl, I., Roos, Y., and Clerbout, M. About synchronization languages. In Proc. MFCS’98 (Brno, Czech Republic, 1998), LNCS 1450, Springer-Verlag, Berlin, pp. 533–542.

    Google Scholar 

  10. Salomaa, K., and Yu, S. Synchronization expressions with extended join operation. Theoretical Computer Science 207 (1998), 73–88.

    Article  MATH  MathSciNet  Google Scholar 

  11. Sassone, V., Nielsen, M., and Winskel, G. Models for concurrency: Towards a classification. Theoretical Computer Science 170, 1-2 (1996), 297–348.

    MATH  MathSciNet  Google Scholar 

  12. van Glabbeck, R. J., and Vaandrager, F. The difference between splitting in n and n + 1. Information and Computation 136, 2 (1997), 109–142.

    Article  MathSciNet  Google Scholar 

  13. Zielonka, W. Notes on finite asynchronous automata. R.A.I.R.O. — Theoretical Informatics and Applications 21, 2 (1987), 99–135.

    MathSciNet  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. C.N.R.S. U.R.A. 369, L.I.F.L. Universitè de Lille I, Bât. M3, Citè Scientifique, 59655, Villeneuve d’Ascq Cedex, France

    Isabelle Ryl, Yves Roos & Mireille Clerbout

Authors
  1. Isabelle Ryl
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Yves Roos
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Mireille Clerbout
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Faculty of Computer Science, “A.I.Cuza” University, 6600, Iaşi, Romania

    Gabriel Ciobanu

  2. Institute of Mathematics of the Romanian Academy, P.O. Box 1-764, 70700, Bucharest, Romania

    Gheorghe Păun

Rights and permissions

Reprints and permissions

Copyright information

© 1999 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Ryl, I., Roos, Y., Clerbout, M. (1999). Generalized synchronization languages. In: Ciobanu, G., Păun, G. (eds) Fundamentals of Computation Theory. FCT 1999. Lecture Notes in Computer Science, vol 1684. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-48321-7_38

Download citation

  • DOI: https://doi.org/10.1007/3-540-48321-7_38

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-66412-3

  • Online ISBN: 978-3-540-48321-2

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation