Different time solutions for the firing squad synchronization problem on basic grid networks

DOI10.1051/ita:2006002zbMath1112.68101OpenAlexW2047992391MaRDI QIDQ3431435

Margherita Napoli, Jozef Gruska, Salvatore La Torre

Publication date: 10 April 2007

Published in: RAIRO - Theoretical Informatics and Applications (Search for Journal in Brave)

Full work available at URL: http://www.numdam.org/item?id=ITA_2006__40_2_177_0

Mathematics Subject Classification ID

Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) Cellular automata (computational aspects) (68Q80)

Related Items

Minimum and non-Minimum Time Solutions to the Firing Squad Synchronization Problem

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Firing squad synchronization problem in reversible cellular automata
• On real-time cellular automata and trellis automata
• A six-state minimal time solution to the Firing squad synchronization problem
• Variations of the firing squad problem and applications
• The firing squad synchronization problem for graphs
• A linear speed-up theorem for cellular automata
• Signals in one-dimensional cellular automata
• On optimal solutions to the firing squad synchronization problem
• A Compositional Approach to Synchronize Two Dimensional Networks of Processors
• An 8-state minimal time solution to the firing squad synchronization problem
• An optimum solution to the firing squad synchronization problem
• Two- and three-dimensional firing-squad synchronization problems
• The firing squad synchronization problem for two-dimensional arrays
• The Distributed Firing Squad Problem
• Developments in Language Theory
• On time optimal solutions of the firing squad synchronization problem for two-dimensional paths