{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,19]],"date-time":"2026-03-19T01:24:27Z","timestamp":1773883467291,"version":"3.50.1"},"publisher-location":"Cham","reference-count":28,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783319897219","type":"print"},{"value":"9783319897226","type":"electronic"}],"license":[{"start":{"date-parts":[[2018,1,1]],"date-time":"2018-01-01T00:00:00Z","timestamp":1514764800000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/creativecommons.org\/licenses\/by\/4.0"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2018]]},"DOI":"10.1007\/978-3-319-89722-6_14","type":"book-chapter","created":{"date-parts":[[2018,4,13]],"date-time":"2018-04-13T14:53:50Z","timestamp":1523631230000},"page":"325-346","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":28,"title":["On Quantitative Analysis of Attack\u2013Defense Trees with Repeated Labels"],"prefix":"10.1007","author":[{"given":"Barbara","family":"Kordy","sequence":"first","affiliation":[]},{"given":"Wojciech","family":"Wide\u0142","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2018,4,14]]},"reference":[{"key":"14_CR1","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":"14_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"95","DOI":"10.1007\/978-3-662-46666-7_6","volume-title":"Principles of Security and Trust","author":"Z Aslanyan","year":"2015","unstructured":"Aslanyan, Z., Nielson, F.: Pareto efficient solutions of attack-defence trees. In: Focardi, R., Myers, A. (eds.) POST 2015. LNCS, vol. 9036, pp. 95\u2013114. Springer, Heidelberg (2015). \nhttps:\/\/doi.org\/10.1007\/978-3-662-46666-7_6"},{"key":"14_CR3","doi-asserted-by":"crossref","unstructured":"Aslanyan, Z., Nielson, F., Parker, D.: Quantitative verification and synthesis of attack-defence scenarios. In: CSF, pp. 105\u2013119. IEEE Computer Society (2016)","DOI":"10.1109\/CSF.2016.15"},{"issue":"2","key":"14_CR4","first-page":"1","volume":"3","author":"A Bagnato","year":"2012","unstructured":"Bagnato, A., Kordy, B., Meland, P.H., Schweitzer, P.: Attribute decoration of attack-defense trees. IJSSE 3(2), 1\u201335 (2012)","journal-title":"IJSSE"},{"key":"14_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"17","DOI":"10.1007\/978-3-319-74860-3_2","volume-title":"Graphical Models for Security","author":"A Bossuat","year":"2018","unstructured":"Bossuat, A., Kordy, B.: Evil twins: handling repetitions in attack\u2013defense trees \u2013 a survival guide. In: Liu, P., Mauw, S., St\u00f8len, K. (eds.) GraMSec 2017. LNCS, vol. 10744, pp. 17\u201337. Springer, Cham (2018). \nhttps:\/\/doi.org\/10.1007\/978-3-319-74860-3_2"},{"key":"14_CR6","doi-asserted-by":"crossref","unstructured":"Codetta-Raiteri, D.: BDD based analysis of parametric fault trees. In: Proceedings of the RAMS 2006, Annual Reliability and Maintainability Symposium, RAMS 2006, pp. 442\u2013449. IEEE Computer Society, Washington, DC (2006)","DOI":"10.1109\/RAMS.2006.1677414"},{"key":"14_CR7","series-title":"Lecture Notes in Business Information Processing","doi-asserted-by":"publisher","first-page":"326","DOI":"10.1007\/978-3-319-48393-1_24","volume-title":"The Practice of Enterprise Modeling","author":"M Fraile","year":"2016","unstructured":"Fraile, M., Ford, M., Gadyatskaya, O., Kumar, R., Stoelinga, M., Trujillo-Rasua, R.: Using attack-defense trees to analyze threats and countermeasures in an ATM: a case study. In: Horkoff, J., Jeusfeld, M.A., Persson, A. (eds.) PoEM 2016. LNBIP, vol. 267, pp. 326\u2013334. Springer, Cham (2016). \nhttps:\/\/doi.org\/10.1007\/978-3-319-48393-1_24"},{"key":"14_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"35","DOI":"10.1007\/978-3-319-44878-7_3","volume-title":"Formal Modeling and Analysis of Timed Systems","author":"O Gadyatskaya","year":"2016","unstructured":"Gadyatskaya, O., Hansen, R.R., Larsen, K.G., Legay, A., Olesen, M.C., Poulsen, D.B.: Modelling attack-defense trees using timed automata. In: Fr\u00e4nzle, M., Markey, N. (eds.) FORMATS 2016. LNCS, vol. 9884, pp. 35\u201350. Springer, Cham (2016). \nhttps:\/\/doi.org\/10.1007\/978-3-319-44878-7_3"},{"key":"14_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"159","DOI":"10.1007\/978-3-319-43425-4_10","volume-title":"Quantitative Evaluation of Systems","author":"O Gadyatskaya","year":"2016","unstructured":"Gadyatskaya, O., Jhawar, R., Kordy, P., Lounis, K., Mauw, S., Trujillo-Rasua, R.: Attack trees for practical security assessment: ranking of attack scenarios with ADTool 2.0. In: Agha, G., Van Houdt, B. (eds.) QEST 2016. LNCS, vol. 9826, pp. 159\u2013162. Springer, Cham (2016). \nhttps:\/\/doi.org\/10.1007\/978-3-319-43425-4_10"},{"key":"14_CR10","unstructured":"Haasl, D.F., Roberts, N.H., Veselay, W.E., Goldberg, F.F.: Fault tree handbook. Technical report, Systems and Reliability Research, Office of Nuclear Regulatory Research, U.S. Nuclear Regulatory Comission (1981)"},{"key":"14_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"163","DOI":"10.1007\/978-3-662-49635-0_9","volume-title":"Principles of Security and Trust","author":"H Hermanns","year":"2016","unstructured":"Hermanns, H., Kr\u00e4mer, J., Kr\u010d\u00e1l, J., Stoelinga, M.: The value of attack- defence diagrams. In: Piessens, F., Vigan\u00f2, L. (eds.) POST 2016. LNCS, vol. 9635, pp. 163\u2013185. Springer, Heidelberg (2016). \nhttps:\/\/doi.org\/10.1007\/978-3-662-49635-0_9"},{"key":"14_CR12","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.cosrev.2017.09.001","volume":"26","author":"JB Hong","year":"2017","unstructured":"Hong, J.B., Kim, D.S., Chung, C.J., Huang, D.: A survey on the usability and practical applications of graphical security models. Comput. Sci. Rev. 26, 1\u201316 (2017)","journal-title":"Comput. Sci. Rev."},{"issue":"1\u20132","key":"14_CR13","doi-asserted-by":"publisher","first-page":"57","DOI":"10.3233\/FI-2017-1531","volume":"153","author":"R Horne","year":"2017","unstructured":"Horne, R., Mauw, S., Tiu, A.: Semantics for specialising attack trees based on linear logic. Fundam. Inform. 153(1\u20132), 57\u201386 (2017)","journal-title":"Fundam. Inform."},{"key":"14_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"82","DOI":"10.1007\/978-3-319-29968-6_6","volume-title":"Graphical Models for Security","author":"MG Ivanova","year":"2016","unstructured":"Ivanova, M.G., Probst, C.W., Hansen, R.R., Kamm\u00fcller, F.: Transforming graphical system models to graphical attack models. In: Mauw, S., Kordy, B., Jajodia, S. (eds.) GraMSec 2015. LNCS, vol. 9390, pp. 82\u201396. Springer, Cham (2016). \nhttps:\/\/doi.org\/10.1007\/978-3-319-29968-6_6"},{"key":"14_CR15","series-title":"IFIP Advances in Information and Communication Technology","doi-asserted-by":"publisher","first-page":"339","DOI":"10.1007\/978-3-319-18467-8_23","volume-title":"ICT Systems Security and Privacy Protection","author":"R Jhawar","year":"2015","unstructured":"Jhawar, R., Kordy, B., Mauw, S., Radomirovi\u0107, S., Trujillo-Rasua, R.: Attack trees with sequential conjunction. In: Federrath, H., Gollmann, D. (eds.) SEC 2015. IFIP AICT, vol. 455, pp. 339\u2013353. Springer, Cham (2015). \nhttps:\/\/doi.org\/10.1007\/978-3-319-18467-8_23"},{"key":"14_CR16","doi-asserted-by":"crossref","unstructured":"Ji, X., Yu, H., Fan, G., Fu, W.: Attack-defense trees based cyber security analysis for CPSs. In: SNPD, pp. 693\u2013698. IEEE Computer Society (2016)","DOI":"10.1109\/SNPD.2016.7515980"},{"key":"14_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1036","DOI":"10.1007\/978-3-540-88873-4_8","volume-title":"On the Move to Meaningful Internet Systems: OTM 2008","author":"A J\u00fcrgenson","year":"2008","unstructured":"J\u00fcrgenson, A., Willemson, J.: Computing exact outcomes of multi-parameter attack trees. In: Meersman, R., Tari, Z. (eds.) OTM 2008, Part II. LNCS, vol. 5332, pp. 1036\u20131051. Springer, Heidelberg (2008). \nhttps:\/\/doi.org\/10.1007\/978-3-540-88873-4_8"},{"issue":"1","key":"14_CR18","doi-asserted-by":"publisher","first-page":"55","DOI":"10.1093\/logcom\/exs029","volume":"24","author":"B Kordy","year":"2014","unstructured":"Kordy, B., Mauw, S., Radomirovic, S., Schweitzer, P.: Attack-defense trees. J. Log. Comput. 24(1), 55\u201387 (2014)","journal-title":"J. Log. Comput."},{"key":"14_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"49","DOI":"10.1007\/978-3-642-37682-5_5","volume-title":"Information Security and Cryptology \u2013 ICISC 2012","author":"B Kordy","year":"2013","unstructured":"Kordy, B., Mauw, S., Schweitzer, P.: Quantitative questions on attack\u2013defense trees. In: Kwon, T., Lee, M.-K., Kwon, D. (eds.) ICISC 2012. LNCS, vol. 7839, pp. 49\u201364. Springer, Heidelberg (2013). \nhttps:\/\/doi.org\/10.1007\/978-3-642-37682-5_5"},{"key":"14_CR20","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.cosrev.2014.07.001","volume":"13\u201314","author":"B Kordy","year":"2014","unstructured":"Kordy, B., Pi\u00e8tre-Cambac\u00e9d\u00e8s, L., Schweitzer, P.: Dag-based attack and defense modeling: Don\u2019t miss the forest for the attack trees. Comput. Sci. Rev. 13\u201314, 1\u201338 (2014)","journal-title":"Comput. Sci. Rev."},{"key":"14_CR21","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"332","DOI":"10.1007\/978-3-319-66845-1_22","volume-title":"Integrated Formal Methods","author":"B Kordy","year":"2017","unstructured":"Kordy, B., Wide\u0142, W.: How well can I secure my system? In: Polikarpova, N., Schneider, S. (eds.) IFM 2017. LNCS, vol. 10510, pp. 332\u2013347. Springer, Cham (2017). \nhttps:\/\/doi.org\/10.1007\/978-3-319-66845-1_22"},{"key":"14_CR22","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"186","DOI":"10.1007\/11734727_17","volume-title":"Information Security and Cryptology - ICISC 2005","author":"S Mauw","year":"2006","unstructured":"Mauw, S., Oostdijk, M.: Foundations of attack trees. In: Won, D.H., Kim, S. (eds.) ICISC 2005. LNCS, vol. 3935, pp. 186\u2013198. Springer, Heidelberg (2006). \nhttps:\/\/doi.org\/10.1007\/11734727_17"},{"key":"14_CR23","unstructured":"National Electric Sector Cybersecurity Organization Resource (NESCOR): Analysis of selected electric sector high risk failure scenarios, version 2.0 (2015). \nhttp:\/\/smartgrid.epri.com\/doc\/NESCOR"},{"key":"14_CR24","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-13518-2_5","volume-title":"Secure and Trustworthy Service Composition","author":"E Paja","year":"2014","unstructured":"Paja, E., Dalpiaz, F., Giorgini, P.: The socio-technical security requirements modelling language for secure composite services. In: Brucker, A.D., Dalpiaz, F., Giorgini, P., Meland, P.H., Rios, E. (eds.) Secure Service Composition. LNCS, vol. 8900. Springer, Cham (2014). \nhttps:\/\/doi.org\/10.1007\/978-3-319-13518-2_5"},{"key":"14_CR25","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"97","DOI":"10.1007\/978-3-319-29968-6_7","volume-title":"Graphical Models for Security","author":"S Pinchinat","year":"2016","unstructured":"Pinchinat, S., Acher, M., Vojtisek, D.: ATSyRa: an integrated environment for synthesizing attack trees \u2013 (Tool Paper). In: Mauw, S., Kordy, B., Jajodia, S. (eds.) GraMSec 2015. LNCS, vol. 9390, pp. 97\u2013101. Springer, Cham (2016). \nhttps:\/\/doi.org\/10.1007\/978-3-319-29968-6_7"},{"key":"14_CR26","first-page":"21","volume":"24","author":"B Schneier","year":"1999","unstructured":"Schneier, B.: Attack trees. Dr Dobb\u2019s J. Softw. Tools 24, 21\u201329 (1999)","journal-title":"Dr Dobb\u2019s J. Softw. Tools"},{"key":"14_CR27","doi-asserted-by":"publisher","first-page":"51","DOI":"10.1109\/TR.1986.4335344","volume":"35","author":"K Stecher","year":"1986","unstructured":"Stecher, K.: Evaluation of large fault-trees with repeated events using an efficient bottom-up algorithm. IEEE Trans. Reliab. 35, 51\u201358 (1986)","journal-title":"IEEE Trans. Reliab."},{"key":"14_CR28","doi-asserted-by":"crossref","unstructured":"Vigo, R., Nielson, F., Nielson, H.R.: Automated generation of attack trees. In: IEEE 27th Computer Security Foundations Symposium, CSF 2014, Vienna, Austria, 19\u201322 July 2014, pp. 337\u2013350 (2014)","DOI":"10.1109\/CSF.2014.31"}],"container-title":["Lecture Notes in Computer Science","Principles of Security and Trust"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-89722-6_14","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2018,4,13]],"date-time":"2018-04-13T15:01:01Z","timestamp":1523631661000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-89722-6_14"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018]]},"ISBN":["9783319897219","9783319897226"],"references-count":28,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-89722-6_14","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2018]]}}}