{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,8]],"date-time":"2024-09-08T23:54:00Z","timestamp":1725839640861},"publisher-location":"Cham","reference-count":15,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319268408"},{"type":"electronic","value":"9783319268415"}],"license":[{"start":{"date-parts":[[2015,1,1]],"date-time":"2015-01-01T00:00:00Z","timestamp":1420070400000},"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":[[2015]]},"DOI":"10.1007\/978-3-319-26841-5_13","type":"book-chapter","created":{"date-parts":[[2015,11,30]],"date-time":"2015-11-30T01:53:17Z","timestamp":1448848397000},"page":"161-173","source":"Crossref","is-referenced-by-count":4,"title":["A Generalized Minimum-Time Minimum-State-Change FSSP Algorithm"],"prefix":"10.1007","author":[{"given":"Hiroshi","family":"Umeo","sequence":"first","affiliation":[]},{"given":"Keisuke","family":"Imai","sequence":"additional","affiliation":[]},{"given":"Akihiro","family":"Sousa","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2015,12,1]]},"reference":[{"key":"13_CR1","doi-asserted-by":"publisher","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":"13_CR2","unstructured":"Gerken, H.D.: \u00dcber Synchronisationsprobleme bei Zellularautomaten, p. 50. Diplomarbeit, Institut f\u00fcr Theoretische Informatik, Technische Universit\u00e4t Braunschweig (1987)"},{"key":"13_CR3","unstructured":"Goto, E.: A minimal time solution of the firing squad problem. Dittoed course notes for Applied Mathematics, vol. 298, pp. 52\u201359. Harvard University (1962)"},{"key":"13_CR4","doi-asserted-by":"publisher","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. Theor. Comput. Sci. 50, 183\u2013238 (1987)","journal-title":"Theor. Comput. Sci."},{"key":"13_CR5","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 (1964)"},{"key":"13_CR6","doi-asserted-by":"publisher","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"},{"issue":"3","key":"13_CR7","first-page":"733","volume":"E87\u2013D","author":"H Umeo","year":"2004","unstructured":"Umeo, H.: A simple design of time-efficient firing squad synchronization algorithms with fault-tolerance. IEICE Trans. Inf. Syst. E87\u2013D(3), 733\u2013739 (2004)","journal-title":"IEICE Trans. Inf. Syst."},{"key":"13_CR8","doi-asserted-by":"publisher","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":"13_CR9","first-page":"267","volume":"3","author":"H Umeo","year":"2010","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)","journal-title":"Acta Phys. Pol. B Proc. Suppl."},{"key":"13_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"231","DOI":"10.1007\/978-3-319-21909-7_22","volume-title":"Parallel Computing Technologies","author":"H Umeo","year":"2015","unstructured":"Umeo, H., Maeda, M., Sousa, A., Taguchi, K.: A class of non-optimum-time 3n-step FSSP algorithms - a survey. In: Malyshkin, V. (ed.) PaCT 2015. LNCS, vol. 9251, pp. 231\u2013245. Springer, Heidelberg (2015)"},{"issue":"12","key":"13_CR11","doi-asserted-by":"publisher","first-page":"1007","DOI":"10.1007\/BF02084165","volume":"21","author":"R Vollmar","year":"1982","unstructured":"Vollmar, R.: Some remarks about the efficiency of polyautomata. Int. J. Theor. Phys. 21(12), 1007\u20131015 (1982)","journal-title":"Int.. J. Theor. Phys."},{"key":"13_CR12","doi-asserted-by":"publisher","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":"13_CR13","doi-asserted-by":"crossref","unstructured":"Yun\u00e8s, J.-B.: An intrinsically non minimal-time Minsky-like 6-states solution to the firing squad synchronization problem. Theor. Inf. Appl. 42(1), 55\u201368 (2008a)","DOI":"10.1051\/ita:2007051"},{"key":"13_CR14","doi-asserted-by":"crossref","unstructured":"Yun\u00e8s, J.B.: A 4-states algebraic solution to linear cellular automata synchronization. Inf. Process. Lett. 19(2), 71\u201375 (2008b)","DOI":"10.1016\/j.ipl.2008.01.009"},{"key":"13_CR15","unstructured":"Yun\u00e8s, J.-B.: Goto\u2019sconstruction and Pascal\u2019s triangle: new insights into cellular automata synchronization. In: Proceedings of the 1st Symposium on Cellular Automata, JAC 2008, pp. 195\u2013203 (2008c). ISBN 978-5-54057-337-3"}],"container-title":["Lecture Notes in Computer Science","Theory and Practice of Natural Computing"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-26841-5_13","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,31]],"date-time":"2019-05-31T15:01:58Z","timestamp":1559314918000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-26841-5_13"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015]]},"ISBN":["9783319268408","9783319268415"],"references-count":15,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-26841-5_13","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2015]]}}}