{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T14:27:24Z","timestamp":1725460044237},"publisher-location":"Boston","reference-count":16,"publisher":"Kluwer Academic Publishers","isbn-type":[{"type":"print","value":"1402081405"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/1-4020-8141-3_11","type":"book-chapter","created":{"date-parts":[[2006,2,21]],"date-time":"2006-02-21T10:15:11Z","timestamp":1140516911000},"page":"111-124","source":"Crossref","is-referenced-by-count":22,"title":["The Firing Squad Synchronization Problem with Many Generals for One-Dimensional CA"],"prefix":"10.1007","author":[{"given":"Hubert","family":"Schmid","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Thomas","family":"Worsch","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"11_CR1","doi-asserted-by":"crossref","first-page":"57","DOI":"10.1016\/0304-3975(91)90267-6","volume":"91","author":"K. \u0108ulik","year":"1991","unstructured":"K. \u0108ulik and S. Dube. An efficient solution of the firing mob problem. Theoretical Computer Science, 91:57\u201369, 1991.","journal-title":"Theoretical Computer Science"},{"key":"11_CR2","unstructured":"E. Goto. A minimum time solution of the Firing Squad Problem. Dittoed course notes for Applied Mathematics 298, Harvard University, 1962."},{"key":"11_CR3","unstructured":"M. Hisaoka, H. Yamada, M. Maeda, Th. Worsch, and H. Umeo. A design of firing squad synchronization algorithms for multi-general problems and their implementations. Unpublished manuscript, 2003."},{"key":"11_CR4","doi-asserted-by":"publisher","first-page":"149","DOI":"10.1016\/0304-3975(78)90046-4","volume":"7","author":"K. Kobayashi","year":"1978","unstructured":"K. Kobayashi. On the minimal firing time of the firing squad synchronization problem for polyautomata networks. Theoretical Computer Science, 7:149\u2013167, 1978.","journal-title":"Theoretical Computer Science"},{"key":"11_CR5","first-page":"179","volume":"27","author":"M. Kutrib","year":"1991","unstructured":"M. Kutrib and R. Vollmar. Minimal time synchronization in restricted defective cellular automata. Journal of Information Processing and Cybernetics, EIK 27:179\u2013196, 1991.","journal-title":"Journal of Information Processing and Cybernetics"},{"key":"11_CR6","doi-asserted-by":"crossref","first-page":"103","DOI":"10.3233\/FI-1998-341204","volume":"34","author":"S. La Torre","year":"1998","unstructured":"S. La Torre, M. Napoli, and M. Parente. Synchronization of a line of identical processors at a given time. Fundamenta Informaticae, 34:103\u2013128, 1998.","journal-title":"Fundamenta Informaticae"},{"key":"11_CR7","doi-asserted-by":"publisher","first-page":"183","DOI":"10.1016\/0304-3975(87)90124-1","volume":"50","author":"J. Mazoyer","year":"1987","unstructured":"J. Mazoyer. A six-state minimal time solution to the firing squad synchronization problem. Theoretical Computer Science, 50:183\u2013238, 1987.","journal-title":"Theoretical Computer Science"},{"key":"11_CR8","doi-asserted-by":"publisher","first-page":"17","DOI":"10.1016\/S0019-9958(68)90309-4","volume":"12","author":"F. R. Moore","year":"1968","unstructured":"F. R. Moore and G. G. Langdon. A generalized firing squad problem. Information and Control, 12:17\u201333, 1968.","journal-title":"Information and Control"},{"key":"11_CR9","unstructured":"P. Sanders. Suchalgorithmen auf SIMD-Rechnern \u2014 Weitere Ergebnisse zu Polyautomaten. Diploma thesis, Fakult\u00e4t f\u00fcr Informatik, Universit\u00e4t Karlsruhe, 1993."},{"key":"11_CR10","unstructured":"H. Schmid. Synchronisationsprobleme f\u00fcr zellul\u00e4re Automaten mit mehreren Gener\u00e4len. Diploma thesis, Fakult\u00e4t f\u00fcr Informatik, Universit\u00e4t Karlsruhe, 2003."},{"issue":"7","key":"11_CR11","doi-asserted-by":"publisher","first-page":"939","DOI":"10.1016\/S0167-739X(02)00073-0","volume":"18","author":"M. Stratmann","year":"2002","unstructured":"M. Stratmann and Th. Worsch. Leader election in d-dimensional CA in time diam\u00b7 log(diam). Future Generation Computer Systems, 18(7):939\u2013950, 2002.","journal-title":"Future Generation Computer Systems"},{"key":"11_CR12","doi-asserted-by":"publisher","first-page":"305","DOI":"10.1016\/0304-3975(82)90040-8","volume":"19","author":"H. Szwerinski","year":"1982","unstructured":"H. Szwerinski. Time optimal solution of the firing squad synchronization problem for n-dimensional rectangles with the general at an arbitrary position. Theoretical Computer Science, 19:305\u2013320, 1982.","journal-title":"Theoretical Computer Science"},{"key":"11_CR13","first-page":"733","volume":"E87-D","author":"H. Umeo","year":"2004","unstructured":"H. Umeo. A simple design of time-optimum firing squad synchronization algorithms with fault-tolerance. IEICE Transactions on Information and Systems, E87-D:733\u2013739, 2004.","journal-title":"IEICE Transactions on Information and Systems"},{"key":"11_CR14","series-title":"Technical report","volume-title":"Yet another generalization of the firing squad problem","author":"R. Vollmar","year":"1976","unstructured":"R. Vollmar. Yet another generalization of the firing squad problem. Technical report, Technische Universit\u00e4t Braunschweig, Braunschweig, 1976."},{"key":"11_CR15","first-page":"293","volume":"3","author":"R. Vollmar","year":"1977","unstructured":"R. Vollmar. On two modified problems of synchronization in cellular automata. Acta Cybernetica, 3:293\u2013300, 1977.","journal-title":"Acta Cybernetica"},{"key":"11_CR16","unstructured":"Th. Worsch. Algorithmen in Zellularautomaten. Course notes, Fakult\u00e4t f\u00fcr Informatik, Universit\u00e4t Karlsruhe, 2003."}],"container-title":["IFIP International Federation for Information Processing","Exploring New Frontiers of Theoretical Informatics"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/1-4020-8141-3_11.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,17]],"date-time":"2020-11-17T14:47:37Z","timestamp":1605624457000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/1-4020-8141-3_11"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["1402081405"],"references-count":16,"URL":"https:\/\/doi.org\/10.1007\/1-4020-8141-3_11","relation":{},"subject":[]}}