A Compositional Approach to Synchronize Two Dimensional Networks of Processors

DOI10.1051/ita:2000130zbMath0982.68092OpenAlexW2083659209MaRDI QIDQ2729630

Salvatore La Torre, Margherita Napoli

Publication date: 21 January 2002

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

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

zbMATH Keywords

cellular automata

Mathematics Subject Classification ID

Cellular automata (computational aspects) (68Q80) Dynamical aspects of cellular automata (37B15)

Related Items (2)

Minimum and non-Minimum Time Solutions to the Firing Squad Synchronization Problem ⋮ Different time solutions for the firing squad synchronization problem on basic grid networks

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Firing squad synchronization problem in reversible cellular 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
• On optimal solutions to the firing squad synchronization problem
• 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 firing squad synchronization problem on Cayley graphs

This page was built for publication: A Compositional Approach to Synchronize Two Dimensional Networks of Processors