The firing squad synchronization problem for graphs
Yasuaki Nishitani,Namio Honda +1 more
Reads0
Chats0
TLDR
The solution of the Firing Squad Synchronization Problem for graphs is given and the synchronization time is proportional to the radius rG of a graph, which is minimum for an infinite number of graphs.About:
This article is published in Theoretical Computer Science.The article was published on 1981-01-01 and is currently open access. It has received 40 citations till now. The article focuses on the topics: Firing squad synchronization problem & Indifference graph.read more
Citations
More filters
Journal ArticleDOI
Synchronized Distributed Termination
TL;DR: An efficient decentralized algorithm for synchronized termination of a distributed computation is presented, it is assumed that distributed processes are connected via unidirectional channels into a strongly connected network, in which no central controller exists.
Journal ArticleDOI
Bounding the firing synchronization problem on a ring
TL;DR: This work presents two solutions to the ring firing synchronization problem, an 8-state minimal- time solution and a 6-state non-minimal-time solution that uses fewer states than the previous best-known minimal-time automaton, a 16-state solution due to Culik.
Journal ArticleDOI
Smaller solutions for the firing squad
Amber Settle,Janos Simon +1 more
TL;DR: This work improves the construction for the best known minimal-time solution to the generalized problem by reducing the number of states needed and gives non-minimal-time solutions to the original and generalized problem that use fewer states than the corresponding minimal- time solutions.
Proceedings ArticleDOI
Faster computation on directed networks of automata
TL;DR: Direct strongly-connected networks may exist a one-way communication link between two processors without a link in the opposite direction, which occurs in radio networks and in VLSI circuits and also arises in hi- Directional networks where one direction of a hi-directional link has failed.
References
More filters
Journal ArticleDOI
An optimum solution to the firing squad synchronization problem
TL;DR: It is shown that when given an arbitrarily long array of such machines and a command is given at one end at t = 0, it is possible to cause all the machines to go to one terminal state, all at once, at time t = 2n − 2 where n is the number of machines in the array.
Journal ArticleDOI
An 8-state minimal time solution to the firing squad synchronization problem*°
TL;DR: The verification of this minimal time solution to the Firing Squad Synchronization Problem by computer simulation is discussed, and the schema for the mathematical induction proof that the solution works for any length is given.
Book ChapterDOI
Intelligent graphs: networks of finite automata capable of solving graph problems
TL;DR: This chapter discusses intelligent graphs; networks of finite automata, which is capable of solving graph problems, and the title, intelligent graphs is obtained.
Journal ArticleDOI
A generalized firing squad problem
F. R. Moore,Glen G. Langdon +1 more
TL;DR: This article presents a generalization of the Firing Squad Synchronization Problem in which the General may be any soldier and a seventeen-state minimum time solution is given.