{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T06:06:26Z","timestamp":1725516386266},"publisher-location":"Berlin, Heidelberg","reference-count":11,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540698401"},{"type":"electronic","value":"9783540698487"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/978-3-540-69848-7_77","type":"book-chapter","created":{"date-parts":[[2008,8,12]],"date-time":"2008-08-12T12:07:43Z","timestamp":1218542863000},"page":"970-986","source":"Crossref","is-referenced-by-count":0,"title":["Splitting the Unity, Bisecting a Graph: Applications to Stochastic Boolean Systems"],"prefix":"10.1007","author":[{"given":"Luis","family":"Gonz\u00e1lez","sequence":"first","affiliation":[]}],"member":"297","reference":[{"key":"77_CR1","volume-title":"Reliability and Risk Assessment","author":"J. Andrews","year":"2002","unstructured":"Andrews, J., Moss, B.: Reliability and Risk Assessment. Professional Engineering Publishing, London (2002)"},{"key":"77_CR2","volume-title":"Graph Theory. Graduate Texts in Mathematics","author":"R. Diestel","year":"2005","unstructured":"Diestel, R.: Graph Theory. Graduate Texts in Mathematics, vol.\u00a0173. Springer, Heidelberg (2005)"},{"key":"77_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"937","DOI":"10.1007\/3-540-44839-X_99","volume-title":"N-tuples of 0s and 1s: Necessary and sufficient conditions for intrinsic order","author":"L. Gonz\u00e1lez","year":"2003","unstructured":"Gonz\u00e1lez, L.: N-tuples of 0s and 1s: Necessary and sufficient conditions for intrinsic order. LNCS, vol.\u00a02667(1), pp. 937\u2013946. Springer, Heidelberg (2003)"},{"key":"77_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"633","DOI":"10.1007\/11751540_67","volume-title":"A new algorithm for complex stochastic Boolean systems","author":"L. Gonz\u00e1lez","year":"2006","unstructured":"Gonz\u00e1lez, L.: A new algorithm for complex stochastic Boolean systems. LNCS, vol.\u00a03980(1), pp. 633\u2013643. Springer, Heidelberg (2006)"},{"key":"77_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"305","DOI":"10.1007\/11758532_42","volume-title":"A picture for complex stochastic Boolean systems: The intrinsic order graph","author":"L. Gonz\u00e1lez","year":"2006","unstructured":"Gonz\u00e1lez, L.: A picture for complex stochastic Boolean systems: The intrinsic order graph. LNCS, vol.\u00a03993(3), pp. 305\u2013312. Springer, Heidelberg (2006)"},{"issue":"1","key":"77_CR6","doi-asserted-by":"publisher","first-page":"111","DOI":"10.1142\/S0219525907001136","volume":"10","author":"L. Gonz\u00e1lez","year":"2007","unstructured":"Gonz\u00e1lez, L.: Algorithm comparing binary string probabilities in complex stochastic Boolean systems using intrinsic order graph. Adv. Complex Syst.\u00a010(1), 111\u2013143 (2007)","journal-title":"Adv. Complex Syst."},{"issue":"3","key":"77_CR7","doi-asserted-by":"publisher","first-page":"297","DOI":"10.1109\/TR.2004.833307","volume":"53","author":"L. Gonz\u00e1lez","year":"2004","unstructured":"Gonz\u00e1lez, L., Garc\u00eda, D., Galv\u00e1n, B.J.: An intrinsic order criterion to evaluate large, complex fault trees. IEEE Trans. Reliab.\u00a053(3), 297\u2013305 (2004)","journal-title":"IEEE Trans. Reliab."},{"key":"77_CR8","unstructured":"National Aeronautics and Space Administration: Fault Tree Analysis: A Bibliography. Technical report NASA\/SP\u20132000-6111 (2000)"},{"key":"77_CR9","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-642-45638-1","volume-title":"Boolean Functions with Engineering Applications and Computer Programs","author":"W.G. Schneeweiss","year":"1989","unstructured":"Schneeweiss, W.G.: Boolean Functions with Engineering Applications and Computer Programs. Springer, Heidelberg (1989)"},{"issue":"2","key":"77_CR10","doi-asserted-by":"publisher","first-page":"264","DOI":"10.1137\/1030047","volume":"30","author":"N.D. Singpurwalla","year":"1988","unstructured":"Singpurwalla, N.D.: Foundational Issues in Reliability and Risk Analysis. SIAM Rev.\u00a030(2), 264\u2013282 (1988)","journal-title":"SIAM Rev."},{"key":"77_CR11","doi-asserted-by":"crossref","DOI":"10.1017\/CBO9780511805967","volume-title":"Enumerative Combinatorics","author":"R.P. Stanley","year":"1997","unstructured":"Stanley, R.P.: Enumerative Combinatorics, vol.\u00a01. Cambridge University Press, Cambridge (1997)"}],"container-title":["Lecture Notes in Computer Science","Computational Science and Its Applications \u2013 ICCSA 2008"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-69848-7_77.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,5,3]],"date-time":"2021-05-03T00:10:03Z","timestamp":1620000603000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-69848-7_77"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["9783540698401","9783540698487"],"references-count":11,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-69848-7_77","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[]}}