Bounding the firing synchronization problem on a ring

  • Authors:

  • André Berthiaume;Todd Bittner;Ljubomir Perković;Amber Settle;Janos Simon

  • Affiliations:

  • Telecommunications and Information Systems, School of Computer Science, DePaul University, 243 S. Wabash, Chicago, IL;Telecommunications and Information Systems, School of Computer Science, DePaul University, 243 S. Wabash, Chicago, IL;Telecommunications and Information Systems, School of Computer Science, DePaul University, 243 S. Wabash, Chicago, IL;Telecommunications and Information Systems, School of Computer Science, DePaul University, 243 S. Wabash, Chicago, IL;University of Chicago, Department of Computer Science, 1100 E. 58th Street, Chicago, IL

  • Venue:
  • Theoretical Computer Science
  • Year:
  • 2004

Quantified Score

Hi-index 5.23

Visualization

Abstract

In this paper we improve the upper and lower bounds on the complexity of solutions to the firing synchronization problem on a ring. In this variant of the firing synchronization problem the goal is to synchronize a ring of identical finite automata. Initially, all automata are in the same state except for one automaton that is designated as the initiator for the synchronization. The goal is to define the set of states and the transition function for the automata so that all machines enter a special fire state for the first time and simultaneously during the final round of the computation. In our work we present two solutions to the ring firing synchronization problem, an 8-state minimal-time solution and a 6-state non-minimal-time solution. Both solutions use fewer states than the previous best-known minimal-time automaton, a 16-state solution due to Culik. We also give the first lower bounds on the number of states needed for solutions to the ring firing synchronization problem. We show that there is no 3-state solution and no 4-state, symmetric, minimal-time solution for the ring.