A Spatio-temporal Algorithmic Point of View on Firing Squad Synchronisation Problem-Reference-Cited by-同舟云学术

A Spatio-temporal Algorithmic Point of View on Firing Squad Synchronisation Problem

Published:2012 Issue: Volume: Page:101-110
ISSN:0302-9743
Container-title:Lecture Notes in Computer Science
language:
Short-container-title:

Author:

Maignan Luidnel,Yunès Jean-Baptiste

Publisher

Springer Berlin Heidelberg

Link

http://link.springer.com/content/pdf/10.1007/978-3-642-33350-7_11.pdf

Reference21 articles.

1. Culik, K.: Variations of the firing squad problem and applications. Information Processing Letters 30, 153–157 (1989)

2. Goto, E.: A minimum time solution of the firing squad synchronization problem. Courses Notes for Applied Mathematics, vol. 298. Harvard University (1962)

3. Grasselli, A.: Synchronization of cellular arrays: The firing squad problem in two dimensions. Information and Control 28, 113–124 (1975)

4. Herman, G.T., Liu, W., Rowland, S., Walker, A.: Synchronization of growing cellular automata. Information and Control 25, 103–122 (1974)

5. Jiang, T.: The synchronization of nonuniform networks of finite automata. Information and Control 97, 234–261 (1992)

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

1. Abstract geometrical computation 11: Slanted firing squad synchronisation on signal machines;Theoretical Computer Science;2021-11

2. Exploring Millions of 6-State FSSP Solutions: The Formal Notion of Local CA Simulation;Cellular Automata and Discrete Complex Systems;2020

3. Generalized FSSP on Two Triangular Tilings;2018 Sixth International Symposium on Computing and Networking Workshops (CANDARW);2018-11

4. Synchronizing the Squad with (Almost) Arbitrary Cut Ratio;INT SYMPOS COMPUT NE;2016

5. A Field Based Solution of Mazoyer’s FSSP Schema;Lecture Notes in Computer Science;2016