On the Complexity of the “Most General” Firing Squad Synchronization Problem

2006 ◽  
pp. 696-711 ◽  
Author(s):  
Darin Goldstein ◽  
Kojiro Kobayashi
Keyword(s):  
Synchronization Problem ◽  
Firing Squad ◽  
Firing Squad Synchronization Problem ◽  
Firing Squad Synchronization

scholarly journals The firing squad synchronization problem with sub-generals

2014 ◽  
Vol 114 (1-2) ◽  
pp. 60-65
Author(s):  
Kazuya Yamashita ◽  
Yasuaki Nishitani ◽  
Sadaki Hirose ◽  
Satoshi Okawa ◽  
Nobuyasu Osato
Keyword(s):  
Synchronization Problem ◽  
Firing Squad ◽  
Firing Squad Synchronization Problem ◽  
Firing Squad Synchronization

SYNCHRONIZATION OF TWO INTERACTING FINITE AUTOMATA

1995 ◽  
Vol 05 (03) ◽  
pp. 289-308 ◽  
Author(s):  
JACQUES MAZOYER
Keyword(s):  
State Transition ◽  
Finite Automata ◽  
Optimal Solution ◽  
Synchronization Problem ◽  
Firing Squad ◽  
Firing Squad Synchronization Problem ◽  
Firing Squad Synchronization

The Firing Squad Synchronization Problem with non uniform delays was recently solved by T. Jiang. In this paper, we study a very particular case: the synchronization of two finite automata. Two finite automata communicates, but the delay of communication is great in comparison with the duration of a state transition. We show that there exist solutions in time 2Δ(⌈ log m Δ⌉)+Δ (for any natural m). This implies that there does not exist an optimal solution (in the sense of K. Kobayashi) to the Firing Squad with non uniform delays. We show also that if the communication between the two automata are not symmetric the synchronization cannot be obtained.

Sign in / Sign up

Export Citation Format

Share Document