{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,14]],"date-time":"2026-01-14T17:33:14Z","timestamp":1768411994853,"version":"3.49.0"},"publisher-location":"Cham","reference-count":33,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783030355395","type":"print"},{"value":"9783030355401","type":"electronic"}],"license":[{"start":{"date-parts":[[2019,1,1]],"date-time":"2019-01-01T00:00:00Z","timestamp":1546300800000},"content-version":"tdm","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":[[2019]]},"DOI":"10.1007\/978-3-030-35540-1_2","type":"book-chapter","created":{"date-parts":[[2019,11,18]],"date-time":"2019-11-18T00:01:29Z","timestamp":1574035289000},"page":"19-37","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":11,"title":["Fault Trees from Data: Efficient Learning with an Evolutionary Algorithm"],"prefix":"10.1007","author":[{"given":"Alexis","family":"Linard","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Doina","family":"Bucur","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Mari\u00eblle","family":"Stoelinga","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2019,11,18]]},"reference":[{"issue":"2","key":"2_CR1","doi-asserted-by":"publisher","first-page":"175","DOI":"10.1021\/i100014a008","volume":"23","author":"DJ Allen","year":"1984","unstructured":"Allen, D.J.: Digraphs and fault trees. Ind. Eng. Chem. Fundam. 23(2), 175\u2013180 (1984)","journal-title":"Ind. Eng. Chem. Fundam."},{"key":"2_CR2","doi-asserted-by":"crossref","first-page":"313","DOI":"10.1111\/j.2517-6161.1964.tb00564.x","volume":"26","author":"M Birch","year":"1964","unstructured":"Birch, M.: The detection of partial association, i: the 2 $$\\times $$ 2 case. J. R. Stat. Soc. Ser. B (Methodological) 26, 313\u2013324 (1964)","journal-title":"J. R. Stat. Soc. Ser. B (Methodological)"},{"key":"2_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"379","DOI":"10.1007\/978-3-030-17462-0_25","volume-title":"Tools and Algorithms for the Construction and Analysis of Systems","author":"M Bozzano","year":"2019","unstructured":"Bozzano, M., Bruintjes, H., Cimatti, A., Katoen, J.-P., Noll, T., Tonetta, S.: COMPASS\u00a03.0. In: Vojnar, T., Zhang, L. (eds.) TACAS 2019. LNCS, vol. 11427, pp. 379\u2013385. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-17462-0_25"},{"issue":"1","key":"2_CR4","doi-asserted-by":"publisher","first-page":"5","DOI":"10.1007\/s10009-006-0001-2","volume":"9","author":"M Bozzano","year":"2007","unstructured":"Bozzano, M., Villafiorita, A.: The FSAP\/NuSMV-SA safety analysis platform. Int. J. Softw. Tools Technol. Transf. 9(1), 5 (2007)","journal-title":"Int. J. Softw. Tools Technol. Transf."},{"key":"2_CR5","doi-asserted-by":"publisher","first-page":"210","DOI":"10.1016\/j.asoc.2013.12.002","volume":"16","author":"D Bucur","year":"2014","unstructured":"Bucur, D., Iacca, G., Squillero, G., Tonda, A.: The impact of topology on energy consumption for collection tree protocols: an experimental assessment through evolutionary computation. Appl. Soft Comput. 16, 210\u2013222 (2014)","journal-title":"Appl. Soft Comput."},{"key":"2_CR6","doi-asserted-by":"publisher","first-page":"54","DOI":"10.1016\/j.tcs.2011.02.016","volume":"436","author":"T Chen","year":"2012","unstructured":"Chen, T., Tang, K., Chen, G., Yao, X.: A large population size can be unhelpful in evolutionary algorithms. Theor. Comput. Sci. 436, 54\u201370 (2012)","journal-title":"Theor. Comput. Sci."},{"key":"2_CR7","doi-asserted-by":"crossref","unstructured":"Cheney, N., MacCurdy, R., Clune, J., Lipson, H.: Unshackling evolution: evolving soft robots with multiple materials and a powerful generative encoding. In: Proceedings of the 15th Annual Conference on Genetic and Evolutionary Computation, pp. 167\u2013174. ACM (2013)","DOI":"10.1145\/2463372.2463404"},{"key":"2_CR8","first-page":"1287","volume":"5","author":"DM Chickering","year":"2004","unstructured":"Chickering, D.M., Heckerman, D., Meek, C.: Large-sample learning of Bayesian networks is NP-hard. J. Mach. Learn. Res. 5, 1287\u20131330 (2004)","journal-title":"J. Mach. Learn. Res."},{"issue":"2","key":"2_CR9","doi-asserted-by":"publisher","first-page":"182","DOI":"10.1109\/4235.996017","volume":"6","author":"K Deb","year":"2002","unstructured":"Deb, K., Agrawal, S., Pratap, A., Meyarivan, T.: A fast and elitist multiobjective genetic algorithm: NSGA-II. IEEE Trans. Evol. Comput. 6(2), 182\u2013197 (2002)","journal-title":"IEEE Trans. Evol. Comput."},{"key":"2_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"236","DOI":"10.1007\/3-540-58473-0_152","volume-title":"Grammatical Inference and Applications","author":"P Dupont","year":"1994","unstructured":"Dupont, P.: Regular grammatical inference from positive and negative samples by genetic search: the GIG method. In: Carrasco, R.C., Oncina, J. (eds.) ICGI 1994. LNCS, vol. 862, pp. 236\u2013245. Springer, Heidelberg (1994). https:\/\/doi.org\/10.1007\/3-540-58473-0_152"},{"issue":"1","key":"2_CR11","doi-asserted-by":"publisher","first-page":"7","DOI":"10.1007\/s10951-006-5591-8","volume":"9","author":"CD Geiger","year":"2006","unstructured":"Geiger, C.D., Uzsoy, R., Aytu\u011f, H.: Rapid modeling and discovery of priority dispatching rules: an autonomous learning approach. J. Sched. 9(1), 7\u201334 (2006)","journal-title":"J. Sched."},{"issue":"5","key":"2_CR12","doi-asserted-by":"publisher","first-page":"299","DOI":"10.1002\/(SICI)1099-1638(199709\/10)13:5<299::AID-QRE111>3.0.CO;2-D","volume":"13","author":"J Henry","year":"1997","unstructured":"Henry, J., Andrews, J.: Computerized fault tree construction for a train braking system. Qual. Reliab. Eng. Int. 13(5), 299\u2013309 (1997)","journal-title":"Qual. Reliab. Eng. Int."},{"key":"2_CR13","doi-asserted-by":"crossref","unstructured":"Hornby, G., Globus, A., Linden, D., Lohn, J.: Automated antenna design with evolutionary algorithms. In: Space 2006, p. 7242 (2006)","DOI":"10.2514\/6.2006-7242"},{"key":"2_CR14","doi-asserted-by":"crossref","unstructured":"Joshi, A., Gavriloiu, V., Barua, A., Garabedian, A., Sinha, P., Khorasani, K.: Intelligent and learning-based approaches for health monitoring and fault diagnosis of RADARSAT-1 attitude control system. In: 2007 IEEE International Conference on Systems, Man and Cybernetics, pp. 3177\u20133183 (2007)","DOI":"10.1109\/ICSMC.2007.4414081"},{"key":"2_CR15","doi-asserted-by":"publisher","first-page":"114","DOI":"10.1016\/j.eswa.2017.01.058","volume":"77","author":"S Kabir","year":"2017","unstructured":"Kabir, S.: An overview of fault tree analysis and its application in model based dependability analysis. Expert Syst. Appl. 77, 114\u2013135 (2017)","journal-title":"Expert Syst. Appl."},{"issue":"6","key":"2_CR16","doi-asserted-by":"publisher","first-page":"1298","DOI":"10.1145\/195613.195656","volume":"41","author":"M Kearns","year":"1994","unstructured":"Kearns, M., Li, M., Valiant, L.: Learning boolean formulas. J. ACM 41(6), 1298\u20131328 (1994)","journal-title":"J. ACM"},{"issue":"3","key":"2_CR17","doi-asserted-by":"publisher","first-page":"194","DOI":"10.1109\/TR.1985.5222114","volume":"34","author":"WS Lee","year":"1985","unstructured":"Lee, W.S., Grosh, D.L., Tillman, F.A., Lie, C.H.: Fault tree analysis, methods, and applications: a review. IEEE Trans. Reliab. 34(3), 194\u2013203 (1985)","journal-title":"IEEE Trans. Reliab."},{"issue":"2","key":"2_CR18","doi-asserted-by":"publisher","first-page":"119","DOI":"10.1504\/IJCCBS.2013.056492","volume":"4","author":"F Leitner-Fischer","year":"2013","unstructured":"Leitner-Fischer, F., Leue, S.: Probabilistic fault tree synthesis using causality computation. Int. J. Crit. Comput. Based Syst. 4(2), 119\u2013143 (2013)","journal-title":"Int. J. Crit. Comput. Based Syst."},{"issue":"6","key":"2_CR19","doi-asserted-by":"publisher","first-page":"681","DOI":"10.1080\/07408170600899532","volume":"39","author":"J Li","year":"2007","unstructured":"Li, J., Shi, J.: Knowledge discovery from observational data for process control using causal bayesian networks. IIE Trans. 39(6), 681\u2013690 (2007)","journal-title":"IIE Trans."},{"key":"2_CR20","doi-asserted-by":"publisher","first-page":"140","DOI":"10.1016\/j.proeng.2014.09.070","volume":"80","author":"S Li","year":"2014","unstructured":"Li, S., Li, X.: Study on generation of fault trees from Altarica models. Procedia Eng. 80, 140\u2013152 (2014)","journal-title":"Procedia Eng."},{"key":"2_CR21","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"243","DOI":"10.1007\/978-3-642-23496-5_18","volume-title":"Autonomic and Trusted Computing","author":"Y Li","year":"2011","unstructured":"Li, Y., Zhu, Y., Ma, C., Xu, M.: A method for constructing fault trees from AADL models. In: Calero, J.M.A., Yang, L.T., M\u00e1rmol, F.G., Garc\u00eda Villalba, L.J., Li, A.X., Wang, Y. (eds.) ATC 2011. LNCS, vol. 6906, pp. 243\u2013258. Springer, Heidelberg (2011). https:\/\/doi.org\/10.1007\/978-3-642-23496-5_18"},{"key":"2_CR22","unstructured":"Liggesmeyer, P., Rothfelder, M.: Improving system reliability with automatic fault tree generation. In: Digest of Papers. Twenty-Eighth Annual International Symposium on Fault-Tolerant Computing, pp. 90\u201399 (1998)"},{"key":"2_CR23","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"134","DOI":"10.1007\/978-3-319-47166-2_9","volume-title":"Leveraging Applications of Formal Methods, Verification and Validation: Foundational Techniques","author":"A Linard","year":"2016","unstructured":"Linard, A., Bueno, M.L.P.: Towards adaptive scheduling of maintenance for cyber-physical systems. In: Margaria, T., Steffen, B. (eds.) ISoLA 2016. LNCS, vol. 9952, pp. 134\u2013150. Springer, Cham (2016). https:\/\/doi.org\/10.1007\/978-3-319-47166-2_9"},{"key":"2_CR24","unstructured":"Madden, M.G., Nolan, P.J.: Generation of fault trees from simulated incipientfault case data. WIT Trans. Inf. Commun. Technol. 6 (1994)"},{"key":"2_CR25","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"306","DOI":"10.1007\/978-3-319-99154-2_19","volume-title":"Quantitative Evaluation of Systems","author":"M Nauta","year":"2018","unstructured":"Nauta, M., Bucur, D., Stoelinga, M.: LIFT: learning fault trees from observational data. In: McIver, A., Horvath, A. (eds.) QEST 2018. LNCS, vol. 11024, pp. 306\u2013322. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-319-99154-2_19"},{"key":"2_CR26","unstructured":"Oliveira, A.L., Sangiovanni-Vincentelli, A.: Learning complex Boolean functions: algorithms and applications. In: Advances in Neural Information Processing Systems, pp. 911\u2013918 (1994)"},{"key":"2_CR27","unstructured":"Papadopoulos, Y., McDermid, J.: Safety-directed system monitoring using safety cases. Ph.D. thesis, University of York (2000)"},{"key":"2_CR28","unstructured":"Park, M.S., Choi, J.Y.: Logical evolution method for learning Boolean functions. In: 2001 IEEE International Conference on Systems, Man and Cybernetics. e-Systems and e-Man for Cybernetics in Cyberspace, vol. 1, pp. 316\u2013321 (2001)"},{"key":"2_CR29","doi-asserted-by":"publisher","first-page":"29","DOI":"10.1016\/j.cosrev.2015.03.001","volume":"15\u201316","author":"E Ruijters","year":"2015","unstructured":"Ruijters, E., Stoelinga, M.: Fault tree analysis: a survey of the state-of-the-art in modeling, analysis and tools. Comput. Sci. Rev. 15\u201316, 29\u201362 (2015)","journal-title":"Comput. Sci. Rev."},{"key":"2_CR30","doi-asserted-by":"crossref","unstructured":"Sharvia, S., Kabir, S., Walker, M., Papadopoulos, Y.: Model-based dependability analysis: state-of-the-art, challenges, and future outlook. In: Software Quality Assurance, pp. 251\u2013278. Elsevier (2016)","DOI":"10.1016\/B978-0-12-802301-3.00012-0"},{"key":"2_CR31","doi-asserted-by":"publisher","first-page":"23","DOI":"10.1007\/978-1-4020-6710-5_3","volume-title":"Parsing the Turing Test","author":"AM Turing","year":"2009","unstructured":"Turing, A.M.: Computing machinery and intelligence. In: Epstein, R., Roberts, G., Beber, G. (eds.) Parsing the Turing Test, pp. 23\u201365. Springer, Dordrecht (2009). https:\/\/doi.org\/10.1007\/978-1-4020-6710-5_3"},{"key":"2_CR32","unstructured":"Vesely, W.E., Goldberg, F.F., Roberts, N.H., Haasl, D.F.: Fault tree handbook. Technical report, Nuclear Regulatory Commission Washington DC (1981)"},{"key":"2_CR33","doi-asserted-by":"crossref","unstructured":"Zhang, Y., Ren, Y., Liu, L., Wang, Z.: A method of fault tree generation based on go model. In: 2015 First International Conference on Reliability Systems Engineering (ICRSE), pp. 1\u20135. IEEE (2015)","DOI":"10.1109\/ICRSE.2015.7366462"}],"container-title":["Lecture Notes in Computer Science","Dependable Software Engineering. Theories, Tools, and Applications"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-35540-1_2","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,7,27]],"date-time":"2024-07-27T02:44:54Z","timestamp":1722048294000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-030-35540-1_2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019]]},"ISBN":["9783030355395","9783030355401"],"references-count":33,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-35540-1_2","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2019]]},"assertion":[{"value":"18 November 2019","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"SETTA","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Symposium on Dependable Software Engineering: Theories, Tools, and Applications","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Shanghai","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"China","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2019","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"27 November 2019","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"29 November 2019","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"5","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"setta2019a","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/www4.comp.polyu.edu.hk\/~csguannan\/setta19\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Open","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"EasyChair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"26","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"8","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"0","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"31% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}