The synchronization of nonuniform networks of finite automata

Authors:
T. Jiang
Affiliations:
Dept. of Comput. Sci.&Syst., McMaster Univ., Hamilton, Ont., Canada
Venue:
SFCS '89 Proceedings of the 30th Annual Symposium on Foundations of Computer Science
Year:
1989

Citing 0
Cited 2

On the complexity of the “most general” firing squad synchronization problem

STACS'06 Proceedings of the 23rd Annual conference on Theoretical Aspects of Computer Science
On the complexity of network synchronization

ISAAC'04 Proceedings of the 15th international conference on Algorithms and Computation

Quantified Score

Hi-index	0.00

Visualization

Abstract

The generalized firing squad synchronization problem (GFSSP) is the well-known firing squad synchronization problem extended to arbitrarily connected networks of finite automata. When the transmission delays associated with the links of a network are allowed to be arbitrary nonnegative integers, the problem is called GFSSP-NUD (GFSSP with nonuniform delays). A solution of GFSSP-NUD is given for the first time. The solution is independent of the structure of the network and the actual delays of the links. The firing time of the solution is bounded by O( Delta /sup 3/+ tau /sub max/), where tau /sub max/ is the maximum transmission delay of any single link and Delta is the maximum transmission delay between the general and any other node of a given network. Extensions of GFSSP and GFSSP-NUD to networks with more than one general are presented.