Skip to main content
SpringerLink
Log in

Modular constructions of distributing automata

  • Contributed Papers
  • Conference paper
  • First Online:
Mathematical Foundations of Computer Science 1995 (MFCS 1995)

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

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. 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. J. Berstel. Transductions and context free langages. Teubner Studienbucher Informatik, 1979.

    Google Scholar 

  3. 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. P. Cartier and D. Foata. Problèmes combinatoires de commutation et réarrangements. Lecture Notes in Mathematics, 85, Springer 1969.

    Google Scholar 

  5. 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. R. Cori and D. Perrin. Automates et commutations partielles. RAIRO Theor. Inf. Appl., 19:21–32, 1985.

    Google Scholar 

  7. V. Diekert and G. Rozenberg. Book of traces. World scientific, Singapore, 1995.

    Google Scholar 

  8. S. Huguet and A. Petit. Modular constructions of distributing automata. Technical report, LIFAC, ENS-Cachan, France, 1995.

    Google Scholar 

  9. J.E. Hopcroft and J.D. Ullman. Introduction to automata theory, languages and computation. Addison Wesley, Reading, MA, 1979.

    Google Scholar 

  10. S. Huguet. Le non-déterminisme dans les automates distribuants. Technical report, LIFAC, ENS-Cachan, France, 1995.

    Google Scholar 

  11. N. Klarlund, M. Mukund, and M. Sohoni. Determinized asynchronous automata. Proceedings of ICALP'94, LNCS 820, pages 130–141, 1994.

    Google Scholar 

  12. A. Mazurkiewicz. Concurrent program schemes and their interpretations. Technical report, DAIMI, Aarhus University, 1977. Rep. PB-78.

    Google Scholar 

  13. 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. A. Muscholl. On the complementation of büchi asynchronous cellular automata. Proceedings of ICALP'94, LNCS 820, pages 142–153, 1994.

    Google Scholar 

  15. E. Ochmański. Regular behaviour of concurrent systems. EATCS Bulletin, 27:56–67, 1985.

    Google Scholar 

  16. D. Perrin. Partial commutation. Proceedings of ICALP'89, LNCS 372, pages 637–651, 1989.

    Google Scholar 

  17. A. Petit. Recognizable trace langages, distributed automata and the distribution problem. Acta Information, 30:89–101, 1993.

    Google Scholar 

  18. 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. W. Zielonka. Notes on finite asynchronous automata and trace langages. RAIRO Theor. Inf. Appl., 21:99–135, 1987.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. LIFAC, Ecole Normale Supérieure de Cachan, 61, Avenue du président Wilson, 94235, Cachan Cedex, France

    Sébastien Huguet & Antoine Petit

Authors
  1. Sébastien Huguet
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Antoine Petit
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Jiří Wiedermann Petr Hájek

Rights and permissions

Reprints and permissions

Copyright information

© 1995 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Huguet, S., Petit, A. (1995). Modular constructions of distributing automata. In: Wiedermann, J., Hájek, P. (eds) Mathematical Foundations of Computer Science 1995. MFCS 1995. Lecture Notes in Computer Science, vol 969. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-60246-1_152

Download citation

  • DOI: https://doi.org/10.1007/3-540-60246-1_152

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-60246-0

  • Online ISBN: 978-3-540-44768-9

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation