Advertisement

Modular constructions of distributing automata

  • Sébastien Huguet
  • Antoine Petit
Contributed Papers Concurrency
Part of the Lecture Notes in Computer Science book series (LNCS, volume 969)

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. [Bau92]
    S. Bauget. Reconnaissabilité de l'itération d'un langage connexe dans le monoÏde des traces. Technical report, Institut Blaise Pascal, Université Paris VI, 1992.Google Scholar
  2. [Ber79]
    J. Berstel. Transductions and context free langages. Teubner Studienbucher Informatik, 1979.Google Scholar
  3. [Cér92]
    C. Cérin. Applications de la théorie des traces à la mesure et l'implantation d'algorithmes de distribution. PhD thesis, Université Paris-Sud, France, 1992.Google Scholar
  4. [CF69]
    P. Cartier and D. Foata. Problèmes combinatoires de commutation et réarrangements. Lecture Notes in Mathematics, 85, Springer 1969.Google Scholar
  5. [CMZ93]
    R. Cori, Y. Métivier, and W. Zielonka. Asynchronous mappings and asynchronous cellular automata. Information and computation, 2(106):159–202, 1993.Google Scholar
  6. [CP85]
    R. Cori and D. Perrin. Automates et commutations partielles. RAIRO Theor. Inf. Appl., 19:21–32, 1985.Google Scholar
  7. [DR95]
    V. Diekert and G. Rozenberg. Book of traces. World scientific, Singapore, 1995.Google Scholar
  8. [HP95]
    S. Huguet and A. Petit. Modular constructions of distributing automata. Technical report, LIFAC, ENS-Cachan, France, 1995.Google Scholar
  9. [HU79]
    J.E. Hopcroft and J.D. Ullman. Introduction to automata theory, languages and computation. Addison Wesley, Reading, MA, 1979.Google Scholar
  10. [Hug95]
    S. Huguet. Le non-déterminisme dans les automates distribuants. Technical report, LIFAC, ENS-Cachan, France, 1995.Google Scholar
  11. [KMS94]
    N. Klarlund, M. Mukund, and M. Sohoni. Determinized asynchronous automata. Proceedings of ICALP'94, LNCS 820, pages 130–141, 1994.Google Scholar
  12. [Maz77]
    A. Mazurkiewicz. Concurrent program schemes and their interpretations. Technical report, DAIMI, Aarhus University, 1977. Rep. PB-78.Google Scholar
  13. [Mét86]
    Y. Métivier. Une condition suffisante de reconnaissabilité dans un monoÏde partiellement commutatif. RAIRO Theor. Inf. Appl., 20(2):121–127, 1986.Google Scholar
  14. [Mus94]
    A. Muscholl. On the complementation of büchi asynchronous cellular automata. Proceedings of ICALP'94, LNCS 820, pages 142–153, 1994.Google Scholar
  15. [Och85]
    E. Ochmański. Regular behaviour of concurrent systems. EATCS Bulletin, 27:56–67, 1985.Google Scholar
  16. [Per89]
    D. Perrin. Partial commutation. Proceedings of ICALP'89, LNCS 372, pages 637–651, 1989.Google Scholar
  17. [Pet93]
    A. Petit. Recognizable trace langages, distributed automata and the distribution problem. Acta Information, 30:89–101, 1993.Google Scholar
  18. [Pig93]
    G. Pighizzini. Synthesis of nondeterministic asynchronous automata. In Semantic of Programming Languages and Model Theory, pages 109–126. Algebra, Logic and Applications, vol 5, Gordon and Breach Science, 1993.Google Scholar
  19. [Zie87]
    W. Zielonka. Notes on finite asynchronous automata and trace langages. RAIRO Theor. Inf. Appl., 21:99–135, 1987.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1995

Authors and Affiliations

  • Sébastien Huguet
    • 1
  • Antoine Petit
    • 1
  1. 1.LIFACEcole Normale Supérieure de CachanCachan CedexFrance

Personalised recommendations