A design of generalized minimum-state-change FSSP algorithms and their implementations
From MaRDI portal
Publication:6062008
Recommendations
- A new reconstruction and the first implementation of Goto's FSSP algorithm
- How to synchronize cellular automata -- recent developments
- Smaller-state implementations of 2D FSSP algorithms. Recent developments
- State-efficient realization of fault-tolerant FSSP algorithms
- scientific article; zbMATH DE number 4072387
Cites work
- scientific article; zbMATH DE number 2163014 (Why is no real title available?)
- scientific article; zbMATH DE number 3305051 (Why is no real title available?)
- scientific article; zbMATH DE number 3310089 (Why is no real title available?)
- A generalized firing squad problem
- A new reconstruction and the first implementation of Goto's FSSP algorithm
- 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 intrinsically non minimal-time Minsky-like 6-states solution to the Firing Squad synchronization problem
- An optimum solution to the firing squad synchronization problem
- Some remarks about the efficiency of polyautomata
- Time-optimal solution of the firing-squad-synchronization-problem for n- dimensional rectangles with the general at an arbitrary position
This page was built for publication: A design of generalized minimum-state-change FSSP algorithms and their implementations
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6062008)