Skip to main content
SpringerLink
Log in

An overview of the firing squad synchronization problem

  • Conference paper
  • First Online:
Automata Networks (LITP 1986)

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

Included in the following conference series:

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.

4 Bibliography

  1. R. BALZER "Studies concerning minimal time solutions to the firing squad synchronization problem". Doctoral thesis. Carnegie Institute of Technology. Pittsburg (1966).

    Google Scholar 

  2. R. BALZER "An 8-states minimal time solution to the firing squad synchronization problem", Information and Control10, pp 22–42 (1967).

    Google Scholar 

  3. J. BERSTEL "Quelques applications des réseaux d'automates à des problèmes de la théorie des graphes". Thèse de 3ième cycle. Faculté des sciences de Paris (1967).

    Google Scholar 

  4. P.C. FISHER "Generation of primes by a one-dimensionnal real-time Iterative Array". Journal A.C.M.12, no 3, pp 388–394 (1965).

    Google Scholar 

  5. G.T. HERMAN Models for cellular interactions in development without polarity of individual cells: Il problems of synchronization and regulation". Int. J. Systems Vol 3, no 2, pp 149–175 (1972).

    Google Scholar 

  6. G.T. HERMAN-W. LIU "The daughter of CELIA, the French Flag and the Firing Squad". Simulation 21, pp 33–42 (1973).

    Google Scholar 

  7. G.T. HERMAN-W. LIU-S. ROWLAND-A. WALKER "Synchronization of growing cellular automata". Information and Control 25, pp 103–122 (1974).

    Google Scholar 

  8. A. GRASSELLI "Synchronization of cellular arrays: The firing squad problem in two dimensions". Information and Control 28, pp 113–124 (1975).

    Google Scholar 

  9. K. KOBAYASHI "The firing squad synchronization problem for two dimensionnal arrays". Information and Control 34, pp 177–197 (1977).

    Google Scholar 

  10. K. KOBAYASHI "On the minimal firing time of the firing squad synchronization problem for polyautomata networks". Theorical Computer Science 7, pp 149–167 (1978).

    Google Scholar 

  11. K. KOBAYASHI "The firing squad synchronization problem for a class of polyautomata networks". Journal of computer and system sciences 17, pp300–318 (1978).

    Google Scholar 

  12. V.I. LEVENSTEIN "Ob odnom metode reshenija zadachi sinkhronizatsii tsepi avtomatov za minimalnoe vremja". Problemy Peredachi Informatsii 1, 4 (1965).

    Google Scholar 

  13. J. MAZOYER "A six states minimal time solution to the firing squad synchronization problem". Thèse de Diplome de doctorat (1986) Université LYON 1.

    Google Scholar 

  14. J. MAZOYER "Solutions à coupures périodiques itérées du firing squad". To appear(1986).

    Google Scholar 

  15. J. MAZOYER "Solutions en temps minimal au firing squad avec un seul bit d'information échangé entre les cellules". To appear(1986).

    Google Scholar 

  16. M. MINSKY "Finite and infinite machines". Prentice Hall pp 28–29 et 282–283 (1967).

    Google Scholar 

  17. E.F. MOORE "Sequential machines, Selected papers". Addison Wesley Reading Mass." pp 213–214 (1964).

    Google Scholar 

  18. F.R. MOORE-G.G. LANGDON "A generalized firing sqad problem". Information and Control 12, pp 212–220 (1968).

    Google Scholar 

  19. Y. NISHITANI-N. HONDA "The firing squad synchronization problem". 1966 Research group on "Polyautomata, their structure and functions" pp 158–188 (1977).

    Google Scholar 

  20. F. ROMANI "Cellular automata synchronization". Information Sciences 10, pp 299–318 (1976).

    Google Scholar 

  21. P. ROSENSTIEHL "Existence d'automates capables de s'accorder bien qu'arbitrairement connectés et nombreux". International Computation Center Bull5, pp 245–261 (1966)

    Google Scholar 

  22. P. ROSENSTIEHL-J.R. FIKSEL-A. HOLLIGER "Intelligent graphs: networks of finite automata capable of solving graph problems". Graph Theory and Computing (R.C. Read Ed) Academic Press. New-York pp 219–265 (1972)

    Google Scholar 

  23. I. SHINAHR "Two and three dimensionnal firing squad synchronization problems". Information and Control 24, pp 163–180 (1974).

    Google Scholar 

  24. H. SZWERINSKI "Zellularautomaten mit symmetrisher lokaler transformation". Ph.D.Thesis. Braunschweig (1982).

    Google Scholar 

  25. H. SZWERINSKI "Time optimal solution of the firing squad synchronization problem for n-dimensional rectangles with the general at an arbitrary position". Theoretical Computer Ssience 19, pp 305–320 (1982).

    Google Scholar 

  26. H. SZWERINSKI "Symmetrical one-dimensional cellular spaces". Information and Control 67, pp 163–172 (1985).

    Google Scholar 

  27. V.I. VASKHAVSKY-V.B. MARAKHOVSKY-V.A. PESCHANSKY "Synchronization of interacting automata". Mathematical Systems Theory 14, no 3 pp 212–230 (1969).

    Google Scholar 

  28. A. WAKSMAN "An optimum solution to the firing squad synchronization problem". Information and Control 9, pp 66–78 (1966).

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Université Lyon 1, France

    J. Mazoyer

Authors
  1. J. Mazoyer
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

C. Choffrut

Rights and permissions

Reprints and permissions

Copyright information

© 1988 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Mazoyer, J. (1988). An overview of the firing squad synchronization problem. In: Choffrut, C. (eds) Automata Networks. LITP 1986. Lecture Notes in Computer Science, vol 316. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-19444-4_16

Download citation

  • DOI: https://doi.org/10.1007/3-540-19444-4_16

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-19444-6

  • Online ISBN: 978-3-540-39270-5

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation