{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,8]],"date-time":"2024-09-08T14:15:21Z","timestamp":1725804921152},"publisher-location":"Cham","reference-count":9,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319115191"},{"type":"electronic","value":"9783319115207"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2014]]},"DOI":"10.1007\/978-3-319-11520-7_15","type":"book-chapter","created":{"date-parts":[[2014,9,12]],"date-time":"2014-09-12T01:05:05Z","timestamp":1410483905000},"page":"136-145","source":"Crossref","is-referenced-by-count":9,"title":["Experimental Finitization of Infinite Field-Based Generalized FSSP Solution"],"prefix":"10.1007","author":[{"given":"Luidnel","family":"Maignan","sequence":"first","affiliation":[]},{"given":"Jean-Baptiste","family":"Yun\u00e8s","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"15_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. Information and Control\u00a010, 22\u201342 (1967)","journal-title":"Information and Control"},{"key":"15_CR2","doi-asserted-by":"crossref","unstructured":"Maignan, L., Gruau, F.: Integer gradient for cellular automata: Principle and examples. In: Self-Adaptive and Self-Organizing Systems Workshops, SASOW 2008, pp. 321\u2013325 (2008)","DOI":"10.1109\/SASOW.2008.52"},{"key":"15_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"101","DOI":"10.1007\/978-3-642-33350-7_11","volume-title":"Cellular Automata","author":"L. Maignan","year":"2012","unstructured":"Maignan, L., Yun\u00e8s, J.-B.: A spatio-temporal algorithmic point of view on firing squad synchronisation problem. In: Sirakoulis, G.C., Bandini, S. (eds.) ACRI 2012. LNCS, vol.\u00a07495, pp. 101\u2013110. Springer, Heidelberg (2012)"},{"key":"15_CR4","doi-asserted-by":"crossref","unstructured":"Maignan, L., Yun\u00e8s, J.B.: Moore and von Neumann neighborhood n-dimensional generalized firing squad solutions using fields. In: AFCA 2013 Workshop. CANDAR 2013 Conference, Matsuyama, Japan, December 4-6 (2013)","DOI":"10.1109\/CANDAR.2013.98"},{"key":"15_CR5","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. Theoretical Computer Science\u00a050, 183\u2013238 (1987)","journal-title":"Theoretical Computer Science"},{"key":"15_CR6","unstructured":"Moore, E.E.: Sequential Machines, Selected Papers, pp. 213\u2013214. Addison-Wesley (1964)"},{"issue":"3","key":"15_CR7","doi-asserted-by":"publisher","first-page":"303","DOI":"10.1016\/S0304-3975(03)00425-0","volume":"314","author":"K. Noguchi","year":"2004","unstructured":"Noguchi, K.: Simple 8-state minimal time solution to the firing squad synchronization problem. Theoretical Computer Science\u00a0314(3), 303\u2013334 (2004)","journal-title":"Theoretical Computer Science"},{"key":"15_CR8","series-title":"IFIP","first-page":"111","volume-title":"3rd IFIP International Conference on Theoretical Computer Science","author":"H. Schmidt","year":"2004","unstructured":"Schmidt, H., Worsch, T.: The firing squad synchronization problem with many generals for one-dimensional CA. In: Levy, J.-J., Mayr, E.W., Mitchell, J.C. (eds.) 3rd IFIP International Conference on Theoretical Computer Science. IFIP, vol.\u00a0155, pp. 111\u2013124. Springer, Boston (2004)"},{"key":"15_CR9","doi-asserted-by":"publisher","first-page":"55","DOI":"10.1051\/ita:2007051","volume":"42","author":"J.B. Yun\u00e8s","year":"2008","unstructured":"Yun\u00e8s, J.B.: An intrinsically non minimal-time Minsky-like 6-states solution to the firing squad synchronization problem. RAIRO-Theor. Inf. Appl.\u00a042, 55\u201368 (2008)","journal-title":"RAIRO-Theor. Inf. Appl."}],"container-title":["Lecture Notes in Computer Science","Cellular Automata"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-11520-7_15","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,27]],"date-time":"2019-05-27T17:22:55Z","timestamp":1558977775000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-11520-7_15"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014]]},"ISBN":["9783319115191","9783319115207"],"references-count":9,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-11520-7_15","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2014]]}}}