Advertisement

On the equivalence of synchronization sets

  • J. Beauquier
  • B. Bérard
Language Theory
Part of the Lecture Notes in Computer Science book series (LNCS, volume 214)

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.

Keywords

Mutual Exclusion Regular Language Finite Automaton Space Shuttle Deterministic Finite Automaton 
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.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. [1]
    ARNOLD A. et NIVAT M., Comportements de processus, LITP Report no 82–12, Univ. Paris VII, 1982.Google Scholar
  2. [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. [3]
    BERSTEL J., Transductions and context-free languages, Teubner Verlag, 1979.Google Scholar
  4. [4]
    GINSBURG S., Algebraic and Automata-Theoretic Properties of Formal Languages, North-Holland, 1975.Google Scholar
  5. [5]
    GOLDSTIEN J., Substitution and bounded languages, J. of Comput. and Syst. Sci. 6, 9–29, 1972.Google Scholar
  6. [6]
    GIFFORD D. and SPECTOR A., The Space Shuttle Primary Computer System, Commun. ACM, 27, 9, 872–900, 1984.Google Scholar
  7. [7]
    LATTEUX M., Cônes rationnels commutatifs, J. of Comput. and Syst. Sci. 18, 307–333, 1979.Google Scholar
  8. [8]
    NIVAT M., Behaviours of synchronized systems of processes, LITP Report no81–64, Univ. Paris VII, 1981.Google Scholar
  9. [9]
    OGDEN W., A Helpful Result for Proving Inherent Ambiguity, Math. System Theory 2, 191–194, 1967.Google Scholar

Copyright information

© Springer-Verlag 1986

Authors and Affiliations

  • J. Beauquier
    • 1
  • B. Bérard
    • 1
  1. 1.Centre d'OrsayUniversité de Paris SudOrsay CedexFrance

Personalised recommendations