Implementations of FSSP Algorithms on Fault-Tolerant Cellular Arrays

DOI10.1007/978-3-319-99813-8_25MaRDI QIDQ6108526zbMATH OpenOpenAlexFDO

Authors Hiroshi Umeo, Naoki Kamikawa, Masashi Maeda, Gen Fujita

Publication date 30 June 2023

Published in Developments in Language Theory (Search for Journal in Brave)

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

Mathematics Subject Classification ID

Cellular automata (computational aspects) (68Q80)

Recommendations

• Smaller-state implementations of 2D FSSP algorithms. Recent developments
• How to synchronize cellular automata -- recent developments
• A simple optimum-time FSSP algorithm for multi-dimensional cellular automata
• A class of time-optimum FSSP algorithms for multi-dimensional cellular arrays
• scientific article; zbMATH DE number 4072387

Cites work

• A six-state minimal time solution to the Firing squad synchronization problem
• Cutting the Firing Squad Synchronization
• Encyclopedia of Complexity and Systems Science
• Fault tolerant solutions to the firing squad synchronization problem in linear cellular automata
• scientific article; zbMATH DE number 5117093 (Why is no real title available?)
• scientific article; zbMATH DE number 3305051 (Why is no real title available?)
• Reliable computation with cellular automata

Cited in

(6)

• A new reconstruction and the first implementation of Goto's FSSP algorithm
• scientific article; zbMATH DE number 4001491 (Why is no real title available?)
• scientific article; zbMATH DE number 7385088 (Why is no real title available?)
• Fault tolerant solutions to the firing squad synchronization problem in linear cellular automata
• Revisiting the cutting of the firing squad synchronization
• State-efficient realization of fault-tolerant FSSP algorithms

This page was built for publication: Implementations of FSSP Algorithms on Fault-Tolerant Cellular Arrays

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