{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,7]],"date-time":"2026-05-07T10:51:31Z","timestamp":1778151091858,"version":"3.51.4"},"publisher-location":"Cham","reference-count":30,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783030634056","type":"print"},{"value":"9783030634063","type":"electronic"}],"license":[{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"content-version":"vor","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":[[2020]]},"DOI":"10.1007\/978-3-030-63406-3_1","type":"book-chapter","created":{"date-parts":[[2020,12,18]],"date-time":"2020-12-18T16:05:19Z","timestamp":1608307519000},"page":"3-19","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":9,"title":["Hackers vs. Security: Attack-Defence Trees as Asynchronous Multi-agent Systems"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-3019-4902","authenticated-orcid":false,"given":"Jaime","family":"Arias","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-8807-1548","authenticated-orcid":false,"given":"Carlos E.","family":"Budde","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-6477-4863","authenticated-orcid":false,"given":"Wojciech","family":"Penczek","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-3154-5268","authenticated-orcid":false,"given":"Laure","family":"Petrucci","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-4393-3447","authenticated-orcid":false,"given":"Teofil","family":"Sidoruk","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-6793-8165","authenticated-orcid":false,"given":"Mari\u00eblle","family":"Stoelinga","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2020,12,19]]},"reference":[{"key":"1_CR1","unstructured":"ADT2AMAS. https:\/\/depot.lipn.univ-paris13.fr\/parties\/tools\/adt2amas"},{"key":"1_CR2","unstructured":"IMITATOR. https:\/\/www.imitator.fr"},{"key":"1_CR3","doi-asserted-by":"publisher","unstructured":"Alur, R., Henzinger, T., Vardi, M.: Parametric real-time reasoning. In: ACM Symposium on Theory of Computing, pp. 592\u2013601. ACM (1993). https:\/\/doi.org\/10.1145\/167088.167242","DOI":"10.1145\/167088.167242"},{"key":"1_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"33","DOI":"10.1007\/978-3-642-32759-9_6","volume-title":"FM 2012: Formal Methods","author":"\u00c9 Andr\u00e9","year":"2012","unstructured":"Andr\u00e9, \u00c9., Fribourg, L., K\u00fchne, U., Soulat, R.: IMITATOR 2.5: a tool for analyzing robustness in scheduling problems. In: Giannakopoulou, D., M\u00e9ry, D. (eds.) FM 2012. LNCS, vol. 7436, pp. 33\u201336. Springer, Heidelberg (2012). https:\/\/doi.org\/10.1007\/978-3-642-32759-9_6"},{"key":"1_CR5","doi-asserted-by":"publisher","unstructured":"Andr\u00e9, \u00c9., Lime, D., Ramparison, M., Stoelinga, M.: Parametric analyses of attack-fault trees. In: ACSD 2019, pp. 33\u201342. IEEE (2019). https:\/\/doi.org\/10.1109\/ACSD.2019.00008","DOI":"10.1109\/ACSD.2019.00008"},{"key":"1_CR6","unstructured":"Arias, J., Budde, C.E., Penczek, W., Petrucci, L., Sidoruk, T., Stoelinga, M.: Hackers vs. security: attack-defence trees as asynchronous multi-agent systems. HAL (2020). https:\/\/hal.archives-ouvertes.fr\/hal-02902348"},{"key":"1_CR7","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. LNCS, vol. 9338, pp. 291\u2013299. Springer, Cham (2015). https:\/\/doi.org\/10.1007\/978-3-319-24249-1_25"},{"key":"1_CR8","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). https:\/\/doi.org\/10.1007\/978-3-662-46666-7_6"},{"key":"1_CR9","doi-asserted-by":"publisher","unstructured":"Aslanyan, Z., Nielson, F., Parker, D.: Quantitative verification and synthesis of attack-defence scenarios. In: CSF 2016, pp. 105\u2013119. IEEE (2016). https:\/\/doi.org\/10.1109\/CSF.2016.15","DOI":"10.1109\/CSF.2016.15"},{"key":"1_CR10","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: Lopez, J. (ed.) CRITIS 2006. LNCS, vol. 4347, pp. 235\u2013248. Springer, Heidelberg (2006). https:\/\/doi.org\/10.1007\/11962977_19"},{"issue":"4","key":"1_CR11","doi-asserted-by":"publisher","first-page":"397","DOI":"10.1007\/s10009-014-0361-y","volume":"17","author":"A David","year":"2015","unstructured":"David, A., Larsen, K.G., Legay, A., Miku\u010dionis, M., Poulsen, D.B.: Uppaal SMC tutorial. Int. J. Softw. Tools Technol. Transf. 17(4), 397\u2013415 (2015). https:\/\/doi.org\/10.1007\/s10009-014-0361-y","journal-title":"Int. J. Softw. Tools Technol. Transf."},{"key":"1_CR12","doi-asserted-by":"crossref","DOI":"10.7551\/mitpress\/5803.001.0001","volume-title":"Reasoning About Knowledge","author":"R Fagin","year":"1995","unstructured":"Fagin, R., Halpern, J., Moses, Y., Vardi, M.: Reasoning About Knowledge. MIT Press, Cambridge (1995)"},{"key":"1_CR13","doi-asserted-by":"publisher","unstructured":"Fila, B., Widel, W.: Efficient attack-defense tree analysis using Pareto attribute domains. In: CSF 2019, pp. 200\u2013215. IEEE (2019). https:\/\/doi.org\/10.1109\/CSF.2019.00021","DOI":"10.1109\/CSF.2019.00021"},{"key":"1_CR14","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). https:\/\/doi.org\/10.1007\/978-3-319-44878-7_3"},{"key":"1_CR15","doi-asserted-by":"publisher","first-page":"91","DOI":"10.1016\/j.entcs.2014.12.014","volume":"310","author":"M Gribaudo","year":"2015","unstructured":"Gribaudo, M., Iacono, M., Marrone, S.: Exploiting Bayesian networks for the analysis of combined attack trees. ENTCS 310, 91\u2013111 (2015). https:\/\/doi.org\/10.1016\/j.entcs.2014.12.014","journal-title":"ENTCS"},{"key":"1_CR16","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). https:\/\/doi.org\/10.1007\/978-3-662-49635-0_9"},{"key":"1_CR17","unstructured":"Jamroga, W., Penczek, W., Dembinski, P., Mazurkiewicz, A.: Towards partial order reductions for strategic ability. In: AAMAS 2018, pp. 156\u2013165. ACM (2018)"},{"key":"1_CR18","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. IAICT, vol. 455, pp. 339\u2013353. Springer, Cham (2015). https:\/\/doi.org\/10.1007\/978-3-319-18467-8_23"},{"key":"1_CR19","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. LNCS, vol. 5332, pp. 1036\u20131051. Springer, Heidelberg (2008). https:\/\/doi.org\/10.1007\/978-3-540-88873-4_8"},{"key":"1_CR20","doi-asserted-by":"publisher","unstructured":"Khand, P.: System level security modeling using attack trees. In: 2nd International Conference on Computer, Control and Communication, pp. 1\u20136 (2009). https:\/\/doi.org\/10.1109\/IC4.2009.4909245","DOI":"10.1109\/IC4.2009.4909245"},{"key":"1_CR21","unstructured":"Knapik, M., Penczek, W., Petrucci, L., Sidoruk, T.: Squeezing state spaces of (attack-defence) trees. In: ICECCS 2019. IEEE Computer Society (2019)"},{"issue":"1","key":"1_CR22","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-defense trees. J. Log. Comput. 24(1), 55\u201387 (2014). https:\/\/doi.org\/10.1093\/logcom\/exs029","journal-title":"J. Log. Comput."},{"key":"1_CR23","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). https:\/\/doi.org\/10.1016\/j.cosrev.2014.07.001","journal-title":"Comput. Sci. Rev."},{"key":"1_CR24","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, Cham (2015). https:\/\/doi.org\/10.1007\/978-3-319-22975-1_11"},{"key":"1_CR25","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"56","DOI":"10.1007\/978-3-319-89363-1_4","volume-title":"Fundamental Approaches to Software Engineering","author":"R Kumar","year":"2018","unstructured":"Kumar, R., et al.: Effective analysis of attack trees: a model-driven approach. In: Russo, A., Sch\u00fcrr, A. (eds.) FASE 2018. LNCS, vol. 10802, pp. 56\u201373. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-319-89363-1_4"},{"key":"1_CR26","doi-asserted-by":"crossref","unstructured":"Kumar, R., Stoelinga, M.: Quantitative security and safety analysis with attack-fault trees. In: HASE 2017, pp. 25\u201332. IEEE (2017)","DOI":"10.1109\/HASE.2017.12"},{"key":"1_CR27","doi-asserted-by":"crossref","unstructured":"Lomuscio, A., Penczek, W., Qu, H.: Partial order reductions for model checking temporal epistemic logics over interleaved multi-agent systems. In: AAMAS 2010, vol. 1\u20133, pp. 659\u2013666. IFAAMAS (2010)","DOI":"10.3233\/FI-2010-276"},{"key":"1_CR28","doi-asserted-by":"publisher","unstructured":"Sheyner, O., Haines, J., Jha, S., Lippmann, R., Wing, J.: Automated generation and analysis of attack graphs. In: Proceedings 2002 IEEE Symposium on Security and Privacy, pp. 273\u2013284 (2002). https:\/\/doi.org\/10.1109\/SECPRI.2002.1004377","DOI":"10.1109\/SECPRI.2002.1004377"},{"key":"1_CR29","unstructured":"Weiss, J.: A system security engineering process. In: Proceedings of the 14th National Computer Security Conference, pp. 572\u2013581 (1991)"},{"issue":"4","key":"1_CR30","doi-asserted-by":"publisher","first-page":"75:1","DOI":"10.1145\/3331524","volume":"52","author":"W Widel","year":"2019","unstructured":"Widel, W., Audinot, M., Fila, B., Pinchinat, S.: Beyond 2014: formal methods for attack tree-based security modeling. ACM Comp. Surv. 52(4), 75:1\u201375:36 (2019). https:\/\/doi.org\/10.1145\/3331524","journal-title":"ACM Comp. Surv."}],"container-title":["Lecture Notes in Computer Science","Formal Methods and Software Engineering"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-63406-3_1","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,8,19]],"date-time":"2024-08-19T14:34:21Z","timestamp":1724078061000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-030-63406-3_1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020]]},"ISBN":["9783030634056","9783030634063"],"references-count":30,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-63406-3_1","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2020]]},"assertion":[{"value":"19 December 2020","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"ICFEM","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Formal Engineering Methods","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Singapore","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Singapore","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2020","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"1 March 2020","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"3 March 2020","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"22","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"icfem2020","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/formal-analysis.com\/icfem\/2020\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Single-blind","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":"41","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":"16","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":"4","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":"39% - 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":"2","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":"No","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"1 Doctoral symposium paper in the back matter","order":10,"name":"additional_info_on_review_process","label":"Additional Info on Review Process","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}