Skip to main content
SpringerLink
Log in

A Class of Minimum-Time Minimum-State-Change Generalized FSSP Algorithms

  • Conference paper
  • First Online:
Cellular Automata (ACRI 2016)

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

Included in the following conference series:

Abstract

The firing squad synchronization problem (FSSP, for short) on cellular automata has been studied extensively for more than fifty years, and a rich variety of FSSP algorithms has been proposed. Here we consider the FSSP from a view point of state-change-complexity that models the energy consumption of SRAM-type storage with which cellular automata might be built. In the present paper, we propose a class of minimum-time, minimum-state-change generalized FSSP (GFSSP, for short) algorithms for synchronizing any one-dimensional (1D) cellular automaton, where the synchronization operations are started from any cell in the array. We construct two minimum-time minimum-state-change GFSSP algorithms: one is based on Goto’s algorithm, known as the first minimum-time FSSP algorithm that is reconstructed again recently in Umeo et al. [13], and the other is based on Gerken’s one. These algorithms are optimum not only in time but also in state-change complexity.

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

Access this chapter

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 EPUB and 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

Institutional subscriptions

References

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

    Article  Google Scholar 

  2. Gerken, H.D.: Über Synchronisationsprobleme bei Zellularautomaten. Diplomarbeit, Institut für Theoretische Informatik, Technische Universität Braunschweig, p. 50 (1987)

    Google Scholar 

  3. Goto, E.: A minimal time solution of the firing squad problem. Dittoed course notes for Applied Mathematics 298, Harvard University, pp. 52–59 (1962)

    Google Scholar 

  4. Mazoyer, J.: A six-state minimal time solution to the firing squad synchronization problem. Theoret. Comput. Sci. 50, 183–238 (1987)

    Article  MathSciNet  MATH  Google Scholar 

  5. Mazoyer, J.: A minimal-time solution to the FSSP without recursive call to itself and with bounded slope of signals. Unpublished draft version, pp. 1–25 (1997)

    Google Scholar 

  6. Moore, E.F.: The firing squad synchronization problem. In: Moore, E.F. (ed.) Sequential Machines, Selected Papers, pp. 213–214. Addison-Wesley, Reading MA (1964)

    Google Scholar 

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

    Article  MATH  Google Scholar 

  8. Schmid, H., Worsch, T.: The firing squad synchronization problem with many generals for one-dimensional CA. In: Proceedings of IFIP World Congress, pp. 111–124 (2004)

    Google Scholar 

  9. Umeo, H.: A note on firing squad synchronization algorithms - a reconstruction of Goto’s first-in-the-world optimum-time firing squad synchronization algorithm. In: Kutrib, M., Worsch, T. (eds.) Proceedings of IFIP Cellular Automata Workshop. 1996, Schloss Rauischholzhausen, Giessen, Germany, p. 65 (1996)

    Google Scholar 

  10. Umeo, H.: A simple design of time-efficient firing squad synchronization algorithms with fault-tolerance. IEICE Trans. Inf. Syst. E87-D(3), 733–739 (2011)

    Google Scholar 

  11. Umeo, H.: Firing squad synchronization problem in cellular automata. In: Meyers, R.A. (ed.) Encyclopedia of Complexity and System Science, vol. 4, pp. 3537–3574. Springer, New York (2009)

    Chapter  Google Scholar 

  12. Umeo, H., Kamikawa, N., Nishioka, K., Akiguchi, S.: Generalized firing squad synchronization protocols for one-dimensional cellular automata - a survey. Acta Phys. Pol. B, Proc. Suppl. 3, 267–289 (2010)

    Google Scholar 

  13. Umeo, H., Hirota, M., Nozaki, Y., Imai, K., Sogabe, T.: A reconstruction of Goto’s FSSP algorithm (2016, draft in submission)

    Google Scholar 

  14. Umeo, H., Imai, K., Sousa, A.: A Generalized Minimum-Time Minimum-State-Change FSSP Algorithm. In: Dediu, A.-H., Magdalena, L., Martín-Vide, C. (eds.) TPNC 2015. LNCS, vol. 9477, pp. 161–173. Springer, Switzerland (2015). doi:10.1007/978-3-319-26841-5_13

    Chapter  Google Scholar 

  15. Vollmar, R.: Some remarks about the efficiency of polyautomata. Inter. J. Theoret. Phys. 21(12), 1007–1015 (1982)

    Article  MathSciNet  MATH  Google Scholar 

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

    Article  MathSciNet  MATH  Google Scholar 

  17. Yunès, J.B.: Goto’s construction and Pascal’s triangle: new insights into cellular automata synchronization. Proceedings of JAC 2008, 195–203 (2008)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. University of Osaka Electro-Communication, Hastu-cho, 18-8, Neyagawa-shi, Osaka, 572-8530, Japan

    Hiroshi Umeo & Keisuke Imai

Authors
  1. Hiroshi Umeo
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Keisuke Imai
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Hiroshi Umeo .

Editor information

Editors and Affiliations

  1. University of Perpignan, Perpignan, France

    Samira El Yacoubi

  2. AGH University of Science and Techn, Kraków, Poland

    Jaroslaw Wąs

  3. Department of Computer Science, University of Milano-Bicocca, Milan, Italy

    Stefania Bandini

Rights and permissions

Reprints and permissions

Copyright information

© 2016 Springer International Publishing Switzerland

About this paper

Cite this paper

Umeo, H., Imai, K. (2016). A Class of Minimum-Time Minimum-State-Change Generalized FSSP Algorithms. In: El Yacoubi, S., Wąs, J., Bandini, S. (eds) Cellular Automata. ACRI 2016. Lecture Notes in Computer Science(), vol 9863. Springer, Cham. https://doi.org/10.1007/978-3-319-44365-2_14

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-44365-2_14

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-319-44364-5

  • Online ISBN: 978-3-319-44365-2

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation