Skip to main content
SpringerLink
Log in

On the equivalence of synchronization sets

  • Language Theory
  • Conference paper
  • First Online:
CAAP '86 (CAAP 1986)

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

Included in the following conference series:

Abstract

In the framework of the description of processes behaviours by words and languages, conditions of synchronization can be expressed by the means of regular sets. Two problems about such synchronization sets are studied here: the decidability of the equivalence of two of them and the obtention of minimal ones.

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

Access this chapter

Log in via an institution

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. ARNOLD A. et NIVAT M., Comportements de processus, LITP Report no 82–12, Univ. Paris VII, 1982.

    Google Scholar 

  2. BEAUQUIER J. et NIVAT M., Application of formal language theory to problems of security and synchronization, in Formal Language Theory, Perspectives and Open Problems, R.V. BOOK (ed.), Academic Press, 407–453.

    Google Scholar 

  3. BERSTEL J., Transductions and context-free languages, Teubner Verlag, 1979.

    Google Scholar 

  4. GINSBURG S., Algebraic and Automata-Theoretic Properties of Formal Languages, North-Holland, 1975.

    Google Scholar 

  5. GOLDSTIEN J., Substitution and bounded languages, J. of Comput. and Syst. Sci. 6, 9–29, 1972.

    Google Scholar 

  6. GIFFORD D. and SPECTOR A., The Space Shuttle Primary Computer System, Commun. ACM, 27, 9, 872–900, 1984.

    Google Scholar 

  7. LATTEUX M., Cônes rationnels commutatifs, J. of Comput. and Syst. Sci. 18, 307–333, 1979.

    Google Scholar 

  8. NIVAT M., Behaviours of synchronized systems of processes, LITP Report no81–64, Univ. Paris VII, 1981.

    Google Scholar 

  9. OGDEN W., A Helpful Result for Proving Inherent Ambiguity, Math. System Theory 2, 191–194, 1967.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Centre d'Orsay, Université de Paris Sud, LRI Bât. 490, 91405, Orsay Cedex, France

    J. Beauquier & B. Bérard

Authors
  1. J. Beauquier
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. B. Bérard
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Paul Franchi-Zannettacci

Rights and permissions

Reprints and permissions

Copyright information

© 1986 Springer-Verlag

About this paper

Cite this paper

Beauquier, J., Bérard, B. (1986). On the equivalence of synchronization sets. In: Franchi-Zannettacci, P. (eds) CAAP '86. CAAP 1986. Lecture Notes in Computer Science, vol 214. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0022656

Download citation

  • DOI: https://doi.org/10.1007/BFb0022656

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-16443-2

  • Online ISBN: 978-3-540-39783-0

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation