Chapter

Unconventional Computation

Volume 3699 of the series Lecture Notes in Computer Science pp 157-168

On Formulations of Firing Squad Synchronization Problems

  • Kojiro KobayashiAffiliated withDepartment of Information Systems Science, Faculty of Engineering, Soka University
  • , Darin GoldsteinAffiliated withDepartment of Computer Engineering and Computer Science, California State University

* Final gross prices may vary according to local VAT.

Get Access

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.