{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,4]],"date-time":"2026-05-04T10:25:24Z","timestamp":1777890324604,"version":"3.51.4"},"publisher-location":"Berlin, Heidelberg","reference-count":37,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783662496343","type":"print"},{"value":"9783662496350","type":"electronic"}],"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-662-49635-0_9","type":"book-chapter","created":{"date-parts":[[2016,3,21]],"date-time":"2016-03-21T08:03:52Z","timestamp":1458547432000},"page":"163-185","source":"Crossref","is-referenced-by-count":30,"title":["The Value of Attack-Defence Diagrams"],"prefix":"10.1007","author":[{"given":"Holger","family":"Hermanns","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Julia","family":"Kr\u00e4mer","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jan","family":"Kr\u010d\u00e1l","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Mari\u00eblle","family":"Stoelinga","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"issue":"2","key":"9_CR1","doi-asserted-by":"publisher","first-page":"183","DOI":"10.1016\/0304-3975(94)90010-8","volume":"126","author":"R Alur","year":"1994","unstructured":"Alur, R., Dill, D.L.: A theory of timed automata. Theor. Comput. Sci. 126(2), 183\u2013235 (1994)","journal-title":"Theor. Comput. Sci."},{"key":"9_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"291","DOI":"10.1007\/978-3-319-24249-1_25","volume-title":"Computer Safety, Reliability, and Security","author":"F Arnold","year":"2015","unstructured":"Arnold, F., Guck, D., Kumar, R., Stoelinga, M.: Sequential and parallel attack tree modelling. In: Koornneef, F., van Gulijk, C. (eds.) SAFECOMP 2015 Workshops. LNCS, vol. 9338, pp. 291\u2013299. Springer, Heidelberg (2015)"},{"key":"9_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"285","DOI":"10.1007\/978-3-642-54792-8_16","volume-title":"Principles of Security and Trust","author":"F Arnold","year":"2014","unstructured":"Arnold, F., Hermanns, H., Pulungan, R., Stoelinga, M.: Time-dependent analysis of attacks. In: Abadi, M., Kremer, S. (eds.) POST 2014 (ETAPS 2014). LNCS, vol. 8414, pp. 285\u2013305. Springer, Heidelberg (2014)"},{"key":"9_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","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)"},{"issue":"6","key":"9_CR5","doi-asserted-by":"publisher","first-page":"524","DOI":"10.1109\/TSE.2003.1205180","volume":"29","author":"C Baier","year":"2003","unstructured":"Baier, C., Haverkort, B., Hermanns, H., Katoen, J.-P.: Model-checking algorithms for continuous-time Markov chains. IEEE Trans. Softw. Eng. 29(6), 524\u2013541 (2003)","journal-title":"IEEE Trans. Softw. Eng."},{"key":"9_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/978-3-540-75227-1_1","volume-title":"Formal Aspects in Security and Trust","author":"S Bistarelli","year":"2007","unstructured":"Bistarelli, S., Dall\u2019Aglio, M., Peretti, P.: Strategic games on defense trees. In: Dimitrakos, T., Martinelli, F., Ryan, P.Y.A., Schneider, S. (eds.) FAST 2006. LNCS, vol. 4691, pp. 1\u201315. Springer, Heidelberg (2007)"},{"issue":"2","key":"9_CR7","doi-asserted-by":"publisher","first-page":"812","DOI":"10.1109\/TSE.2006.104","volume":"32","author":"H Bohnenkamp","year":"2006","unstructured":"Bohnenkamp, H., D\u2019Argenio, P.R., Hermanns, H., Katoen, J.-P.: MODEST: a compositional modeling formalism for hard and softly timed systems. IEEE Trans. Softw. Eng. 32(2), 812\u2013830 (2006)","journal-title":"IEEE Trans. Softw. Eng."},{"issue":"1","key":"9_CR8","doi-asserted-by":"publisher","first-page":"172","DOI":"10.1006\/inco.2000.2999","volume":"163","author":"S Bornot","year":"2000","unstructured":"Bornot, S., Sifakis, J.: An algebraic framework for urgency. Inf. Comput. 163(1), 172\u2013202 (2000)","journal-title":"Inf. Comput."},{"key":"9_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"103","DOI":"10.1007\/978-3-642-02930-1_9","volume-title":"Automata, Languages and Programming","author":"P Bouyer","year":"2009","unstructured":"Bouyer, P., Forejt, V.: Reachability in stochastic timed games. In: Albers, S., Marchetti-Spaccamela, A., Matias, Y., Nikoletseas, S., Thomas, W. (eds.) ICALP 2009, Part II. LNCS, vol. 5556, pp. 103\u2013114. Springer, Heidelberg (2009)"},{"key":"9_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"207","DOI":"10.1007\/978-3-642-15375-4_15","volume-title":"CONCUR 2010 - Concurrency Theory","author":"T Br\u00e1zdil","year":"2010","unstructured":"Br\u00e1zdil, T., Kr\u010d\u00e1l, J., K\u0159et\u00ednsk\u00fd, J., Ku\u010dera, A., \u0158eh\u00e1k, V.: Stochastic real-time games with qualitative timed automata objectives. In: Gastin, P., Laroussinie, F. (eds.) CONCUR 2010. LNCS, vol. 6269, pp. 207\u2013221. Springer, Heidelberg (2010)"},{"key":"9_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"235","DOI":"10.1007\/11962977_19","volume-title":"Critical Information Infrastructures Security","author":"A Buldas","year":"2006","unstructured":"Buldas, A., Laud, P., Priisalu, J., Saarepera, M., Willemson, J.: Rational choice of security measures via multi-parameter attack trees. In: L\u00f3pez, J. (ed.) CRITIS 2006. LNCS, vol. 4347, pp. 235\u2013248. Springer, Heidelberg (2006)"},{"key":"9_CR12","doi-asserted-by":"crossref","first-page":"72","DOI":"10.1007\/978-3-540-75538-8_7","volume-title":"Computers and Games","author":"R\u00e9mi Coulom","year":"2007","unstructured":"Coulom, R.: Efficient selectivity and backup operators in Monte-Carlo tree search. In: Computers and Games (CG), pp. 72\u201383 (2006)"},{"key":"9_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"206","DOI":"10.1007\/978-3-662-46681-0_16","volume-title":"Tools and Algorithms for the Construction and Analysis of Systems","author":"A David","year":"2015","unstructured":"David, A., Jensen, P., Larsen, K., Miku\u010dionis, M., Taankvist, J.:  Uppaal Stratego. In: Baier, C., Tinelli, C. (eds.) TACAS 2015. LNCS, vol. 9035, pp. 206\u2013211. Springer, Heidelberg (2015)"},{"key":"9_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"100","DOI":"10.1007\/978-3-319-10512-3_8","volume-title":"Formal Modeling and Analysis of Timed Systems","author":"A David","year":"2014","unstructured":"David, A., Fang, H., Larsen, K.G., Zhang, Z.: Verification and performance evaluation of timed game strategies. In: Legay, A., Bozga, M. (eds.) FORMATS 2014. LNCS, vol. 8711, pp. 100\u2013114. Springer, Heidelberg (2014)"},{"issue":"2","key":"9_CR15","doi-asserted-by":"publisher","first-page":"191","DOI":"10.1007\/s10703-012-0167-z","volume":"43","author":"EM Hahn","year":"2013","unstructured":"Hahn, E.M., Hartmanns, A., Hermanns, H., Katoen, J.P.: A compositional modelling and analysis framework for stochastic hybrid systems. Formal Methods in System Design 43(2), 191\u2013232 (2013)","journal-title":"Formal Methods in System Design"},{"key":"9_CR16","unstructured":"Hahn, E.M., Hartmanns, A., Hermanns, H.: Reachability and reward checking for stochastic timed automata. ECEASST 70 (2014)"},{"key":"9_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"372","DOI":"10.1007\/978-3-642-25271-6_20","volume-title":"Formal Methods for Components and Objects","author":"A Hartmanns","year":"2011","unstructured":"Hartmanns, A.: Model-checking and simulation for stochastic timed systems. In: Aichernig, B.K., de Boer, F.S., Bonsangue, M.M. (eds.) Formal Methods for Components and Objects. LNCS, vol. 6957, pp. 372\u2013391. Springer, Heidelberg (2011)"},{"key":"9_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"593","DOI":"10.1007\/978-3-642-54862-8_51","volume-title":"Tools and Algorithms for the Construction and Analysis of Systems","author":"A Hartmanns","year":"2014","unstructured":"Hartmanns, A., Hermanns, H.: The modest toolset: an integrated environment for quantitative modelling and verification. In: \u00c1brah\u00e1m, E., Havelund, K. (eds.) TACAS 2014 (ETAPS). LNCS, vol. 8413, pp. 593\u2013598. Springer, Heidelberg (2014)"},{"key":"9_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"131","DOI":"10.1007\/978-3-319-24953-7_10","volume-title":"Automated Technology for Verification and Analysis","author":"A Hartmanns","year":"2015","unstructured":"Hartmanns, A., Hermanns, H.: Explicit model checking of very large mdp using partitioning and secondary storage. In: Finkbeiner, B., Pu, G., Zhang, L. (eds.) ATVA 2015. LNCS, vol. 9364, pp. 131\u2013147. Springer, Heidelberg (2015)"},{"key":"9_CR20","volume-title":"Communicating Sequential Processes","author":"CAR Hoare","year":"1985","unstructured":"Hoare, C.A.R.: Communicating Sequential Processes. Prentice-Hall, London (1985)"},{"key":"9_CR21","doi-asserted-by":"crossref","unstructured":"Ingols, K., Chu, M., Lippmann, R., Webster, S., Boyer, S.: Modeling modern network attacks and countermeasures using attack graphs. In: Annual Conference on Computer Security Applications ACSAC 2009, pp. 117\u2013126, December 2009","DOI":"10.1109\/ACSAC.2009.21"},{"key":"9_CR22","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"251","DOI":"10.1007\/978-3-540-78524-8_15","volume-title":"Theory of Cryptography","author":"J Katz","year":"2008","unstructured":"Katz, J.: Bridging game theory and cryptography: recent results and future directions. In: Canetti, R. (ed.) TCC 2008. LNCS, vol. 4948, pp. 251\u2013272. Springer, Heidelberg (2008)"},{"key":"9_CR23","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. 6561, pp. 80\u201395. Springer, Heidelberg (2011)"},{"key":"9_CR24","first-page":"1","volume":"13\u201314","author":"B Kordy","year":"2013","unstructured":"Kordy, B., Pietre-Cambacedes, L., Schweitzer, P.: DAG-based attack and defense modeling: Don\u2019t miss the forest for the attack trees. CoRR 13\u201314, 1\u201338 (2013)","journal-title":"CoRR"},{"key":"9_CR25","unstructured":"Kr\u00e4mer, J.: Attack-Defence Graphs - On the Formalisation of Security-Critical Systems. Master\u2019s thesis, Saarland University, Saarbr\u00fccken, Germany (2015)"},{"key":"9_CR26","unstructured":"Kumar, R., Guck, D., Stoelinga, M.I.A.: Time dependent analysis with dynamic counter measure trees (2015)"},{"key":"9_CR27","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"156","DOI":"10.1007\/978-3-319-22975-1_11","volume-title":"Formal Modeling and Analysis of Timed Systems","author":"R Kumar","year":"2015","unstructured":"Kumar, R., Ruijters, E., Stoelinga, M.: Quantitative attack tree analysis via priced timed automata. In: Sankaranarayanan, S., Vicario, E. (eds.) FORMATS 2015. LNCS, vol. 9268, pp. 156\u2013171. Springer, Heidelberg (2015)"},{"key":"9_CR28","doi-asserted-by":"crossref","unstructured":"LeMay, E., Ford, M.D., Keefe, K., Sanders, W.H., Muehrcke, C.: Model-based security metrics using adversary view security evaluation (ADVISE). In: QEST, pp. 191\u2013200, Washington, DC, USA, IEEE (2011)","DOI":"10.1109\/QEST.2011.34"},{"issue":"1\u20132","key":"9_CR29","doi-asserted-by":"publisher","first-page":"71","DOI":"10.1007\/s10207-004-0060-x","volume":"4","author":"K-W Lye","year":"2005","unstructured":"Lye, K.-W., Wing, J.M.: Game strategies in network security. Int. J. Inf. Sec. 4(1\u20132), 71\u201386 (2005)","journal-title":"Int. J. Inf. Sec."},{"key":"9_CR30","volume-title":"Concurrency - state models and Java programs","author":"J Magee","year":"2006","unstructured":"Magee, J., Kramer, J.: Concurrency - state models and Java programs, 2nd edn. Wiley, New York (2006)","edition":"2"},{"issue":"3","key":"9_CR31","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/2480741.2480742","volume":"45","author":"MH Manshaei","year":"2013","unstructured":"Manshaei, M.H., Zhu, Q., Alpcan, T., Bac\u015far, T., Hubaux, J.-P.: Game theory meets network security and privacy. ACM Comput. Surv. 45(3), 1\u201339 (2013)","journal-title":"ACM Comput. Surv."},{"key":"9_CR32","unstructured":"Mateski, M., Trevino, C.M., Veitch, C.K., Michalski, J., Harris, J.M., Maruoka, S., Frye, J.: Cyber threat metrics. Technical report SAND2012-2427, Sandia National Laboratories, March 2012"},{"key":"9_CR33","unstructured":"Pietre-Cambacedes, L., Bouissou, M.: Beyond attack trees: dynamic security modeling with boolean logic driven markov processes (BDMP). In: Dependable Computing Conference (EDCC), 2010 European, pp. 199\u2013208, April 2010"},{"key":"9_CR34","doi-asserted-by":"crossref","unstructured":"Rontidis, G., Panaousis, E.A., Laszka, A., Dagiuklas, T., Malacaria, P., Alpcan, T.: A game-theoretic approach for minimizing security risks in the internet-of-things. In : IEEE International Conference on Communication, Workshop Proceedings, pp. 2639\u20132644 (2015)","DOI":"10.1109\/ICCW.2015.7247577"},{"issue":"8","key":"9_CR35","doi-asserted-by":"publisher","first-page":"929","DOI":"10.1002\/sec.299","volume":"5","author":"A Roy","year":"2012","unstructured":"Roy, A., Kim, D.S., Trivedi, K.S.: Attack countermeasure trees (ACT): towards unifying the constructs of attack and defense trees. Sec. Commun. Netw. 5(8), 929\u2013943 (2012)","journal-title":"Sec. Commun. Netw."},{"key":"9_CR36","doi-asserted-by":"crossref","unstructured":"Zhu, Q., Fung, C.J., Boutaba, R., Barsar, T.: A game-theoretic approach to knowledge sharing in distributed collaborative intrusion detection networks: fairness. incentives and security, In: CDC (2011)","DOI":"10.1109\/CDC.2011.6161171"},{"issue":"2","key":"9_CR37","doi-asserted-by":"publisher","first-page":"395","DOI":"10.1109\/TPDS.2013.211","volume":"25","author":"SA Zonouz","year":"2014","unstructured":"Zonouz, S.A., Khurana, H., Sanders, W.H., Yardley, T.M.: Rre: a game-theoretic intrusion response and recovery engine. IEEE Trans. Parallel Distrib. Syst. 25(2), 395\u2013406 (2014)","journal-title":"IEEE Trans. Parallel Distrib. Syst."}],"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-662-49635-0_9","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,1]],"date-time":"2019-06-01T16:24:23Z","timestamp":1559406263000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-662-49635-0_9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016]]},"ISBN":["9783662496343","9783662496350"],"references-count":37,"URL":"https:\/\/doi.org\/10.1007\/978-3-662-49635-0_9","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2016]]}}}