{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,19]],"date-time":"2025-09-19T08:57:35Z","timestamp":1758272255821},"publisher-location":"Berlin, Heidelberg","reference-count":12,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540958840"},{"type":"electronic","value":"9783540958857"}],"license":[{"start":{"date-parts":[[2009,1,1]],"date-time":"2009-01-01T00:00:00Z","timestamp":1230768000000},"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":[[2009]]},"DOI":"10.1007\/978-3-540-95885-7_9","type":"book-chapter","created":{"date-parts":[[2009,1,14]],"date-time":"2009-01-14T23:07:19Z","timestamp":1231974439000},"page":"118-128","source":"Crossref","is-referenced-by-count":7,"title":["Fast Synchronization in P Systems"],"prefix":"10.1007","author":[{"given":"Artiom","family":"Alhazov","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Maurice","family":"Margenstern","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Sergey","family":"Verlan","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"unstructured":"Bernardini, F., Gheorghe, M., Margenstern, M., Verlan, S.: How to synchronize the activity of all components of a P system? In: Vaszil, G. (ed.) Proc. Intern. Workshop Automata for Cellular and Molecular Computing, MTA SZTAKI, Budapest, Hungary, pp. 11\u201322 (2007)","key":"9_CR1"},{"unstructured":"Goto, E.: A minimum time solution of the firing squad problem. Harward Univ. Course Notes for Applied Mathematics, 298 (1962)","key":"9_CR2"},{"key":"9_CR3","doi-asserted-by":"publisher","first-page":"48","DOI":"10.1090\/S0002-9939-1956-0078686-7","volume":"7","author":"J.B. Kruskal","year":"1956","unstructured":"Kruskal, J.B.: On the shortest spanning subtree of a graph and the traveling salesman problem. Proc. American Mathematical Society\u00a07, 48\u201350 (1956)","journal-title":"Proc. American Mathematical Society"},{"key":"9_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. Theoretical Science\u00a050, 183\u2013238 (1987)","journal-title":"Theoretical Science"},{"key":"9_CR5","volume-title":"Computation: Finite and Infinite Machines","author":"M. Minsky","year":"1967","unstructured":"Minsky, M.: Computation: Finite and Infinite Machines. Prentice-Hall, Englewood Cliffs (1967)"},{"key":"9_CR6","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-56196-2","volume-title":"Membrane Computing. An Introduction","author":"G. P\u0103un","year":"2002","unstructured":"P\u0103un, G.: Membrane Computing. An Introduction. Springer, Heidelberg (2002)"},{"key":"9_CR7","doi-asserted-by":"publisher","first-page":"1389","DOI":"10.1002\/j.1538-7305.1957.tb01515.x","volume":"36","author":"R.C. Prim","year":"1957","unstructured":"Prim, R.C.: Shortest connection networks and some generalizations. Bell System Technical Journal\u00a036, 1389\u20131401 (1957)","journal-title":"Bell System Technical Journal"},{"key":"9_CR8","doi-asserted-by":"publisher","first-page":"270","DOI":"10.1016\/j.tibtech.2004.04.010","volume":"22","author":"P.T. Spellman","year":"2004","unstructured":"Spellman, P.T., Sherlock, G.: Reply whole-cell synchronization - effective tools for cell cycle studies. Trends in Biotechnology\u00a022, 270\u2013273 (2004)","journal-title":"Trends in Biotechnology"},{"key":"9_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"69","DOI":"10.1007\/3-540-45830-1_7","volume-title":"Cellular Automata","author":"H. Umeo","year":"2002","unstructured":"Umeo, H., Maeda, M., Fujiwara, N.: An efficient mapping scheme for embedding any one-dimensional firing squad synchronization algorithm onto two-dimensional arrays. In: Bandini, S., Chopard, B., Tomassini, M. (eds.) ACRI 2002. LNCS, vol.\u00a02493, pp. 69\u201381. Springer, Heidelberg (2002)"},{"doi-asserted-by":"crossref","unstructured":"Schmid, H., Worsch, T.: The firing squad synchronization problem with many generals for one-dimensional CA. In: Proc. IFIP TCS 2004, pp. 111\u2013124 (2004)","key":"9_CR10","DOI":"10.1007\/1-4020-8141-3_11"},{"key":"9_CR11","doi-asserted-by":"publisher","first-page":"313","DOI":"10.1016\/0304-3975(94)90045-0","volume":"127","author":"J.-B. Yun\u00e8s","year":"1994","unstructured":"Yun\u00e8s, J.-B.: Seven-state solution to the firing squad synchronization problem. Theoretical Computer Sci.\u00a0127, 313\u2013332 (1994)","journal-title":"Theoretical Computer Sci."},{"unstructured":"The P systems web page, \n                    \n                      http:\/\/ppage.psystems.eu","key":"9_CR12"}],"container-title":["Lecture Notes in Computer Science","Membrane Computing"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-95885-7_9","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,3,4]],"date-time":"2019-03-04T17:30:36Z","timestamp":1551720636000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-95885-7_9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009]]},"ISBN":["9783540958840","9783540958857"],"references-count":12,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-95885-7_9","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2009]]}}}