{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,9]],"date-time":"2024-09-09T06:39:59Z","timestamp":1725863999733},"publisher-location":"Cham","reference-count":17,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319443645"},{"type":"electronic","value":"9783319443652"}],"license":[{"start":{"date-parts":[[2016,1,1]],"date-time":"2016-01-01T00:00:00Z","timestamp":1451606400000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2016]]},"DOI":"10.1007\/978-3-319-44365-2_14","type":"book-chapter","created":{"date-parts":[[2016,8,29]],"date-time":"2016-08-29T09:39:38Z","timestamp":1472463578000},"page":"144-154","source":"Crossref","is-referenced-by-count":1,"title":["A Class of Minimum-Time Minimum-State-Change Generalized FSSP Algorithms"],"prefix":"10.1007","author":[{"given":"Hiroshi","family":"Umeo","sequence":"first","affiliation":[]},{"given":"Keisuke","family":"Imai","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2016,8,30]]},"reference":[{"key":"14_CR1","doi-asserted-by":"crossref","first-page":"22","DOI":"10.1016\/S0019-9958(67)90032-0","volume":"10","author":"R Balzer","year":"1967","unstructured":"Balzer, R.: An 8-state minimal time solution to the firing squad synchronization problem. Inf. Control 10, 22\u201342 (1967)","journal-title":"Inf. Control"},{"key":"14_CR2","unstructured":"Gerken, H.D.: \u00dcber Synchronisationsprobleme bei Zellularautomaten. Diplomarbeit, Institut f\u00fcr Theoretische Informatik, Technische Universit\u00e4t Braunschweig, p. 50 (1987)"},{"key":"14_CR3","unstructured":"Goto, E.: A minimal time solution of the firing squad problem. Dittoed course notes for Applied Mathematics 298, Harvard University, pp. 52\u201359 (1962)"},{"key":"14_CR4","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.: A six-state minimal time solution to the firing squad synchronization problem. Theoret. Comput. Sci. 50, 183\u2013238 (1987)","journal-title":"Theoret. Comput. Sci."},{"key":"14_CR5","unstructured":"Mazoyer, J.: A minimal-time solution to the FSSP without recursive call to itself and with bounded slope of signals. Unpublished draft version, pp. 1\u201325 (1997)"},{"key":"14_CR6","first-page":"213","volume-title":"Sequential Machines, Selected Papers","author":"EF Moore","year":"1964","unstructured":"Moore, E.F.: The firing squad synchronization problem. In: Moore, E.F. (ed.) Sequential Machines, Selected Papers, pp. 213\u2013214. Addison-Wesley, Reading MA (1964)"},{"key":"14_CR7","doi-asserted-by":"crossref","first-page":"212","DOI":"10.1016\/S0019-9958(68)90309-4","volume":"12","author":"FR Moore","year":"1968","unstructured":"Moore, F.R., Langdon, G.G.: A generalized firing squad problem. Inf. Control 12, 212\u2013220 (1968)","journal-title":"Inf. Control"},{"key":"14_CR8","doi-asserted-by":"crossref","unstructured":"Schmid, H., Worsch, T.: The firing squad synchronization problem with many generals for one-dimensional CA. In: Proceedings of IFIP World Congress, pp. 111\u2013124 (2004)","DOI":"10.1007\/1-4020-8141-3_11"},{"key":"14_CR9","unstructured":"Umeo, H.: A note on firing squad synchronization algorithms - a reconstruction of Goto\u2019s first-in-the-world optimum-time firing squad synchronization algorithm. In: Kutrib, M., Worsch, T. (eds.) Proceedings of IFIP Cellular Automata Workshop. 1996, Schloss Rauischholzhausen, Giessen, Germany, p. 65 (1996)"},{"key":"14_CR10","unstructured":"Umeo, H.: A simple design of time-efficient firing squad synchronization algorithms with fault-tolerance. IEICE Trans. Inf. Syst. E87-D(3), 733\u2013739 (2011)"},{"key":"14_CR11","doi-asserted-by":"crossref","first-page":"3537","DOI":"10.1007\/978-0-387-30440-3_211","volume-title":"Encyclopedia of Complexity and System Science","author":"H Umeo","year":"2009","unstructured":"Umeo, H.: Firing squad synchronization problem in cellular automata. In: Meyers, R.A. (ed.) Encyclopedia of Complexity and System Science, vol. 4, pp. 3537\u20133574. Springer, New York (2009)"},{"key":"14_CR12","unstructured":"Umeo, H., Kamikawa, N., Nishioka, K., Akiguchi, S.: Generalized firing squad synchronization protocols for one-dimensional cellular automata - a survey. Acta Phys. Pol. B, Proc. Suppl. 3, 267\u2013289 (2010)"},{"key":"14_CR13","unstructured":"Umeo, H., Hirota, M., Nozaki, Y., Imai, K., Sogabe, T.: A reconstruction of Goto\u2019s FSSP algorithm (2016, draft in submission)"},{"key":"14_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"161","DOI":"10.1007\/978-3-319-26841-5_13","volume-title":"Theory and Practice of Natural Computing","author":"H Umeo","year":"2015","unstructured":"Umeo, H., Imai, K., Sousa, A.: A Generalized Minimum-Time Minimum-State-Change FSSP Algorithm. In: Dediu, A.-H., Magdalena, L., Mart\u00edn-Vide, C. (eds.) TPNC 2015. LNCS, vol. 9477, pp. 161\u2013173. Springer, Switzerland (2015). doi: 10.1007\/978-3-319-26841-5_13"},{"issue":"12","key":"14_CR15","doi-asserted-by":"crossref","first-page":"1007","DOI":"10.1007\/BF02084165","volume":"21","author":"R Vollmar","year":"1982","unstructured":"Vollmar, R.: Some remarks about the efficiency of polyautomata. Inter. J. Theoret. Phys. 21(12), 1007\u20131015 (1982)","journal-title":"Inter. J. Theoret. Phys."},{"key":"14_CR16","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.: An optimum solution to the firing squad synchronization problem. Inf. Control 9, 66\u201378 (1966)","journal-title":"Inf. Control"},{"key":"14_CR17","first-page":"195","volume":"2008","author":"JB Yun\u00e8s","year":"2008","unstructured":"Yun\u00e8s, J.B.: Goto\u2019s construction and Pascal\u2019s triangle: new insights into cellular automata synchronization. Proceedings of JAC 2008, 195\u2013203 (2008)","journal-title":"Proceedings of JAC"}],"container-title":["Lecture Notes in Computer Science","Cellular Automata"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-44365-2_14","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,6,24]],"date-time":"2017-06-24T17:33:37Z","timestamp":1498325617000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-44365-2_14"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016]]},"ISBN":["9783319443645","9783319443652"],"references-count":17,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-44365-2_14","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2016]]}}}