Bounding the firing synchronization problem on a ring-Reference-Cited by-同舟云学术

Bounding the firing synchronization problem on a ring

Published:2004-06 Issue:2-3 Volume:320 Page:213-228
ISSN:0304-3975
Container-title:Theoretical Computer Science
language:en
Short-container-title:Theoretical Computer Science

Author:

Berthiaume André,Bittner Todd,Perković Ljubomir,Settle Amber,Simon Janos

Publisher

Elsevier BV

Subject

General Computer Science,Theoretical Computer Science

Reference14 articles.

1. An 8-state minimal time solution to the firing squad synchronization problem;Balzer;Inform. and Control,1967

2. A. Berthiaume, L. Perković, A. Settle, J. Simon, New bounds for the firing squad problem on a ring, in: SIROCCO 9: Proc. of the ninth Internat. Coll. on Structural Information and Communication Complexity, Andros, Greece, Carleton Scientific, 2002, pp. 17–31.

3. Variations of the firing squad problem and applications;Culik;Inform. Process. Lett.,1989

4. Computing with snakes in directed networks of automata;Even;J. Algorithms,1997

5. The firing squad synchronization problem for a class of polyautomata networks;Kobayashi;J. Comput. System Sci.,1978

Cited by 21 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. A New Class of the Smallest 4-State Semi-symmetric FSSP Partial Solutions for 1D Arrays;Lecture Notes in Computer Science;2024

2. A new class of the smallest FSSP partial solutions for 1D rings of length $$n=2^{k}-1$$;Acta Informatica;2021-07-19

3. How to Synchronize Cellular Automata – Recent Developments –;Fundamenta Informaticae;2019-10-23

4. The Smallest FSSP Partial Solutions for One-Dimensional Ring Cellular Automata: Symmetric and Asymmetric Synchronizers;Theoretical Aspects of Computing – ICTAC 2018;2018

5. Firing Squad Synchronization Problem in Cellular Automata;Cellular Automata;2018