{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,4]],"date-time":"2026-01-04T02:49:46Z","timestamp":1767494986832},"publisher-location":"Cham","reference-count":21,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319443645"},{"type":"electronic","value":"9783319443652"}],"license":[{"start":{"date-parts":[[2016,1,1]],"date-time":"2016-01-01T00:00:00Z","timestamp":1451606400000},"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":[[2016]]},"DOI":"10.1007\/978-3-319-44365-2_18","type":"book-chapter","created":{"date-parts":[[2016,8,29]],"date-time":"2016-08-29T13:39:38Z","timestamp":1472477978000},"page":"182-191","source":"Crossref","is-referenced-by-count":6,"title":["Asynchronous Simulation of Boolean Networks by Monotone Boolean Networks"],"prefix":"10.1007","author":[{"given":"Tarek","family":"Melliti","sequence":"first","affiliation":[]},{"given":"Damien","family":"Regnault","sequence":"additional","affiliation":[]},{"given":"Adrien","family":"Richard","sequence":"additional","affiliation":[]},{"given":"Sylvain","family":"Sen\u00e9","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2016,8,30]]},"reference":[{"issue":"4","key":"18_CR1","doi-asserted-by":"crossref","first-page":"1204","DOI":"10.1109\/18.850663","volume":"46","author":"R Ahlswede","year":"2000","unstructured":"Ahlswede, R., Cai, N., Li, S.Y., Yeung, R.: Network information flow. IEEE Trans. Inf. Theory 46(4), 1204\u20131216 (2000)","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"5","key":"18_CR2","doi-asserted-by":"crossref","first-page":"1398","DOI":"10.1007\/s11538-008-9304-7","volume":"70","author":"J Aracena","year":"2008","unstructured":"Aracena, J.: Maximum number of fixed points in regulatory Boolean networks. Bull. Math. Biol. 70(5), 1398\u20131409 (2008)","journal-title":"Bull. Math. Biol."},{"issue":"Suppl 1","key":"18_CR3","doi-asserted-by":"crossref","first-page":"S85","DOI":"10.1098\/rsif.2008.0132.focus","volume":"5","author":"S Bornholdt","year":"2008","unstructured":"Bornholdt, S.: Boolean network models of cellular regulation: prospects and limitations. J. R. Soc. Interface 5(Suppl 1), S85\u2013S94 (2008)","journal-title":"J. R. Soc. Interface"},{"issue":"1","key":"18_CR4","doi-asserted-by":"crossref","first-page":"R23","DOI":"10.37236\/1640","volume":"9","author":"C Domshlak","year":"2002","unstructured":"Domshlak, C.: On recursively directed hypercubes. Electron. J. Comb. 9(1), R23 (2002)","journal-title":"Electron. J. Comb."},{"key":"18_CR5","unstructured":"Gadouleau, M., Richard, A., Fanchon, E.: Reduction and fixed points of Boolean networks and linear network coding solvability. ArXiv e-prints, December 2014"},{"issue":"4","key":"18_CR6","doi-asserted-by":"crossref","first-page":"2312","DOI":"10.1137\/140988358","volume":"29","author":"M Gadouleau","year":"2015","unstructured":"Gadouleau, M., Richard, A., Riis, S.: Fixed points of Boolean networks, guessing graphs, and coding theory. SIAM J. Discrete Math. 29(4), 2312\u20132335 (2015)","journal-title":"SIAM J. Discrete Math."},{"key":"18_CR7","doi-asserted-by":"crossref","first-page":"2554","DOI":"10.1073\/pnas.79.8.2554","volume":"79","author":"J Hopfield","year":"1982","unstructured":"Hopfield, J.: Neural networks and physical systems with emergent collective computational abilities. Proc. Nat. Acad. Sci. U.S.A. 79, 2554\u20132558 (1982)","journal-title":"Proc. Nat. Acad. Sci. U.S.A."},{"issue":"2","key":"18_CR8","doi-asserted-by":"crossref","first-page":"237","DOI":"10.1016\/j.tcs.2004.03.010","volume":"322","author":"A Julio","year":"2004","unstructured":"Julio, A., Demongeot, J., Goles, E.: On limit cycles of monotone functions with symmetric connection graph. Theoret. Comput. Sci. 322(2), 237\u2013244 (2004)","journal-title":"Theoret. Comput. Sci."},{"key":"18_CR9","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 connected nets. J. Theor. Biol. 22, 437\u2013467 (1969)","journal-title":"J. Theor. Biol."},{"key":"18_CR10","doi-asserted-by":"crossref","DOI":"10.1093\/oso\/9780195079517.001.0001","volume-title":"Origins of Order Self-Organization and Selection in Evolution","author":"SA Kauffman","year":"1993","unstructured":"Kauffman, S.A.: Origins of Order Self-Organization and Selection in Evolution. Oxford University Press, Oxford (1993)"},{"issue":"1","key":"18_CR11","doi-asserted-by":"crossref","first-page":"51","DOI":"10.1109\/TIT.1986.1057136","volume":"32","author":"DE Knuth","year":"1986","unstructured":"Knuth, D.E.: Efficient balanced codes. IEEE Trans. Inf. Theory 32(1), 51\u201353 (1986)","journal-title":"IEEE Trans. Inf. Theory"},{"key":"18_CR12","doi-asserted-by":"crossref","first-page":"146","DOI":"10.1038\/nrg3885","volume":"16","author":"N Nov\u00e8re Le","year":"2015","unstructured":"Le Nov\u00e8re, N.: Quantitative and logic modelling of molecular and gene networks. Nat. Rev. Genet. 16, 146\u2013158 (2015)","journal-title":"Nat. Rev. Genet."},{"key":"18_CR13","first-page":"113","volume":"5","author":"WS MacCulloch","year":"1943","unstructured":"MacCulloch, W.S., Pitts, W.S.: A logical calculus of the ideas immanent in nervous activity. Bull. Math. Bio. Phys. 5, 113\u2013115 (1943)","journal-title":"Bull. Math. Bio. Phys."},{"key":"18_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","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)"},{"issue":"3","key":"18_CR15","doi-asserted-by":"crossref","first-page":"335","DOI":"10.1016\/j.aam.2007.11.003","volume":"41","author":"E Remy","year":"2008","unstructured":"Remy, E., Ruet, P., Thieffry, D.: Graphic requirements for multistability and attractive cycles in a Boolean dynamical framework. Adv. Appl. Math. 41(3), 335\u2013350 (2008)","journal-title":"Adv. Appl. Math."},{"issue":"4","key":"18_CR16","doi-asserted-by":"crossref","first-page":"378","DOI":"10.1016\/j.aam.2009.11.011","volume":"44","author":"A Richard","year":"2010","unstructured":"Richard, A.: Negative circuits and sustained oscillations in asynchronous automata networks. Adv. Appl. Math. 44(4), 378\u2013392 (2010)","journal-title":"Adv. Appl. Math."},{"key":"18_CR17","doi-asserted-by":"crossref","unstructured":"Robert, F.: Discrete Iterations: A Metric Study. Series in Computational Mathematics, vol. 6, p. 198. Springer, Heidelberg (1986)","DOI":"10.1007\/978-3-642-61607-5"},{"key":"18_CR18","unstructured":"Robert, F.: Les syst\u00e8mes dynamiques discrets. Math\u00e9matiques et Applications, vol. 19, p. 296. Springer, Heidelberg (1995)"},{"issue":"3","key":"18_CR19","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(3), 563\u2013585 (1973)","journal-title":"J. Theor. Biol."},{"key":"18_CR20","volume-title":"Biological Feedback","author":"R Thomas","year":"1990","unstructured":"Thomas, R., d\u2019Ari, R.: Biological Feedback. CRC Press, Boca Raton (1990)"},{"issue":"1","key":"18_CR21","first-page":"180","volume":"11","author":"R Thomas","year":"2001","unstructured":"Thomas, R., Kaufman, M.: Multistationarity, the basis of cell differentiation and memory. II. Logical analysis of regulatory networks in terms of feedback circuits. Chaos: an Interdisciplinary. J. Nonlinear Sci. 11(1), 180\u2013195 (2001)","journal-title":"J. Nonlinear Sci."}],"container-title":["Lecture Notes in Computer Science","Cellular Automata"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-44365-2_18","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,6,19]],"date-time":"2024-06-19T03:17:01Z","timestamp":1718767021000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-44365-2_18"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016]]},"ISBN":["9783319443645","9783319443652"],"references-count":21,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-44365-2_18","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2016]]}}}