The firing squad synchronization problem for two-dimensional arrays

DOI10.1016/S0019-9958(77)90273-XMaRDI QIDQ4141167zbMATH OpenOpenAlexFDO

Authors Kojiro Kobayashi

Publication date 1977

Published in Information and Control (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/s0019-9958(77)90273-x

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Cited in

(13)

• The firing squad synchronization problem for graphs
• An efficient solution of the firing mob problem
• The synchronization of nonuniform networks of finite automata
• (A-)synchronous (non)-deterministic cell spaces simulating each other
• On the minimal firing time of the firing squad synchronization problem for polyautomata networks
• On optimal solutions to the firing squad synchronization problem
• The minimum firing time of the generalized firing squad synchronization problem for squares
• A compositional approach to synchronize two-dimensional networks of processors
• Minimum and non-minimum time solutions to the firing squad synchronization problem
• Different time solutions for the firing squad synchronization problem on basic grid networks
• Synchronization of 1-way connected processors
• Generalized FSSP on hexagonal tiling: towards arbitrary regular spaces
• Firing squad synchronization problem in reversible cellular automata

This page was built for publication: The firing squad synchronization problem for two-dimensional arrays

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