A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is
This article presents a generalization of the Firing Squad Synchronization Problem in which the General may be any soldier. A seventeen-state minimum time solution is given. ... Hamacher for many stimulating discussions on this and other generalizations to the Firing Squad Problem. RECEIVED: June 21, 1967. ... ACKNOWLEDGMENTS The authors would like to thank Professor M. K. Hu for his encouragement and advice, and their colleague V. C. ...doi:10.1016/s0019-9958(68)90309-4 fatcat:g4htvdqj3va5hivh6f73kmy5wy
The firing squad synchronization problem, or fssp, requires that a network of automata, limited to finite memory and local communications only, cooperate in a global task. ... In addition, we address the question, to what extent can solutions to the fssp for subnetworks contribute to the overall solution? ... ACKNOWLEDGMENTS The author thanks Robert P. Daley for his help and encouragement, and Patrick C. Fischer for his comments on an early version of this paper. ...doi:10.1016/0022-0000(83)90025-9 fatcat:vuoswmfqfraendw3mhaif673a4
Earlier solution times have been quadratic in m, where m is the edge length of the smallest square enclosing the pattern. A linear solution is formulated. ... This paper presents an algorithm for synchronizing (firing) an arbitrary, finite, connected pattern of cells in a potentially infinite two-dimensional grid of identical finite state cells. ... The historical background to the problem appears in Moore (1964) , and a concise review of both the problem and its first efficient, minimum-time solution (due to Waksman, 1966) appears in Moore and ...doi:10.1016/s0019-9958(74)90687-1 fatcat:3zpnugoheff6pozcw74c6fya6u
tn this paper, we give a solution of the Firing Squad Synchronization Problem for graphs. ... T~e synchronization time of our solution is proport[onal to the radius rG of a graph G (3re; + 1 or 3rG time units), where rG is the longest distance between the general and any other node of G. ... Kobayashi in Tokyo Institute of Technology for his helpful suggestions by ~,hich the (4r)-solution is improved to the (3r + 1)-solution and also for his useful comments about the presentation of this paper ...doi:10.1016/0304-3975(81)90004-9 fatcat:d2qt7h3lujfoxcc633rjfi5szq
Summary: “The firing squad synchronization problem for two- dimensional paths (2-Path FSSP, for short) is a variation of the firing squad synchronization problem where finite automata are placed along ... Barvinok (1-MI, Ann Arbor, MI) 2002c:68035 68Q25 68Q80 Kobayashi, Kojiro On time optimal solutions of the firing squad synchronization problem for two-dimensional paths. (English summary) Theoret. ...
We studied the Firing Squad Synchronization Problem (FSSP) on reversible (i.e., backward deterministic) cellular automata (RCA). ... We showed that Minsky's solution in time 3n can be embedded in an RCA with 99 states that satisfies the new condition. ... Introduction The Firing Squad Synchronization Problem (FSSP) was first devised by Myhill and was introduced by Moore  . ...doi:10.1016/0304-3975(96)00016-3 fatcat:chjdj3osizdd7lhfywwckd3acu
EGOTO A minimum time solution of the firing squad problem Dittoed Course Notes for Applied Mathematics 298 Harvard University May 1962 pp 52-59 3 A WAKSMAN An optimal solution to the firing squad synchronization ... Any solution to the firing squad synchronization problem can easily be shown to require that the time from the General's order until the guns go off must be at least 2n-2, where n is the number of soldiers ...doi:10.1145/1476589.1476625 dblp:conf/afips/BalzerS68 fatcat:yetowuou3feo3dufteullx3c3u
well-known from computer science, Firing Squad Synchronization Problem (FSSP). ... Among the numerous FSSP's algorithmic solutions in literature, the Mazoyer algorithm has proven to be the most efficient one. ... FIRING SQUAD SYNCHRONIZATION PROBLEM Firing Squad Synchronization (FSS) problem, initially introduced by Myhill (1957) and then solved in the early sixties by Moore  , describes a random length ...doi:10.1109/ojnano.2020.3041399 fatcat:fy6aiuvhifgldolk4mxpmbbske
The problem of synchronizing a finite one-dimensional array of finite-state machines (the firing-squad synchronization problem) is generalized for finite two-dimensional iterative arrays of M x N or NxWN ... Shinahr, Ilka 7757 — and three-dimensional firing-squad synchronization prob- Information and Control 24 (1974), 163-180. ...
A minimum time solution is provided that synchronizes all cells along all shortest paths between a given pair of vertices. ... The paper generalizes the well-known firing squad synchronization 68Q Theory of computing For the web version of Mathematical Reviews, see http: //www.ams.org/mathscinet 20014:68162 problem (FSSP) to cellular ...
The firing squad synchronization problem has been studied extensively for more than forty years, and a rich variety of synchronization algorithms have been proposed. ... We also present herein a survey and a comparison of the quantitative aspects of the optimum-time synchronization algorithms developed thus far for one-dimensional cellular arrays. ... Time Any solution to the firing squad synchronization problem can easily be shown to require (2n À 2) steps for firing n cells, since signals on the array can propagate no faster than one cell per step ...doi:10.4036/iis.2002.207 fatcat:674p5hgtanb4zds372nzeycb3i
It is well known that the time optimal solution of the firing squad problem with n “soldiers” requires 2n — 2 steps. ... Also, we prove, for infinite graphs, that the reachability problem is undecidable.” 971:68144 68Q80 Mazoyer, Jacques (F-ENSLY-IP; Lyon) On optimal solutions to the firing squad synchronization problem. ...
As in the case of weak agreement, solutions to the Byzantine firing squad problem exist in models in which there is no minimum communication delay. ... Byzantine firing squad The Byzantine firing squad problem addresses a form of synchronization in the presence of Byz-antine failures. The problem is to synchronize a response to an input stimulus. ...doi:10.1145/323596.323602 dblp:conf/podc/FischerLM85 fatcat:krkbz47nbfa7fi7db6eaagk4a4
Expanded and modiÿed version of the talk "On time optimal solutions of the two-dimensional ÿring squad synchronization problem" presented at MFCS'98 Satellite Workshop on Cellular Automata (Brno, Czech ... The ÿring squad synchronization problem for two-dimensional paths (2-Path FSSP, for short) is a variation of the ÿring squad synchronization problem where ÿnite automata are placed along a path in the ... Introduction The ÿring squad synchronization problem (FSSP) is a problem on cellular automata that has a long history. The problem was posed by J. Myhill in 1957. ...doi:10.1016/s0304-3975(99)00332-1 fatcat:m23icjxu7rhf7jwdxb7nzpovny
We focus on the fundamental generalized firing squad synchronization algorithms operating in optimum-and non-optimum-steps on onedimensional cellular arrays. ... The eight-state optimum-step algorithm is the smallest one known at present in the class of generalized optimum-step firing squad synchronization protocols. ... Acknowlegements The authors would like to express their thanks to Mr. T. Tsuzuki and Mr. T. Ueda who helped to implement some transition rules. ...doi:10.1007/978-4-431-88981-6_20 dblp:conf/iwnc/Umeo07 fatcat:pit4pu66angx5oljpqduinclsu
« Previous Showing results 1 — 15 out of 543 results