{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,9]],"date-time":"2025-10-09T06:40:38Z","timestamp":1759992038919,"version":"3.40.3"},"publisher-location":"Cham","reference-count":29,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319101804"},{"type":"electronic","value":"9783319101811"}],"license":[{"start":{"date-parts":[[2014,1,1]],"date-time":"2014-01-01T00:00:00Z","timestamp":1388534400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2014,1,1]],"date-time":"2014-01-01T00:00:00Z","timestamp":1388534400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2014]]},"DOI":"10.1007\/978-3-319-10181-1_16","type":"book-chapter","created":{"date-parts":[[2014,8,29]],"date-time":"2014-08-29T14:28:38Z","timestamp":1409322518000},"page":"256-271","source":"Crossref","is-referenced-by-count":9,"title":["A Probabilistic Framework for Security Scenarios with Dependent Actions"],"prefix":"10.1007","author":[{"given":"Barbara","family":"Kordy","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Marc","family":"Pouly","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Patrick","family":"Schweitzer","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"16_CR1","doi-asserted-by":"publisher","first-page":"277","DOI":"10.1137\/0608024","volume":"8","author":"S. Arnborg","year":"1987","unstructured":"Arnborg, S., Corneil, D., Proskurowski, A.: Complexity of Finding Embeddings in a k-Tree. SIAM J. of Algebraic and Discrete Methods\u00a08, 277\u2013284 (1987)","journal-title":"SIAM J. of Algebraic and Discrete Methods"},{"issue":"2","key":"16_CR2","first-page":"1","volume":"3","author":"A. Bagnato","year":"2012","unstructured":"Bagnato, A., Kordy, B., Meland, P.H., Schweitzer, P.: Attribute Decoration of Attack\u2013Defense Trees. IJSSE\u00a03(2), 1\u201335 (2012)","journal-title":"IJSSE"},{"key":"16_CR3","doi-asserted-by":"crossref","unstructured":"Bistarelli, S., Fioravanti, F., Peretti, P.: Defense Trees for Economic Evaluation of Security Investments. In: ARES, pp. 416\u2013423. IEEE Computer Society (2006)","DOI":"10.1109\/ARES.2006.46"},{"issue":"1-2","key":"16_CR4","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/S0304-3975(97)00228-4","volume":"209","author":"H.L. Bodlaender","year":"1998","unstructured":"Bodlaender, H.L.: A Partial K-arboretum of Graphs with Bounded Treewidth. Theoretical Computer Science\u00a0209(1-2), 1\u201345 (1998)","journal-title":"Theoretical Computer Science"},{"key":"16_CR5","doi-asserted-by":"publisher","first-page":"41","DOI":"10.1016\/S0004-3702(99)00059-4","volume":"113","author":"R. Dechter","year":"1999","unstructured":"Dechter, R.: Bucket Elimination: A Unifying Framework for Reasoning. Artif. Intell.\u00a0113, 41\u201385 (1999)","journal-title":"Artif. Intell."},{"key":"16_CR6","unstructured":"Dechter, R.: Constraint Processing. Morgan Kaufmann (2003)"},{"key":"16_CR7","doi-asserted-by":"crossref","unstructured":"Frigault, M., Wang, L.: Measuring Network Security Using Bayesian Network-Based Attack Graphs. In: COMPSAC, pp. 698\u2013703 (2008)","DOI":"10.1145\/1456362.1456368"},{"key":"16_CR8","unstructured":"van Harmelen, F., van Harmelen, F., Lifschitz, V., Porter, B.: Handbook of Knowledge Representation. Elsevier Science, San Diego (2007)"},{"key":"16_CR9","doi-asserted-by":"crossref","unstructured":"Kohlas, J.: Information Algebras: Generic Structures for Inference. Springer (2003)","DOI":"10.1007\/978-1-4471-0009-6"},{"issue":"11","key":"16_CR10","doi-asserted-by":"publisher","first-page":"1360","DOI":"10.1016\/j.artint.2008.03.003","volume":"172","author":"J. Kohlas","year":"2008","unstructured":"Kohlas, J., Wilson, N.: Semiring induced Valuation Algebras: Exact and Approximate Local Computation algorithms. Artif. Intell.\u00a0172(11), 1360\u20131399 (2008)","journal-title":"Artif. Intell."},{"key":"16_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"173","DOI":"10.1007\/978-3-642-40196-1_15","volume-title":"Quantitative Evaluation of Systems","author":"B. Kordy","year":"2013","unstructured":"Kordy, B., Kordy, P., Mauw, S., Schweitzer, P.: ADTool: Security Analysis with Attack\u2013Defense Trees. In: Joshi, K., Siegle, M., Stoelinga, M., D\u2019Argenio, P.R. (eds.) QEST 2013. LNCS, vol.\u00a08054, pp. 173\u2013176. Springer, Heidelberg (2013)"},{"key":"16_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"80","DOI":"10.1007\/978-3-642-19751-2_6","volume-title":"Formal Aspects of Security and Trust","author":"B. Kordy","year":"2011","unstructured":"Kordy, B., Mauw, S., Radomirovi\u0107, S., Schweitzer, P.: Foundations of Attack\u2013Defense Trees. In: Degano, P., Etalle, S., Guttman, J. (eds.) FAST 2010. LNCS, vol.\u00a06561, pp. 80\u201395. Springer, Heidelberg (2011)"},{"issue":"1","key":"16_CR13","doi-asserted-by":"publisher","first-page":"55","DOI":"10.1093\/logcom\/exs029","volume":"24","author":"B. Kordy","year":"2014","unstructured":"Kordy, B., Mauw, S., Radomirovi\u0107, S., Schweitzer, P.: Attack\u2013Defense Trees. Journal of Logic and Computation\u00a024(1), 55\u201387 (2014)","journal-title":"Journal of Logic and Computation"},{"key":"16_CR14","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.\u00a07839, pp. 49\u201364. Springer, Heidelberg (2013)"},{"key":"16_CR15","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. CoRR 1303.7397 (2013), \n                        http:\/\/arxiv.org\/abs\/1303.7397\n                       (under submission)"},{"key":"16_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"103","DOI":"10.1007\/978-3-642-25261-7_8","volume-title":"Security and Intelligent Information Systems","author":"B. Kordy","year":"2012","unstructured":"Kordy, B., Pouly, M., Schweitzer, P.: Computational Aspects of Attack\u2013Defense Trees. In: Bouvry, P., K\u0142opotek, M.A., Lepr\u00e9vost, F., Marciniak, M., Mykowiecka, A., Rybi\u0144ski, H. (eds.) SIIS 2011. LNCS, vol.\u00a07053, pp. 103\u2013116. Springer, Heidelberg (2012)"},{"key":"16_CR17","doi-asserted-by":"crossref","unstructured":"Lagerstr\u00f6m, R., Johnson, P., N\u00e4rman, P.: Extended Influence Diagram Generation. In: Jardim-Gon\u00e7alves, R., M\u00fcller, J.P., Mertins, K., Zelm, M. (eds.) IESA, pp. 599\u2013602. Springer (2007)","DOI":"10.1007\/978-1-84628-858-6_65"},{"key":"16_CR18","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.\u00a03935, pp. 186\u2013198. Springer, Heidelberg (2006)"},{"key":"16_CR19","unstructured":"Mell, P., Scarfone, K., Romanosky, S.: A Complete Guide to the Common Vulnerability Scoring System Version 2.0 (2007), \n                        http:\/\/www.first.org\/cvss\/cvss-guide.html"},{"key":"16_CR20","doi-asserted-by":"crossref","unstructured":"Pearl, J.: Probabilistic Reasoning in Intelligent Systems: Networks of Plausible Inference. Morgan Kaufmann (1988)","DOI":"10.1016\/B978-0-08-051489-5.50008-4"},{"issue":"1","key":"16_CR21","doi-asserted-by":"publisher","first-page":"61","DOI":"10.1109\/TDSC.2011.34","volume":"9","author":"N. Poolsappasit","year":"2012","unstructured":"Poolsappasit, N., Dewri, R., Ray, I.: Dynamic Security Risk Management Using Bayesian Attack Graphs. IEEE Trans. Dep. Sec. Comp.\u00a09(1), 61\u201374 (2012)","journal-title":"IEEE Trans. Dep. Sec. Comp."},{"key":"16_CR22","doi-asserted-by":"crossref","unstructured":"Pouly, M., Kohlas, J.: Generic Inference - A Unifying Theory for Automated Reasoning. John Wiley & Sons, Inc. (2011)","DOI":"10.1002\/9781118010877"},{"key":"16_CR23","doi-asserted-by":"publisher","first-page":"65","DOI":"10.1142\/S0218213010000042","volume":"19","author":"M. Pouly","year":"2010","unstructured":"Pouly, M.: NENOK - A Software Architecture for Generic Inference. Int. J. on Artif. Intel. Tools\u00a019, 65\u201399 (2010)","journal-title":"Int. J. on Artif. Intel. Tools"},{"key":"16_CR24","unstructured":"Qin, X., Lee, W.: Attack plan recognition and prediction using causal networks. In: ACSAC, pp. 370\u2013379 (2004)"},{"issue":"1","key":"16_CR25","doi-asserted-by":"publisher","first-page":"39","DOI":"10.1016\/0095-8956(83)90079-5","volume":"35","author":"N. Robertson","year":"1983","unstructured":"Robertson, N., Seymour, P.: Graph Minors I: Excluding a Forest. J. Comb. Theory, Ser. B\u00a035(1), 39\u201361 (1983)","journal-title":"J. Comb. Theory, Ser. B"},{"issue":"12","key":"16_CR26","first-page":"21","volume":"24","author":"B. Schneier","year":"1999","unstructured":"Schneier, B.: Attack Trees. Dr. Dobb\u2019s Journal of Software Tools\u00a024(12), 21\u201329 (1999)","journal-title":"Dr. Dobb\u2019s Journal of Software Tools"},{"key":"16_CR27","unstructured":"Shenoy, P.: Valuation-Based Systems: A Framework for Managing Uncertainty in Expert Systems. In: Zadeh, L., Kacprzyk, J. (eds.) Fuzzy Logic for the Management of Uncertainty, pp. 83\u2013104. John Wiley & Sons, Inc. (1992)"},{"issue":"4","key":"16_CR28","doi-asserted-by":"publisher","first-page":"1801","DOI":"10.1109\/TPWRD.2009.2028796","volume":"24","author":"T. Sommestad","year":"2009","unstructured":"Sommestad, T., Ekstedt, M., Nordstr\u00f6m, L.: Modeling security of power communication systems using defense graphs and influence diagrams. IEEE Trans. Pow. Del.\u00a024(4), 1801\u20131808 (2009)","journal-title":"IEEE Trans. Pow. Del."},{"key":"16_CR29","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1016\/0165-0114(78)90029-5","volume":"1","author":"L. Zadeh","year":"1978","unstructured":"Zadeh, L.: Fuzzy sets as a basis for a theory of possibility. Fuzzy Sets and Systems\u00a01, 3\u201328 (1978)","journal-title":"Fuzzy Sets and Systems"}],"container-title":["Lecture Notes in Computer Science","Integrated Formal Methods"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-10181-1_16","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,2,8]],"date-time":"2023-02-08T03:24:20Z","timestamp":1675826660000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-319-10181-1_16"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014]]},"ISBN":["9783319101804","9783319101811"],"references-count":29,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-10181-1_16","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2014]]}}}