A Six-State Minimal Time Solution to the Firing Squad Synchronization Problem
نویسنده
چکیده
© Université de Lyon, 1986, tous droits réservés. L’accès aux archives de la série « Publications du Département de mathématiques de Lyon » implique l’accord avec les conditions générales d’utilisation (http://www.numdam.org/legal.php). Toute utilisation commerciale ou impression systématique est constitutive d’une infraction pénale. Toute copie ou impression de ce fichier doit contenir la présente mention de copyright.
منابع مشابه
New Bounds for the Firing Squad Problem on a Ring
We present two solutions to the firing synchronization problem on the ring, an 8-state minimal-time solution and a 6-state non-minimaltime solution. Both solutions use fewer states than the previous bestknown 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 sh...
متن کاملAn intrinsically non minimal-time Minsky-like 6-states solution to the Firing Squad synchronization problem
Here is presented a 6-states non minimal-time solution which is intrinsically Minsky-like and solves the three following problems: unrestricted version on a line, with one initiator at each end of a line and the problem on a ring. We also give a complete proof of correctness of our solution, which was never done in a publication for Minsky’s solutions. 1991 Mathematics Subject Classification. 6...
متن کاملSynchronization of a Line of Identical Processors at a Given Time
We are given a line of n identical processors ((nite automata) that work synchronously. Each processor can transmit just one bit of information to the neighbour processors (if any) on the left and on the right. The computation starts at time 1 with the leftmost processor in a starting state and all other processors in a quiescent state. Given the time f(n), the problem is to set (synchronize) a...
متن کاملSynchronization of Cellular Arrays: The Firing Squad Problem in Two Dimensions
are copies of a single synchronous finite-state machine M. The internal state of a cell at time t @ 1 depends on its internal state and on the internal states of its left and right neighbors at time t. At time t 0, one of the end cells (called "the general") enters an internal state s, ("fire when ready"), while all other cells (called "the soldiers") are in a quiescent state sq. The array must...
متن کاملGoto's construction and Pascal's triangle: new insights into cellular automata synchronization
Here we present a new non-recursive minimal-time solution to the Firing Squad Synchronization Problem which does not use any recursive process. In 1962, E. Goto designed an iterative algorithm which uses Minsky-McCarthy’s solutions to synchronize in minimal-time. Our solution does not use any standard recursion process, only some “fractal computation”, making it a purely iterative synchronizati...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Theor. Comput. Sci.
دوره 50 شماره
صفحات -
تاریخ انتشار 1987