Minimum and non-minimum time solutions to the firing squad synchronization problem

DOI10.1007/978-3-319-13350-8_9MaRDI QIDQ2944883zbMATH OpenOpenAlexFDO

Authors Margherita Napoli, Mimmo Parente

Publication date 8 September 2015

Published in Computing with New Resources (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-319-13350-8_9

zbMATH Keywords

cellular automatachannel capacitysynchronous computationsFSSP

Mathematics Subject Classification ID

Cellular automata (computational aspects) (68Q80)

Recommendations

• scientific article; zbMATH DE number 2163014
• Smaller solutions for the firing squad
• The firing squad synchronization problem with sub-generals
• scientific article; zbMATH DE number 4072387
• About 4-States Solutions to the Firing Squad Synchronization Problem

Cites work

• scientific article; zbMATH DE number 1192313 (Why is no real title available?)
• scientific article; zbMATH DE number 714573 (Why is no real title available?)
• scientific article; zbMATH DE number 2009869 (Why is no real title available?)
• scientific article; zbMATH DE number 2163014 (Why is no real title available?)
• scientific article; zbMATH DE number 1869612 (Why is no real title available?)
• scientific article; zbMATH DE number 3237733 (Why is no real title available?)
• A compositional approach to synchronize two-dimensional networks of processors
• A generalized firing squad problem
• A seven-state time-optimum square synchronizer
• A six-state minimal time solution to the Firing squad synchronization problem
• An 8-state minimal time solution to the firing squad synchronization problem
• An Investigation into Transition Rule Sets for Optimum-time Firing Squad Synchronization Algorithms on One-dimensional Cellular Automata
• An optimal self-stabilizing firing squad
• An optimum solution to the firing squad synchronization problem
• Developments in Language Theory
• Different time solutions for the firing squad synchronization problem on basic grid networks
• On minimal-time solutions of firing squad synchronization problems for networks
• On optimal solutions to the firing squad synchronization problem
• On the Complexity of Network Synchronization
• On time optimal solutions of the firing squad synchronization problem for two-dimensional paths
• Recent developments in constructing square synchronizers
• THE FIRING SQUAD SYNCHRONIZATION PROBLEM ON SQUARES, TORUSES AND RINGS
• The Distributed Firing Squad Problem
• The firing squad synchronization problem for two-dimensional arrays
• Two- and three-dimensional firing-squad synchronization problems
• Variations of the firing squad problem and applications

Cited in

(9)

• Unconventional Computation
• Variations of the firing squad problem and applications
• The firing squad synchronization problem with sub-generals
• Nonexistence of minimal-time solutions for some variations of the firing squad synchronization problem having simple geometric configurations
• On time optimal solutions of the firing squad synchronization problem for two-dimensional paths
• The minimum firing time of the generalized firing squad synchronization problem for squares
• scientific article; zbMATH DE number 2163014 (Why is no real title available?)
• A Small Five-State Non-Optimum-Time Solution to the Firing Squad Synchronization Problem
• The firing squad synchronization problem on Cayley graphs

This page was built for publication: Minimum and non-minimum time solutions to the firing squad synchronization problem

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2944883)