{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,28]],"date-time":"2025-03-28T07:14:30Z","timestamp":1743146070138,"version":"3.40.3"},"publisher-location":"Cham","reference-count":14,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030615871"},{"type":"electronic","value":"9783030615888"}],"license":[{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2020]]},"DOI":"10.1007\/978-3-030-61588-8_1","type":"book-chapter","created":{"date-parts":[[2020,10,20]],"date-time":"2020-10-20T23:04:36Z","timestamp":1603235076000},"page":"1-13","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Exploring Millions of 6-State FSSP Solutions: The Formal Notion of Local CA Simulation"],"prefix":"10.1007","author":[{"given":"Tien Thao","family":"Nguyen","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Luidnel","family":"Maignan","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2020,10,21]]},"reference":[{"issue":"1","key":"1_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(1), 22\u201342 (1967)","journal-title":"Inf. Control"},{"key":"1_CR2","doi-asserted-by":"publisher","first-page":"449","DOI":"10.1016\/j.asoc.2018.01.026","volume":"66","author":"M Clergue","year":"2018","unstructured":"Clergue, M., V\u00e9rel, S., Formenti, E.: An iterated local search to find many solutions of the 6-states firing squad synchronization problem. Appl. Soft Comput. 66, 449\u2013461 (2018)","journal-title":"Appl. Soft Comput."},{"key":"1_CR3","unstructured":"Duprat, J.: Proof of correctness of the Mazoyer\u2019s solution of the firing squad problem in Coq. Research Report LIP RR-2002-14, Laboratoire de l\u2019informatique du parall\u00e9lisme (2002)"},{"key":"1_CR4","unstructured":"Gerken, H.D.: \u00dcber Synchronisationsprobleme bei Zellularautomaten. Diplomarbeit, Institut fur Theoretische Informatik, Technische Universit\u00e4t Braunschweig, 50 (1987)"},{"key":"1_CR5","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. 7495, pp. 101\u2013110. Springer, Heidelberg (2012). https:\/\/doi.org\/10.1007\/978-3-642-33350-7_11"},{"key":"1_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"136","DOI":"10.1007\/978-3-319-11520-7_15","volume-title":"Cellular Automata","author":"L Maignan","year":"2014","unstructured":"Maignan, L., Yun\u00e8s, J.-B.: Experimental finitization of infinite field-based generalized FSSP solution. In: W\u0105s, J., Sirakoulis, G.C., Bandini, S. (eds.) ACRI 2014. LNCS, vol. 8751, pp. 136\u2013145. Springer, Cham (2014). https:\/\/doi.org\/10.1007\/978-3-319-11520-7_15"},{"issue":"1\u20132","key":"1_CR7","first-page":"121","volume":"12","author":"L Maignan","year":"2016","unstructured":"Maignan, L., Yun\u00e8s, J.-B.: Finitization of infinite field-based multi-general FSSP solution. J. Cell. Autom. 12(1\u20132), 121\u2013139 (2016)","journal-title":"J. Cell. Autom."},{"key":"1_CR8","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."},{"issue":"1\u20132","key":"1_CR9","first-page":"131","volume":"15","author":"Tien Thao Nguyen and Luidnel Maignan","year":"2020","unstructured":"Tien Thao Nguyen and Luidnel Maignan: Some cellular fields interrelations and optimizations in FSSP solutions. J. Cell. Autom. 15(1\u20132), 131\u2013146 (2020)","journal-title":"J. Cell. Autom."},{"issue":"3","key":"1_CR10","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. Theor. Comput. Sci. 314(3), 303\u2013334 (2004)","journal-title":"Theor. Comput. Sci."},{"key":"1_CR11","unstructured":"Sanders, P.: Massively parallel search for transition-tables of polyautomata. In: Jesshope, C.R., Jossifov, V., Wilhelmi, W. (eds.) Parcella 1994, VI. International Workshop on Parallel Processing by Cellular Automata and Arrays, Potsdam, Germany, September 21\u201323, 1994. Proceedings. Mathematical Research, vol. 81, pp. 99\u2013108. Akademie Verlag, Berlin (1994)"},{"key":"1_CR12","first-page":"92","volume":"318","author":"H Umeo","year":"2018","unstructured":"Umeo, H., Hirota, M., Nozaki, Y., Imai, K., Sogabe, T.: A new reconstruction and the first implementation of Goto\u2019s FSSP algorithm. Appl. Math. Comput. 318, 92\u2013108 (2018)","journal-title":"Appl. Math. Comput."},{"issue":"4","key":"1_CR13","first-page":"403","volume":"1","author":"H Umeo","year":"2005","unstructured":"Umeo, H., Hisaoka, M., Sogabe, T.: A survey on optimum-time firing squad synchronization algorithms for one-dimensional cellular automata. IJUC 1(4), 403\u2013426 (2005)","journal-title":"IJUC"},{"issue":"1","key":"1_CR14","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(1), 66\u201378 (1966)","journal-title":"Inf. Control"}],"container-title":["Lecture Notes in Computer Science","Cellular Automata and Discrete Complex Systems"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-61588-8_1","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,10,20]],"date-time":"2024-10-20T23:02:46Z","timestamp":1729465366000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-61588-8_1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020]]},"ISBN":["9783030615871","9783030615888"],"references-count":14,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-61588-8_1","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2020]]},"assertion":[{"value":"21 October 2020","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"AUTOMATA","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Workshop on Cellular Automata and Discrete Complex Systems","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Stockholm","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Sweden","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2020","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"10 August 2020","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"12 August 2020","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"26","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"automata2020","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/automata2020.weebly.com\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Single-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"EasyChair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"21","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"11","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"0","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"52% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3-4","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"2-3","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"No","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"The workshop was held virtually.","order":10,"name":"additional_info_on_review_process","label":"Additional Info on Review Process","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}