{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,4]],"date-time":"2026-01-04T02:52:20Z","timestamp":1767495140794,"version":"3.40.3"},"publisher-location":"Cham","reference-count":25,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319559100"},{"type":"electronic","value":"9783319559117"}],"license":[{"start":{"date-parts":[[2017,1,1]],"date-time":"2017-01-01T00:00:00Z","timestamp":1483228800000},"content-version":"unspecified","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":[[2017]]},"DOI":"10.1007\/978-3-319-55911-7_9","type":"book-chapter","created":{"date-parts":[[2017,3,20]],"date-time":"2017-03-20T14:23:37Z","timestamp":1490019817000},"page":"112-128","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["On the Cost of Simulating a Parallel Boolean Automata Network by a Block-Sequential One"],"prefix":"10.1007","author":[{"given":"Florian","family":"Bridoux","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Pierre","family":"Guillon","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"K\u00e9vin","family":"Perrot","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Sylvain","family":"Sen\u00e9","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Guillaume","family":"Theyssier","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2017,3,21]]},"reference":[{"key":"9_CR1","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/j.biosystems.2009.03.006","volume":"97","author":"J Aracena","year":"2009","unstructured":"Aracena, J.: On the robustness of update schedules in boolean networks. Biosystems 97, 1\u20138 (2009)","journal-title":"Biosystems"},{"key":"9_CR2","doi-asserted-by":"crossref","first-page":"1089","DOI":"10.1109\/18.21239","volume":"34","author":"J Bruck","year":"1988","unstructured":"Bruck, J., Goodman, J.W.: A generalized convergence theorem for neural networks. IEEE Trans. Inf. Theor. 34, 1089\u20131092 (1988)","journal-title":"IEEE Trans. Inf. Theor."},{"key":"9_CR3","doi-asserted-by":"crossref","first-page":"3866","DOI":"10.1016\/j.tcs.2011.02.023","volume":"412","author":"M Delorme","year":"2011","unstructured":"Delorme, M., Mazoyer, J., Ollinger, N., Theyssier, G.: Bulking I: an abstract theory of bulking. Theor. Comput. Sci. 412, 3866\u20133880 (2011)","journal-title":"Theor. Comput. Sci."},{"key":"9_CR4","doi-asserted-by":"crossref","first-page":"3881","DOI":"10.1016\/j.tcs.2011.02.024","volume":"412","author":"M Delorme","year":"2011","unstructured":"Delorme, M., Mazoyer, J., Ollinger, N., Theyssier, G.: Bulking II: classifications of cellular automata. Theor. Comput. Sci. 412, 3881\u20133905 (2011)","journal-title":"Theor. Comput. Sci."},{"key":"9_CR5","doi-asserted-by":"crossref","first-page":"27","DOI":"10.1007\/s10441-008-9029-x","volume":"56","author":"J Demongeot","year":"2008","unstructured":"Demongeot, J., Elena, A., Sen\u00e9, S.: Robustness in regulatory networks: a multi-disciplinary approach. Acta Biotheor. 56, 27\u201349 (2008)","journal-title":"Acta Biotheor."},{"doi-asserted-by":"crossref","unstructured":"Doty, D., Lutz, J.H., Patitz, M.J., Schweller, R.T., Summers, S.M., Woods, D.: The tile assembly model is intrinsically universal. In: Proceedings of FOCS 2012, pp. 302\u2013310. IEEE Computer Society (2012)","key":"9_CR6","DOI":"10.1109\/FOCS.2012.76"},{"key":"9_CR7","doi-asserted-by":"crossref","DOI":"10.1007\/978-94-009-0529-0","volume-title":"Neural and Automata Networks: Dynamical Behavior and Applications","author":"E Goles","year":"1990","unstructured":"Goles, E., Mart\u00ednez, S.: Neural and Automata Networks: Dynamical Behavior and Applications. Kluwer Academic Publishers, Dordrecht (1990)"},{"doi-asserted-by":"crossref","unstructured":"Goles, E., Matamala, M.: Computing complexity of symmetric quadratic neural networks. In: Proceedings of ICANN 1993, p. 677 (1993)","key":"9_CR8","DOI":"10.1007\/978-1-4471-2063-6_185"},{"key":"9_CR9","doi-asserted-by":"crossref","first-page":"646","DOI":"10.1016\/j.aam.2011.11.009","volume":"48","author":"E Goles","year":"2012","unstructured":"Goles, E., Noual, M.: Disjunctive networks and update schedules. Adv. Appl. Math. 48, 646\u2013662 (2012)","journal-title":"Adv. Appl. Math."},{"key":"9_CR10","doi-asserted-by":"crossref","first-page":"247","DOI":"10.1016\/j.tcs.2007.09.008","volume":"396","author":"E Goles","year":"2008","unstructured":"Goles, E., Salinas, L.: Comparison between parallel and serial dynamics of boolean networks. Theor. Comput. Sci. 396, 247\u2013253 (2008)","journal-title":"Theor. Comput. Sci."},{"doi-asserted-by":"crossref","unstructured":"Guillon, P.: Projective subdynamics and universal shifts. In: DMTCS Proceedings of AUTOMATA 2011, pp. 123\u2013134 (2011)","key":"9_CR11","DOI":"10.46298\/dmtcs.2969"},{"key":"9_CR12","doi-asserted-by":"crossref","first-page":"2554","DOI":"10.1073\/pnas.79.8.2554","volume":"79","author":"JJ Hopfield","year":"1982","unstructured":"Hopfield, J.J.: Neural networks and physical systems with emergent collective computational abilities. Proc. Nat. Acad. Sci. USA 79, 2554\u20132558 (1982)","journal-title":"Proc. Nat. Acad. Sci. USA"},{"key":"9_CR13","doi-asserted-by":"crossref","first-page":"145","DOI":"10.1016\/S0070-2153(08)60640-7","volume":"6","author":"S Kauffman","year":"1971","unstructured":"Kauffman, S.: Gene regulation networks: a theory for their global structures and behaviors. Curr. Top. Dev. Biol. 6, 145\u2013181 (1971). Springer","journal-title":"Curr. Top. Dev. Biol."},{"key":"9_CR14","doi-asserted-by":"crossref","first-page":"437","DOI":"10.1016\/0022-5193(69)90015-0","volume":"22","author":"SA Kauffman","year":"1969","unstructured":"Kauffman, S.A.: Metabolic stability and epigenesis in randomly constructed genetic nets. J. Theor. Biol. 22, 437\u2013467 (1969)","journal-title":"J. Theor. Biol."},{"key":"9_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"367","DOI":"10.1007\/978-3-540-70918-3_32","volume-title":"STACS 2007","author":"G Lafitte","year":"2007","unstructured":"Lafitte, G., Weiss, M.: Universal tilings. In: Thomas, W., Weil, P. (eds.) STACS 2007. LNCS, vol. 4393, pp. 367\u2013380. Springer, Heidelberg (2007). doi: 10.1007\/978-3-540-70918-3_32"},{"key":"9_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"271","DOI":"10.1007\/978-3-642-02017-9_30","volume-title":"Theory and Applications of Models of Computation","author":"G Lafitte","year":"2009","unstructured":"Lafitte, G., Weiss, M.: An almost totally universal tile set. In: Chen, J., Cooper, S.B. (eds.) TAMC 2009. LNCS, vol. 5532, pp. 271\u2013280. Springer, Heidelberg (2009). doi: 10.1007\/978-3-642-02017-9_30"},{"key":"9_CR17","doi-asserted-by":"crossref","first-page":"115","DOI":"10.1007\/BF02478259","volume":"5","author":"WS McCulloch","year":"1943","unstructured":"McCulloch, W.S., Pitts, W.: A logical calculus of the ideas immanent in nervous activity. J. Math. Biophys. 5, 115\u2013133 (1943)","journal-title":"J. Math. Biophys."},{"key":"9_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"124","DOI":"10.1007\/978-3-642-40867-0_9","volume-title":"Cellular Automata and Discrete Complex Systems","author":"T Melliti","year":"2013","unstructured":"Melliti, T., Regnault, D., Richard, A., Sen\u00e9, S.: On the convergence of boolean automata networks without negative cycles. In: Kari, J., Kutrib, M., Malcher, A. (eds.) AUTOMATA 2013. LNCS, vol. 8155, pp. 124\u2013138. Springer, Heidelberg (2013). doi: 10.1007\/978-3-642-40867-0_9"},{"key":"9_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"182","DOI":"10.1007\/978-3-319-44365-2_18","volume-title":"Cellular Automata","author":"T Melliti","year":"2016","unstructured":"Melliti, T., Regnault, D., Richard, A., Sen\u00e9, S.: Asynchronous simulation of boolean networks by monotone boolean networks. In: El Yacoubi, S., W\u0105s, J., Bandini, S. (eds.) ACRI 2016. LNCS, vol. 9863, pp. 182\u2013191. Springer, Cham (2016). doi: 10.1007\/978-3-319-44365-2_18"},{"unstructured":"Noual, M.: Updating automata networks. Ph.D. thesis, \u00c9cole Normale Sup\u00e9rieure de Lyon (2012)","key":"9_CR20"},{"key":"9_CR21","doi-asserted-by":"crossref","first-page":"12","DOI":"10.1016\/j.tcs.2012.05.034","volume":"504","author":"M Noual","year":"2013","unstructured":"Noual, M., Regnault, D., Sen\u00e9, S.: About non-monotony in boolean automata networks. Theor. Comput. Sci. 504, 12\u201325 (2013)","journal-title":"Theor. Comput. Sci."},{"key":"9_CR22","doi-asserted-by":"crossref","first-page":"189","DOI":"10.1007\/978-3-540-92910-9_6","volume-title":"Handbook of Natural Computing","author":"N Ollinger","year":"2012","unstructured":"Ollinger, N.: Universalities in cellular automata. In: Rozenberg, G., et al. (eds.) Handbook of Natural Computing, pp. 189\u2013229. Springer, Heidelberg (2012)"},{"key":"9_CR23","doi-asserted-by":"crossref","first-page":"123","DOI":"10.1016\/S0304-3975(96)00017-5","volume":"174","author":"P Orponen","year":"1997","unstructured":"Orponen, P.: Computing with truly asynchronous threshold logic networks. Theor. Comput. Sci. 174, 123\u2013136 (1997)","journal-title":"Theor. Comput. Sci."},{"key":"9_CR24","doi-asserted-by":"crossref","first-page":"135","DOI":"10.1016\/0304-3975(86)90091-5","volume":"48","author":"M Tchuente","year":"1986","unstructured":"Tchuente, M.: Sequential simulation of parallel iterations and applications. Theor. Comput. Sci. 48, 135\u2013144 (1986)","journal-title":"Theor. Comput. Sci."},{"key":"9_CR25","doi-asserted-by":"crossref","first-page":"563","DOI":"10.1016\/0022-5193(73)90247-6","volume":"42","author":"R Thomas","year":"1973","unstructured":"Thomas, R.: Boolean formalization of genetic control circuits. J. Theor. Biol. 42, 563\u2013585 (1973)","journal-title":"J. Theor. Biol."}],"container-title":["Lecture Notes in Computer Science","Theory and Applications of Models of Computation"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-55911-7_9","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,8,22]],"date-time":"2023-08-22T18:42:08Z","timestamp":1692729728000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-55911-7_9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017]]},"ISBN":["9783319559100","9783319559117"],"references-count":25,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-55911-7_9","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2017]]}}}