State-efficient realization of fault-tolerant FSSP algorithms
From MaRDI portal
(Redirected from State-efficient realization of fault-tolerant FSSP algorithms)
Recommendations
- Implementations of FSSP Algorithms on Fault-Tolerant Cellular Arrays
- A design of generalized minimum-state-change FSSP algorithms and their implementations
- Smaller-state implementations of 2D FSSP algorithms. Recent developments
- How to synchronize cellular automata -- recent developments
- Revisiting the cutting of the firing squad synchronization
Cites work
- 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 optimum solution to the firing squad synchronization problem
- Cutting the Firing Squad Synchronization
- Fault tolerant cellular automata
- Fault tolerant cellular spaces
- Fault tolerant solutions to the firing squad synchronization problem in linear cellular automata
- scientific article; zbMATH DE number 996442 (Why is no real title available?)
- scientific article; zbMATH DE number 4209629 (Why is no real title available?)
- scientific article; zbMATH DE number 5117093 (Why is no real title available?)
- scientific article; zbMATH DE number 1950596 (Why is no real title available?)
- scientific article; zbMATH DE number 3305051 (Why is no real title available?)
- Implementations of FSSP Algorithms on Fault-Tolerant Cellular Arrays
- Reliable computation with cellular automata
- The Distributed Firing Squad Problem
Cited in
(2)
This page was built for publication: State-efficient realization of fault-tolerant FSSP algorithms
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6150995)
