UC 2005: Unconventional Computation pp 157-168

On Formulations of Firing Squad Synchronization Problems

  • Kojiro Kobayashi
  • Darin Goldstein
Part of the Lecture Notes in Computer Science book series (LNCS, 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.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer-Verlag Berlin Heidelberg 2005

Authors and Affiliations

  • Kojiro Kobayashi
    • 1
  • Darin Goldstein
    • 2
  1. 1.Department of Information Systems Science, Faculty of EngineeringSoka UniversityHachioji-shi, TokyoJapan
  2. 2.Department of Computer Engineering and Computer ScienceCalifornia State UniversityLong Beach

Personalised recommendations