Skip to main content
SpringerLink
Log in
Book cover

International Conference on Unconventional Computation

UC 2005: Unconventional Computation pp 157–168Cite as

On Formulations of Firing Squad Synchronization Problems

  • Conference paper

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 3699))

Abstract

We propose a novel formulation of the firing squad synchronization problem. In this formulation we may use more than one general state and the general state to be used is determined by the boundary condition of the general. We show that the usual formulation and the new formulation yield different minimum firing times for some variations of the problem. Our results suggest that the new formulation is more suited for the general theory of the firing squad synchronization problem.

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

Chapter
USD   29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD   39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Balzer, R.: An 8-state minimal time solution to the firing squad synchronization problem. Information and Control 10, 22–42 (1967)

    Article  Google Scholar 

  2. Berthiaume, A., Bittner, T., Perković, L., Settle, A., Simon, J.: Bounding the firing synchronization problem on a ring. Theoretical Computer Science 320, 213–228 (2004)

    Article  MATH  MathSciNet  Google Scholar 

  3. Culik, K.: Variations of the firing squad problem and applications. Information Processing Letters 30, 153–157 (1989)

    Article  MATH  MathSciNet  Google Scholar 

  4. Even, S., Litman, A., Winkler, P.: Computing with snakes in directed networks of automata. J. Algorithms 24(1), 158–170 (1997)

    Article  MATH  MathSciNet  Google Scholar 

  5. Goldstein, D., Kobayashi, K.: On the complexity of network synchronization. In: Fleischer, R., Trippen, G. (eds.) ISAAC 2004. LNCS, vol. 3341, pp. 496–507. Springer, Heidelberg (2004)

    Chapter  Google Scholar 

  6. Goldstein, D., Meyer, N.: The wake up and report problem is asymptotically time-equivalent to the firing squad synchronization problem. In: Proceedings of the Thirteenth Annual ACM-SIAM Symposium on Discrete Algorithms, San Francisco, CA, January 6-8, pp. 578–587 (2002)

    Google Scholar 

  7. Goto, E.: A minimal time solution of the firing squad problem. In: Course Notes for Applied Mathematics, vol. 298, pp. 52–59. Harvard University, Cambridge (1962)

    Google Scholar 

  8. Imai, K., Morita, K.: Firing squad synchronization problem in reversible cellular automata. Theoretical Computer Science 165, 475–482 (1996)

    Article  MATH  MathSciNet  Google Scholar 

  9. Kobayashi, K.: The firing squad synchronization problem for a class of polyautomata networks. J. Comput. Systems Sci. 17(3), 300–318 (1978)

    Article  MATH  Google Scholar 

  10. Kobayashi, K.: A minimal time solution to the firing squad synchronization problem of rings with one-way information flow. Tokyo Institute of Technology, Department of Information Sciences, Research Reports on Information Sciences, No. C-8 (September 1976)

    Google Scholar 

  11. Kobayashi, K.: On time optimal solutions of the firing squad synchronization problem for two-dimensional paths. Theoretical Computer Science 259, 129–143 (2001)

    Article  MATH  MathSciNet  Google Scholar 

  12. LaTorre, S., Napoli, M., Parente, M.: Synchronization of one-way connected processors. Complex Systems 10, 239–255 (1996)

    MathSciNet  Google Scholar 

  13. Mazoyer, J.: An overview of the firing squad synchronization problem. In: Choffrut, C. (ed.) LITP 1986. LNCS, vol. 316, pp. 82–94. Springer, Heidelberg (1986)

    Google Scholar 

  14. Moore, E.F.: Sequential Machines, Selected Papers. Addison Wesley, Reading (1962)

    Google Scholar 

  15. Moore, F.R., Langdon, G.G.: A generalized firing squad problem. Information and Control 12, 212–220 (1968)

    Article  MATH  Google Scholar 

  16. Nishitani, Y., Honda, N.: The firing squad synchronization problem for graphs. Theoretical Computer Science 14(1), 39–61 (1981)

    Article  MATH  MathSciNet  Google Scholar 

  17. Ostrovsky, R., Wilkerson, D.: Faster computation on directed networks of automata. In: Proceedings of the Fourteenth Annual ACM Symposium on Principles of Distributed Computing, Ottawa, Ontario, Canada, August 2-23, pp. 38–46 (1995)

    Google Scholar 

  18. Schmid, H., Worsch, T.: The firing squad synchronization problem with many generals for one-dimensional CA. In: 3rd IFIP International Conference on Theoretical Computer Science, pp. 111–124 (2004)

    Google Scholar 

  19. Shinahr, I.: Two- and three-dimensional firing-squad synchronization problem. Information and Control 24, 163–180 (1974)

    Article  MATH  MathSciNet  Google Scholar 

  20. Waksman, A.: An optimum solution to the firing squad synchronization problem. Information and Control 9, 66–78 (1966)

    Article  MATH  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Information Systems Science, Faculty of Engineering, Soka University, 1-236 Tangi-cho, Hachioji-shi, Tokyo, 192-8577, Japan

    Kojiro Kobayashi

  2. Department of Computer Engineering and Computer Science, California State University, Long Beach

    Darin Goldstein

Authors
  1. Kojiro Kobayashi
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Darin Goldstein
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Department of Computer Science, University of Auckland, New Zealand

    Cristian S. Calude

  2. Department of Computer Science, University of Auckland, Private Bag 92019, Auckland, New Zealand

    Michael J. Dinneen

  3. Institute of Mathematics of the Romanian Academy, PO Box 1-764, 014700, Bucureşti, Romania

    Gheorghe Păun

  4. Research Group on Natural Computing, Department of Computer Science and Artificial Intelligence, University of Seville, Avda. Reina Mercedes, 41012, Sevilla, Spain

    Mario J. Pérez-Jímenez

  5. Leiden Center of Advanced Computer Science (LIACS), Leiden University, Niels Bohrweg 1, 2333, Leiden, CA, The Netherlands

    Grzegorz Rozenberg

Rights and permissions

Reprints and permissions

Copyright information

© 2005 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Kobayashi, K., Goldstein, D. (2005). On Formulations of Firing Squad Synchronization Problems. In: Calude, C.S., Dinneen, M.J., Păun, G., Pérez-Jímenez, M.J., Rozenberg, G. (eds) Unconventional Computation. UC 2005. Lecture Notes in Computer Science, vol 3699. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11560319_15

Download citation

  • DOI: https://doi.org/10.1007/11560319_15

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-29100-8

  • Online ISBN: 978-3-540-32022-7

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation