Cutting the Firing Squad Synchronization

DOI10.1007/978-3-319-44365-2_12zbMath1392.68273OpenAlexW2517629605MaRDI QIDQ4571177

Martin Kutrib, Antonios Dimitriadis, Georgios Ch. Sirakoulis

Publication date: 6 July 2018

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-319-44365-2_12

Mathematics Subject Classification ID

Cellular automata (computational aspects) (68Q80)

Related Items (3)

Revisiting the cutting of the firing squad synchronization ⋮ Implementations of FSSP Algorithms on Fault-Tolerant Cellular Arrays ⋮ State-efficient realization of fault-tolerant FSSP algorithms

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• 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 optimum solution to the firing squad synchronization problem
• Massively parallel fault tolerant computations on syntactical patterns

This page was built for publication: Cutting the Firing Squad Synchronization