State-efficient realization of fault-tolerant FSSP algorithms

DOI10.1007/s11047-019-09765-3zbMath1530.68186OpenAlexW2980460578WikidataQ127030972 ScholiaQ127030972MaRDI QIDQ6150995

Hiroshi Umeo, Naoki Kamikawa, Gen Fujita, Masashi Maeda

Publication date: 9 February 2024

Published in: Natural Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s11047-019-09765-3

zbMATH Keywords

cellular automatonfiring squad synchronizationFSSPfault-tolerant cellular automaton

Mathematics Subject Classification ID

Cellular automata (computational aspects) (68Q80)

Cites Work

• Reliable computation with cellular automata
• A six-state minimal time solution to the Firing squad synchronization problem
• Fault tolerant cellular spaces
• Fault tolerant cellular automata
• An 8-state minimal time solution to the firing squad synchronization problem
• An optimum solution to the firing squad synchronization problem
• Cutting the Firing Squad Synchronization
• The Distributed Firing Squad Problem
• Implementations of FSSP Algorithms on Fault-Tolerant Cellular Arrays
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: State-efficient realization of fault-tolerant FSSP algorithms