{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T11:09:17Z","timestamp":1740136157605,"version":"3.37.3"},"reference-count":36,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2017,7,28]],"date-time":"2017-07-28T00:00:00Z","timestamp":1501200000000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Nat Comput"],"published-print":{"date-parts":[[2018,9]]},"DOI":"10.1007\/s11047-017-9628-z","type":"journal-article","created":{"date-parts":[[2017,7,28]],"date-time":"2017-07-28T12:04:44Z","timestamp":1501243484000},"page":"455-465","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Revisiting the cutting of the firing squad synchronization"],"prefix":"10.1007","volume":"17","author":[{"given":"Antonios","family":"Dimitriadis","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Martin","family":"Kutrib","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-8240-484X","authenticated-orcid":false,"given":"Georgios Ch.","family":"Sirakoulis","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2017,7,28]]},"reference":[{"key":"9628_CR1","doi-asserted-by":"crossref","first-page":"22","DOI":"10.1016\/S0019-9958(67)90032-0","volume":"10","author":"RM Balzer","year":"1967","unstructured":"Balzer RM (1967) An 8-state minimal time solution to the firing squad synchronization problem. Inf Control 10:22\u201342","journal-title":"Inf Control"},{"key":"9628_CR2","first-page":"153","volume":"30","author":"K \u010culik II","year":"1989","unstructured":"\u010culik K II (1989) Variations of the firing squad problem and applications. Inf Process Lett 30:153\u2013157","journal-title":"Inf Process Lett"},{"key":"9628_CR3","doi-asserted-by":"crossref","first-page":"57","DOI":"10.1016\/0304-3975(91)90267-6","volume":"91","author":"K \u010culik II","year":"1991","unstructured":"\u010culik K II, Dube S (1991) An efficient solution of the firing mob problem. Theor Comput Sci 91:57\u201369","journal-title":"Theor Comput Sci"},{"key":"9628_CR4","doi-asserted-by":"crossref","unstructured":"Dimitriadis A, Kutrib M, Sirakoulis G Ch (2016) Cutting the firing squad synchronization. In: El Yacoubi S, Was J, Bandini S (eds) Cellular automata\u201412th international conference on cellular automata for research and industry, ACRI 2016. Lecture notes in computer science, vol 9863. Springer, pp 123\u2013133","DOI":"10.1007\/978-3-319-44365-2_12"},{"key":"9628_CR5","first-page":"687","volume":"E87\u2013D","author":"B Fay","year":"2004","unstructured":"Fay B, Kutrib M (2004) The fault-tolerant early bird problem. IEICE Trans Inf Syst E87\u2013D:687\u2013693","journal-title":"IEICE Trans Inf Syst"},{"issue":"1","key":"9628_CR6","doi-asserted-by":"crossref","first-page":"15","DOI":"10.1016\/0022-0000(86)90002-4","volume":"32","author":"P G\u00e1cs","year":"1986","unstructured":"G\u00e1cs P (1986) Reliable computation with cellular automata. J Comput Syst Sci 32(1):15\u201378","journal-title":"J Comput Syst Sci"},{"key":"9628_CR7","unstructured":"Goto E (1962) A minimal time solution of the firing squad problem. In: Course notes for applied mathematics, vol 298. Harvard University, Cambridge, MA"},{"key":"9628_CR8","doi-asserted-by":"crossref","first-page":"113","DOI":"10.1016\/S0019-9958(75)90255-7","volume":"28","author":"A Grasselli","year":"1975","unstructured":"Grasselli A (1975) Synchronization of cellular arrays: the firing squad problem in two dimensions. Inf Control 28:113\u2013124","journal-title":"Inf Control"},{"key":"9628_CR9","doi-asserted-by":"crossref","first-page":"171","DOI":"10.1016\/S0022-0000(75)80066-3","volume":"11","author":"M Harao","year":"1975","unstructured":"Harao M, Noguchi S (1975) Fault tolerant cellular automata. J Comput Syst Sci 11:171\u2013185","journal-title":"J Comput Syst Sci"},{"key":"9628_CR10","doi-asserted-by":"crossref","first-page":"103","DOI":"10.1016\/S0019-9958(74)90833-X","volume":"25","author":"GT Herman","year":"1974","unstructured":"Herman GT, Liu WH, Rowland S, Walker A (1974) Synchronization of growing cellular arrays. Inf Control 25:103\u2013122","journal-title":"Inf Control"},{"issue":"2","key":"9628_CR11","doi-asserted-by":"crossref","first-page":"475","DOI":"10.1016\/0304-3975(96)00016-3","volume":"165","author":"K Imai","year":"1996","unstructured":"Imai K, Morita K (1996) Firing squad synchronization problem in reversible cellular automata. Theor Comput Sci 165(2):475\u2013482","journal-title":"Theor Comput Sci"},{"key":"9628_CR12","doi-asserted-by":"crossref","first-page":"234","DOI":"10.1016\/0890-5401(92)90036-F","volume":"97","author":"T Jiang","year":"1992","unstructured":"Jiang T (1992) The synchronization of nonuniform networks of finite automata. Inf Comput 97:234\u2013261","journal-title":"Inf Comput"},{"key":"9628_CR13","doi-asserted-by":"crossref","first-page":"300","DOI":"10.1016\/0022-0000(78)90011-9","volume":"17","author":"K Kobayashi","year":"1978","unstructured":"Kobayashi K (1978a) The firing squad synchronization problem for a class of polyautomata networks. J Comput Syst Sci 17:300\u2013318","journal-title":"J Comput Syst Sci"},{"key":"9628_CR14","doi-asserted-by":"crossref","first-page":"149","DOI":"10.1016\/0304-3975(78)90046-4","volume":"7","author":"K Kobayashi","year":"1978","unstructured":"Kobayashi K (1978b) On the minimal firing time of the firing squad synchronization problem for polyautomata networks. Theor Comput Sci 7:149\u2013167","journal-title":"Theor Comput Sci"},{"key":"9628_CR15","doi-asserted-by":"crossref","first-page":"905","DOI":"10.1016\/S0167-739X(02)00070-5","volume":"18","author":"M Kutrib","year":"2002","unstructured":"Kutrib M, L\u00f6we JT (2002) Massively parallel fault tolerant computations on syntactical patterns. Future Gener Comput Syst 18:905\u2013919","journal-title":"Future Gener Comput Syst"},{"key":"9628_CR16","first-page":"179","volume":"27","author":"M Kutrib","year":"1991","unstructured":"Kutrib M, Vollmar R (1991) Minimal time synchronization in restricted defective cellular automata. J Inf Process Cybern EIK 27:179\u2013196","journal-title":"J Inf Process Cybern EIK"},{"issue":"7","key":"9628_CR17","first-page":"895","volume":"E78\u2013D","author":"M Kutrib","year":"1995","unstructured":"Kutrib M, Vollmar R (1995) The firing squad synchronization problem in defective cellular automata. IEICE Trans Inf Syst E78\u2013D(7):895\u2013900","journal-title":"IEICE Trans Inf Syst"},{"key":"9628_CR18","doi-asserted-by":"crossref","first-page":"183","DOI":"10.1016\/0304-3975(87)90124-1","volume":"50","author":"J Mazoyer","year":"1987","unstructured":"Mazoyer J (1987) A six-state minimal time solution to the firing squad synchronization problem. Theor Comput Sci 50:183\u2013238","journal-title":"Theor Comput Sci"},{"key":"9628_CR19","unstructured":"Mazoyer J (1989) A minimal time solution to the firing squad synchronization problem with only one bit of information exchanged. Technical Report TR 89-03, Ecole Normale Sup\u00e9rieure de Lyon, Lyon"},{"key":"9628_CR20","first-page":"213","volume-title":"Sequential machines\u2014selected papers","author":"EF Moore","year":"1964","unstructured":"Moore EF (1964) The firing squad synchronization problem. In: Moore EF (ed) Sequential machines\u2014selected papers. Addison-Wesley, Reading, pp 213\u2013214"},{"key":"9628_CR21","doi-asserted-by":"crossref","first-page":"17","DOI":"10.1016\/S0019-9958(68)90309-4","volume":"12","author":"FR Moore","year":"1968","unstructured":"Moore FR, Langdon GC (1968) A generalized firing squad problem. Inf Control 12:17\u201333","journal-title":"Inf Control"},{"key":"9628_CR23","doi-asserted-by":"crossref","first-page":"150","DOI":"10.1016\/S0022-0000(75)80065-1","volume":"11","author":"H Nishio","year":"1975","unstructured":"Nishio H, Kobuchi Y (1975) Fault tolerant cellular spaces. J Comput Syst Sci 11:150\u2013170","journal-title":"J Comput Syst Sci"},{"key":"9628_CR24","doi-asserted-by":"crossref","first-page":"245","DOI":"10.1016\/S0019-9958(78)90304-2","volume":"36","author":"F Romani","year":"1978","unstructured":"Romani F (1978) The parallelism principle: speeding up the cellular automata synchronization. Inf Control 36:245\u2013255","journal-title":"Inf Control"},{"key":"9628_CR25","doi-asserted-by":"crossref","first-page":"219","DOI":"10.1016\/B978-1-4832-3187-7.50019-2","volume-title":"Graph theory and computing","author":"P Rosenstiehl","year":"1972","unstructured":"Rosenstiehl P, Fiksel JR, Holliger A (1972) Intelligent graphs: networks of finite automata capable of solving graph problems. In: Read RC (ed) Graph theory and computing. Academic Press, New York, pp 219\u2013265"},{"key":"9628_CR26","doi-asserted-by":"crossref","first-page":"163","DOI":"10.1016\/S0019-9958(74)80055-0","volume":"24","author":"I Shinahr","year":"1974","unstructured":"Shinahr I (1974) Two- and three-dimensional firing-squad synchronization problems. Inf Control 24:163\u2013180","journal-title":"Inf Control"},{"key":"9628_CR27","doi-asserted-by":"crossref","first-page":"305","DOI":"10.1016\/0304-3975(82)90040-8","volume":"19","author":"H Szwerinski","year":"1982","unstructured":"Szwerinski H (1982) Time optimal solution of the firing squad synchronization problem for n-dimensional rectangles with the general at an arbitrary position. Theor Comput Sci 19:305\u2013320","journal-title":"Theor Comput Sci"},{"key":"9628_CR28","first-page":"223","volume-title":"Parallel computing: trends and applications","author":"H Umeo","year":"1994","unstructured":"Umeo H (1994) A fault-tolerant scheme for optimum-time firing squad synchronization. In: Joubert GR, Trystram D, Peters FJ, Evans DJ (eds) Parallel computing: trends and applications. North-Holland, Amsterdam, pp 223\u2013230"},{"key":"9628_CR29","unstructured":"Umeo H (1996) A note on firing squad synchronization algorithms. In: Kutrib M, Thomas W (eds) IFIP cellular automata workshop 1996. Universit\u00e4t Giessen, Giessen, p 95"},{"issue":"3","key":"9628_CR30","first-page":"733","volume":"E87\u2013D","author":"H Umeo","year":"2004","unstructured":"Umeo H (2004) A simple design of time-efficient firing squad synchronization algorithms with fault-tolerance. IEICE Trans Inf Syst E87\u2013D(3):733\u2013739","journal-title":"IEICE Trans Inf Syst"},{"key":"9628_CR31","doi-asserted-by":"crossref","first-page":"3537","DOI":"10.1007\/978-0-387-30440-3_211","volume-title":"Encyclopedia of complexity and systems science","author":"H Umeo","year":"2009","unstructured":"Umeo H (2009) Firing squad synchronization problem in cellular automata. In: Meyers R (ed) Encyclopedia of complexity and systems science. Springer, Berlin, pp 3537\u20133574"},{"issue":"4","key":"9628_CR32","first-page":"603","volume":"74","author":"H Umeo","year":"2006","unstructured":"Umeo H, Maeda M, Hisaoka M, Teraoka M (2006) A state-efficient mapping scheme for designing two-dimensional firing squad synchronization algorithms. Fundam. Inform. 74(4):603\u2013623","journal-title":"Fundam. Inform."},{"key":"9628_CR22","first-page":"43","volume-title":"Automata studies","author":"J Neumann von","year":"1956","unstructured":"von Neumann J (1956) Probabilistic logics and the synthesis of reliable organisms from unreliable components. In: Shannon CE, McCarthy J (eds) Automata studies. Princeton University Press, Princeton, pp 43\u201398"},{"issue":"9","key":"9628_CR33","first-page":"2965","volume":"74","author":"R Vollmar","year":"1991","unstructured":"Vollmar R (1991) FSSP for cellular automata with busses. Trans IEICE E 74(9):2965\u20132968","journal-title":"Trans IEICE E"},{"key":"9628_CR34","doi-asserted-by":"crossref","first-page":"66","DOI":"10.1016\/S0019-9958(66)90110-0","volume":"9","author":"A Waksman","year":"1966","unstructured":"Waksman A (1966) An optimum solution to the firing squad synchronization problem. Inf Control 9:66\u201378","journal-title":"Inf Control"},{"key":"9628_CR35","unstructured":"Yun\u00e8s JB (1996) Fault tolerant solutions to the firing squad synchronization problem. Technical Report LITP 96\/06, Institut Blaise Pascal, Paris"},{"key":"9628_CR36","first-page":"195","volume-title":"Symposium on cellular automata\u2014journ\u00e9es automates cellulaires (JAC 2008)","author":"JB Yun\u00e8s","year":"2009","unstructured":"Yun\u00e8s JB (2009) Goto\u2019s construction and Pascal\u2019s triangle: new insights into cellular automata synchronization. In: Durand B (ed) Symposium on cellular automata\u2014journ\u00e9es automates cellulaires (JAC 2008). MCCME Publishing House, Moscow, pp 195\u2013203"}],"container-title":["Natural Computing"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s11047-017-9628-z\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11047-017-9628-z.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11047-017-9628-z.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2018,8,18]],"date-time":"2018-08-18T12:55:49Z","timestamp":1534596949000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s11047-017-9628-z"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017,7,28]]},"references-count":36,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2018,9]]}},"alternative-id":["9628"],"URL":"https:\/\/doi.org\/10.1007\/s11047-017-9628-z","relation":{},"ISSN":["1567-7818","1572-9796"],"issn-type":[{"type":"print","value":"1567-7818"},{"type":"electronic","value":"1572-9796"}],"subject":[],"published":{"date-parts":[[2017,7,28]]}}}