{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,9]],"date-time":"2024-09-09T06:52:08Z","timestamp":1725864728571},"publisher-location":"Cham","reference-count":19,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319459936"},{"type":"electronic","value":"9783319459943"}],"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-45994-3_10","type":"book-chapter","created":{"date-parts":[[2016,9,12]],"date-time":"2016-09-12T09:41:04Z","timestamp":1473673264000},"page":"134-147","source":"Crossref","is-referenced-by-count":1,"title":["Compositional Analysis of Boolean Networks Using Local Fixed-Point Iterations"],"prefix":"10.1007","author":[{"given":"Adrien","family":"Le Co\u00ebnt","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Laurent","family":"Fribourg","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Romain","family":"Soulat","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2016,9,13]]},"reference":[{"issue":"5","key":"10_CR1","doi-asserted-by":"crossref","first-page":"1410","DOI":"10.1109\/TCBB.2012.87","volume":"9","author":"T Akutsu","year":"2012","unstructured":"Akutsu, T., Kosub, S., Melkman, A.A., Tamura, T.: Finding a periodic attractor of a Boolean network. IEEE\/ACM Trans. Comput. Biol. Bioinform. 9(5), 1410\u20131421 (2012)","journal-title":"IEEE\/ACM Trans. Comput. Biol. Bioinform."},{"key":"10_CR2","doi-asserted-by":"crossref","unstructured":"Biere, A., Cimatti, A., Clarke, E.M., Fujita, M., Zhu, Y.: Symbolic model checking using SAT procedures instead of BDDs. In: DAC, pp. 317\u2013320 (1999). http:\/\/doi.acm.org\/10.1145\/309847.309942","DOI":"10.1109\/DAC.1999.781333"},{"issue":"8","key":"10_CR3","doi-asserted-by":"crossref","first-page":"677","DOI":"10.1109\/TC.1986.1676819","volume":"100","author":"RE Bryant","year":"1986","unstructured":"Bryant, R.E.: Graph-based algorithms for Boolean function manipulation. IEEE Trans. Comput. 100(8), 677\u2013691 (1986)","journal-title":"IEEE Trans. Comput."},{"issue":"10","key":"10_CR4","doi-asserted-by":"crossref","first-page":"2251","DOI":"10.1109\/TAC.2010.2043294","volume":"55","author":"D Cheng","year":"2010","unstructured":"Cheng, D., Qi, H.: A linear representation of dynamics of Boolean networks. IEEE Trans. Autom. Control 55(10), 2251\u20132258 (2010)","journal-title":"IEEE Trans. Autom. Control"},{"key":"10_CR5","doi-asserted-by":"crossref","unstructured":"Cheng, D., Qi, H., Zhao, Y.: On Boolean control networks - an algebraic approach. In: Proceedings of the 18th IFAC World Congress, Milano, pp. 8366\u20138377 (2011)","DOI":"10.3182\/20110828-6-IT-1002.00161"},{"key":"10_CR6","series-title":"NATO ASI Series F","volume-title":"Calculational System Design","author":"P Cousot","year":"1999","unstructured":"Cousot, P.: The calculational design of a generic abstract interpreter. In: Broy, M., Steinbr\u00fcggen, R. (eds.) Calculational System Design. NATO ASI Series F. IOS Press, Amsterdam (1999)"},{"key":"10_CR7","unstructured":"Cousot, P.: Compositional separate modular static analysis of programs by abstract interpretation. In: Proceedings of SSGRR - Advances in Infrastructure for Electronic Business, Science, and Education on the Internet, pp. 6\u201310 (2001)"},{"issue":"3","key":"10_CR8","doi-asserted-by":"crossref","first-page":"201","DOI":"10.1145\/321033.321034","volume":"7","author":"M Davis","year":"1960","unstructured":"Davis, M., Putnam, H.: A computing procedure for quantification theory. J. ACM 7(3), 201\u2013215 (1960). http:\/\/doi.acm.org\/10.1145\/321033.321034","journal-title":"J. ACM"},{"issue":"5","key":"10_CR9","doi-asserted-by":"crossref","first-page":"1393","DOI":"10.1109\/TCBB.2010.20","volume":"8","author":"E Dubrova","year":"2011","unstructured":"Dubrova, E., Teslenko, M.: A SAT-based algorithm for finding attractors in synchronous Boolean networks. IEEE\/ACM Trans. Comput. Biol. Bioinform. (TCBB) 8(5), 1393\u20131399 (2011)","journal-title":"IEEE\/ACM Trans. Comput. Biol. Bioinform. (TCBB)"},{"key":"10_CR10","unstructured":"Fokkink, W., Hollingshead, P., Groote, J., Luttik, S., van Wamel, J.: Verification of interlockings: from control tables to ladder logic diagrams. In: Proceedings of FMICS, vol. 98, pp. 171\u2013185 (1998)"},{"key":"10_CR11","unstructured":"Greenberg, B.S.: NXSYS, Signaling and Interlocking Simulator. http:\/\/www.nycsubway.org\/wiki\/NXSYS,_Signalling_and_Interlocking_Simulator"},{"issue":"4","key":"10_CR12","doi-asserted-by":"crossref","first-page":"e94258","DOI":"10.1371\/journal.pone.0094258","volume":"9","author":"W Guo","year":"2014","unstructured":"Guo, W., Yang, G., Wu, W., He, L., Sun, M.: A parallel attractor finding algorithm based on Boolean satisfiability for genetic regulatory networks. PLoS ONE 9(4), e94258 (2014)","journal-title":"PLoS ONE"},{"issue":"8","key":"10_CR13","doi-asserted-by":"crossref","first-page":"2525","DOI":"10.1016\/j.automatica.2013.05.004","volume":"49","author":"G Hochma","year":"2013","unstructured":"Hochma, G., Margaliot, M., Fornasini, E., Valcher, M.E.: Symbolic dynamics of Boolean control networks. Automatica 49(8), 2525\u20132530 (2013)","journal-title":"Automatica"},{"key":"10_CR14","doi-asserted-by":"publisher","unstructured":"Hong, C., Hwang, J., Cho, K.-H., Shin, I.: An efficient steady-state analysis method for large boolean networks with high maximum node connectivity. PLoS ONE 10(12) (2015).doi: 10.1371\/journal.pone.0145734","DOI":"10.1371\/journal.pone.0145734"},{"key":"10_CR15","doi-asserted-by":"crossref","DOI":"10.1093\/oso\/9780195079517.001.0001","volume-title":"The Origins of Order: Self Organization and Selection in Evolution","author":"SA Kauffman","year":"1993","unstructured":"Kauffman, S.A.: The Origins of Order: Self Organization and Selection in Evolution. Oxford University Press, New York (1993). http:\/\/opac.inria.fr\/record=b1077782"},{"key":"10_CR16","unstructured":"Kuncak, V., Rustan, K. Leino, M.: On computing the fixpoint of a set of Boolean equations (2004). http:\/\/arXiv.org\/abs\/cs.PL\/0408045"},{"key":"10_CR17","series-title":"Lecture Notes in Computer Science (Lecture Notes in Bioinformatics)","doi-asserted-by":"crossref","first-page":"233","DOI":"10.1007\/978-3-540-75140-3_16","volume-title":"Computational Methods in Systems Biology","author":"A Naldi","year":"2007","unstructured":"Naldi, A., Thieffry, D., Chaouiya, C.: Decision diagrams for the representation and analysis of logical models of genetic networks. In: Calder, M., Gilmore, S. (eds.) CMSB 2007. LNCS (LNBI), vol. 4695, pp. 233\u2013247. Springer, Heidelberg (2007)"},{"key":"10_CR18","first-page":"3","volume":"6","author":"A Wuensche","year":"1998","unstructured":"Wuensche, A., et al.: Discrete dynamical networks and their attractor basins. Complex. Int. 6, 3\u201321 (1998)","journal-title":"Complex. Int."},{"issue":"8","key":"10_CR19","doi-asserted-by":"crossref","first-page":"1976","DOI":"10.1109\/TAC.2013.2251819","volume":"58","author":"Y Zhao","year":"2013","unstructured":"Zhao, Y., Kim, J., Filippone, M.: Aggregation algorithm towards large-scale Boolean network analysis. IEEE Trans. Autom. Control 58(8), 1976\u20131985 (2013)","journal-title":"IEEE Trans. Autom. Control"}],"container-title":["Lecture Notes in Computer Science","Reachability Problems"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-45994-3_10","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,6,19]],"date-time":"2024-06-19T09:27:34Z","timestamp":1718789254000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-45994-3_10"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016]]},"ISBN":["9783319459936","9783319459943"],"references-count":19,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-45994-3_10","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2016]]}}}