Skip to main content
SpringerLink
Log in

A Transition Rule Set for the First 2-D Optimum-Time Synchronization Algorithm

  • Conference paper
Natural Computing

Part of the book series: Proceedings in Information and Communications Technology ((PICT,volume 2))

Abstract

The firing squad synchronization problem on cellular automata has been studied extensively for more than forty years, and a rich variety of synchronization algorithms have been proposed for two-dimensional cellular arrays. In the present paper, we reconstruct a real-coded transition rule set for an optimum-time synchronization algorithm proposed by Shinahr [11], known as the first optimum-time synchronization algorithm for two-dimensional rectangle arrays. Based on our computer simulation, it is shown that the proposed rule set consists of 28-state, 12849 transition rules and has a validity for the synchronization for any rectangle arrays of size m ×n such that 2 ≤ m, n ≤ 500.

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 84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 109.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

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. Beyer, W.T.: Recognition of topological invariants by iterative arrays. Ph.D. Thesis, p. 144. MIT (1969)

    Google Scholar 

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

    Google Scholar 

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

    Article  MathSciNet  MATH  Google Scholar 

  5. Minsky, M.: Computation: Finite and infinite machines, pp. 28–29. Prentice Hall, Englewood Cliffs (1967)

    MATH  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 (1964)

    Google Scholar 

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

    Article  MATH  Google Scholar 

  8. Nguyen, H.B., Hamacher, V.C.: Pattern synchronization in two-dimensional cellular space. Information and Control 26, 12–23 (1974)

    Article  MathSciNet  MATH  Google Scholar 

  9. Romani, F.: On the fast synchronization of tree connected networks. Information Sciences 12, 229–244 (1977)

    Article  MathSciNet  Google Scholar 

  10. Schmid, H.: Synchronisations probleme für zelluläre Automaten mit mehreren Generälen. Diplomarbeit, Universität Karsruhe (2003)

    Google Scholar 

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

    Article  MathSciNet  MATH  Google Scholar 

  12. Szwerinski, H.: Time-optimum solution of the firing-squad-synchronization-problem for n-dimensional rectangles with the general at an arbitrary position. Theoretical Computer Science 19, 305–320 (1982)

    Article  MathSciNet  MATH  Google Scholar 

  13. Umeo, H.: A simple design of time-efficient firing squad synchronization algorithms with fault-tolerance. IEICE Trans. on Information and Systems E87-D(3), 733–739 (2004)

    Google Scholar 

  14. Umeo, H., Ishida, K., Tachibana, K., Kamikawa, N.: A construction of real-coded transition rule set for Shinahr’s optimum-time synchronization algorithm on two-dimensional cellular arrays. draft, pp. 1–80 (2008)

    Google Scholar 

  15. Umeo, H.: Synchronization algorithms for two-dimensional cellular automata. Journal of Cellular Automata 4, 1–20 (2008)

    MathSciNet  Google Scholar 

  16. 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, Heidelberg (2009)

    Google Scholar 

  17. Umeo, H., Maeda, M., Hisaoka, M., Teraoka, M.: A state-efficient mapping scheme for designing two-dimensional firing squad synchronization algorithms. Fundamenta Informaticae 74(4), 603–623 (2006)

    MathSciNet  MATH  Google Scholar 

  18. Umeo, H., Uchino, H.: A new time-optimum synchronization algorithm for rectangle arrays. Fundamenta Informaticae 87(2), 155–164 (2008)

    MathSciNet  MATH  Google Scholar 

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

    Article  MathSciNet  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

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

    Hiroshi Umeo, Kaori Ishida, Koutarou Tachibana & Naoki Kamikawa

Authors
  1. Hiroshi Umeo
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Kaori Ishida
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Koutarou Tachibana
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. Naoki Kamikawa
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. National Institute of Information and Communications Technology, Japan

    F. Peper

  2. Osaka Electro-Communications University, Japan

    H. Umeo

  3. University of Hyogo, Japan

    N. Matsui  & T. Isokawa  & 

Rights and permissions

Reprints and permissions

Copyright information

© 2010 Springer Tokyo

About this paper

Cite this paper

Umeo, H., Ishida, K., Tachibana, K., Kamikawa, N. (2010). A Transition Rule Set for the First 2-D Optimum-Time Synchronization Algorithm. In: Peper, F., Umeo, H., Matsui, N., Isokawa, T. (eds) Natural Computing. Proceedings in Information and Communications Technology, vol 2. Springer, Tokyo. https://doi.org/10.1007/978-4-431-53868-4_38

Download citation

  • DOI: https://doi.org/10.1007/978-4-431-53868-4_38

  • Publisher Name: Springer, Tokyo

  • Print ISBN: 978-4-431-53867-7

  • Online ISBN: 978-4-431-53868-4

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation