{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,19]],"date-time":"2025-09-19T08:26:34Z","timestamp":1758270394264},"reference-count":21,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2011,8,17]],"date-time":"2011-08-17T00:00:00Z","timestamp":1313539200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Nat Comput"],"published-print":{"date-parts":[[2012,3]]},"DOI":"10.1007\/s11047-011-9271-z","type":"journal-article","created":{"date-parts":[[2011,8,17]],"date-time":"2011-08-17T15:53:40Z","timestamp":1313596420000},"page":"107-115","source":"Crossref","is-referenced-by-count":7,"title":["Faster synchronization in P systems"],"prefix":"10.1007","volume":"11","author":[{"given":"Michael J.","family":"Dinneen","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yun-Bum","family":"Kim","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Radu","family":"Nicolescu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2011,8,17]]},"reference":[{"key":"9271_CR1","unstructured":"Alhazov A, Margenstern M, Verlan S (2008) Fast synchronization in P systems. In: Corne DW, Frisco P, P\u0103un G, Rozenberg G, Salomaa A (eds) Workshop on membrane computing, volume 5391 of Lecture notes in computer science. Springer, New York, pp 118\u2013128"},{"issue":"1","key":"9271_CR2","doi-asserted-by":"crossref","first-page":"22","DOI":"10.1016\/S0019-9958(67)90032-0","volume":"10","author":"R Balzer","year":"1967","unstructured":"Balzer R (1967) An 8-state minimal time solution to the firing squad synchronization problem. Inf Control 10(1):22\u201342","journal-title":"Inf Control"},{"issue":"5","key":"9271_CR3","doi-asserted-by":"crossref","first-page":"1183","DOI":"10.1142\/S0129054108006224","volume":"19","author":"F Bernardini","year":"2008","unstructured":"Bernardini F, Gheorghe M, Margenstern M, Verlan S (2008) How to synchronize the activity of all components of a P system? Int J Found Comput Sci 19(5):1183\u20131198","journal-title":"Int J Found Comput Sci"},{"key":"9271_CR5","doi-asserted-by":"crossref","first-page":"107","DOI":"10.4204\/EPTCS.11.7","volume":"11","author":"MJ Dinneen","year":"2009","unstructured":"Dinneen MJ, Kim Y-B, Nicolescu R (2009) New solutions to the firing squad synchronization problems for neural and hyperdag P systems. Electron Proc Theor Comput Sci 11:107\u2013122","journal-title":"Electron Proc Theor Comput Sci"},{"key":"9271_CR6","doi-asserted-by":"crossref","first-page":"121","DOI":"10.4204\/EPTCS.40.9","volume":"40","author":"MJ Dinneen","year":"2010","unstructured":"Dinneen MJ, Kim Y-B, Nicolescu R (2010a) Edge- and node-disjoint paths in P systems. Electron Proc Theor Comput Sci 40:121\u2013141","journal-title":"Electron Proc Theor Comput Sci"},{"issue":"6","key":"9271_CR7","doi-asserted-by":"crossref","first-page":"334","DOI":"10.1016\/j.jlap.2010.03.004","volume":"79","author":"MJ Dinneen","year":"2010","unstructured":"Dinneen MJ, Kim Y-B, Nicolescu R (2010b) P systems and the Byzantine agreement. J Log Algebr Program 79(6):334\u2013349","journal-title":"J Log Algebr Program"},{"key":"9271_CR8","doi-asserted-by":"crossref","unstructured":"Dinneen MJ, Kim Y-B, Nicolescu R (2010c) Synchronization in P modules. In: Calude CS, Hagiya M, Morita K, Rozenberg G, Timmis J (eds) Unconventional computation, volume 6079 of Lecture notes in computer science. Springer, Berlin, pp 32\u201344","DOI":"10.1007\/978-3-642-13523-1_7"},{"key":"9271_CR9","doi-asserted-by":"crossref","DOI":"10.1002\/0471720941","volume-title":"Fundamentals of telecommunications, 2nd edn","author":"RL Freeman","year":"2005","unstructured":"Freeman RL (2005) Fundamentals of telecommunications, 2nd edn. Wiley-IEEE Press, New York"},{"key":"9271_CR10","unstructured":"Goto E (1962) A minimal time solution of the firing squad problem. Course notes for applied mathematics, vol 298. Harvard University, Cambridge, pp 52\u201359"},{"issue":"1","key":"9271_CR11","doi-asserted-by":"crossref","first-page":"139","DOI":"10.1016\/0022-0000(83)90025-9","volume":"26","author":"JJ Grefenstette","year":"1983","unstructured":"Grefenstette JJ (1983) Network structure and the firing squad synchronization problem. J Comput Syst Sci 26(1):139\u2013152","journal-title":"J Comput Syst Sci"},{"key":"9271_CR12","volume-title":"Cell cycle control: mechanisms and protocols","author":"TC Humphrey","year":"2005","unstructured":"Humphrey TC (2005) Cell cycle control: mechanisms and protocols. Humana Press, Totowa"},{"issue":"1\u20133","key":"9271_CR13","first-page":"133","volume":"52","author":"K Imai","year":"2002","unstructured":"Imai K, Morita K, Sako K (2002) Firing squad synchronization problem in number-conserving cellular automata. Fundam Inform 52(1\u20133):133\u2013141","journal-title":"Fundam Inform"},{"key":"9271_CR14","doi-asserted-by":"crossref","unstructured":"Kobayashi K and Goldstein D (2005) On formulations of firing squad synchronization problems. In: Calude CS, Dinneen MJ, P\u0103un G, P\u00e9rez-Jim\u00e9nez MJ, Rozenberg G (eds) Unconventional computation, 4th international conference, UC 2005, Sevilla, Spain, October 3\u20137, 2005, proceedings, volume 3699 of Lecture notes in computer science. Springer, New York, pp 157\u2013168","DOI":"10.1007\/11560319_15"},{"key":"9271_CR15","doi-asserted-by":"crossref","first-page":"183","DOI":"10.1016\/0304-3975(87)90124-1","volume":"50","author":"J Mazoyer","year":"1987","unstructured":"Mazoyer J (1987) A six-state minimal time solution to the firing squad synchronization problem. Theor Comput Sci 50:183\u2013238","journal-title":"Theor Comput Sci"},{"key":"9271_CR16","unstructured":"Moore EF (1964) The firing squad synchronization problem. In: Moore EF (ed) Sequential machines, selected papers. Addison-Wesley, Reading, pp 213\u2013214"},{"key":"9271_CR17","doi-asserted-by":"crossref","first-page":"39","DOI":"10.1016\/0304-3975(81)90004-9","volume":"14","author":"Y Nishitani","year":"1981","unstructured":"Nishitani Y, Honda N (1981) The firing squad synchronization problem for graphs. Theor Comput Sci 14:39\u201361","journal-title":"Theor Comput Sci"},{"key":"9271_CR18","first-page":"1","volume-title":"Applications of membrane computing. Natural computing series","author":"G P\u0103un","year":"2006","unstructured":"P\u0103un G (2006) Introduction to membrane computing. In: Ciobanu G, P\u00e9rez-Jim\u00e9nez MJ, P\u0103un G (eds) Applications of membrane computing. Natural computing series. Springer, New York, pp 1\u201342"},{"key":"9271_CR19","first-page":"111","volume-title":"IFIP TCS","author":"H Schmid","year":"2004","unstructured":"Schmid H, Worsch T (2004) The firing squad synchronization problem with many generals for one-dimensional CA. In: L\u00e9vy J-J, Mayr EW, Mitchell JC (eds) IFIP TCS. Kluwer, Dordrecht, pp 111\u2013124"},{"issue":"3","key":"9271_CR20","doi-asserted-by":"crossref","first-page":"305","DOI":"10.1016\/0304-3975(82)90040-8","volume":"19","author":"H Szwerinski","year":"1982","unstructured":"Szwerinski H (1982) Time-optimal solution of the firing-squad-synchronization-problem for n-dimensional rectangles with the general at an arbitrary position. Theor Comput Sci 19(3):305\u2013320","journal-title":"Theor Comput Sci"},{"key":"9271_CR21","doi-asserted-by":"crossref","unstructured":"Umeo H, Hisaoka M, Akiguchi S (2005) A twelve-state optimum-time synchronization algorithm for two-dimensional rectangular cellular arrays. In: Calude CS, Dinneen MJ, P\u0103un G, P\u00e9rez-Jim\u00e9nez MJ, Rozenberg G (eds) Unconventional computation, 4th international conference, UC 2005, Sevilla, Spain, October 3\u20137, 2005, proceedings, volume 3699 of Lecture notes in computer science. Springer, New York, pp 214\u2013223","DOI":"10.1007\/11560319_20"},{"issue":"1","key":"9271_CR22","doi-asserted-by":"crossref","first-page":"66","DOI":"10.1016\/S0019-9958(66)90110-0","volume":"9","author":"A Waksman","year":"1966","unstructured":"Waksman A (1966) An optimum solution to the firing squad synchronization problem. Inf Control 9(1):66\u201378","journal-title":"Inf Control"}],"container-title":["Natural Computing"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11047-011-9271-z.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s11047-011-9271-z\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11047-011-9271-z","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,14]],"date-time":"2019-06-14T04:20:33Z","timestamp":1560486033000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s11047-011-9271-z"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011,8,17]]},"references-count":21,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2012,3]]}},"alternative-id":["9271"],"URL":"https:\/\/doi.org\/10.1007\/s11047-011-9271-z","relation":{},"ISSN":["1567-7818","1572-9796"],"issn-type":[{"value":"1567-7818","type":"print"},{"value":"1572-9796","type":"electronic"}],"subject":[],"published":{"date-parts":[[2011,8,17]]}}}