{"id":"https://openalex.org/W4311413143","doi":"https://doi.org/10.1109/tdsc.2022.3215752","title":"Efficient and Generic Algorithms for Quantitative Attack Tree Analysis","display_name":"Efficient and Generic Algorithms for Quantitative Attack Tree Analysis","publication_year":2022,"publication_date":"2022-11-03","ids":{"openalex":"https://openalex.org/W4311413143","doi":"https://doi.org/10.1109/tdsc.2022.3215752"},"language":"en","primary_location":{"id":"doi:10.1109/tdsc.2022.3215752","is_oa":false,"landing_page_url":"https://doi.org/10.1109/tdsc.2022.3215752","pdf_url":null,"source":{"id":"https://openalex.org/S133795288","display_name":"IEEE Transactions on Dependable and Secure Computing","issn_l":"1545-5971","issn":["1545-5971","1941-0018","2160-9209"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320439","host_organization_name":"IEEE Computer Society","host_organization_lineage":["https://openalex.org/P4310320439","https://openalex.org/P4310319808"],"host_organization_lineage_names":["IEEE Computer Society","Institute of Electrical and Electronics Engineers"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"IEEE Transactions on Dependable and Secure Computing","raw_type":"journal-article"},"type":"article","indexed_in":["arxiv","crossref"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://arxiv.org/pdf/2212.05358","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5066676005","display_name":"Milan Lopuha\u00e4-Zwakenberg","orcid":"https://orcid.org/0000-0001-5687-854X"},"institutions":[{"id":"https://openalex.org/I94624287","display_name":"University of Twente","ror":"https://ror.org/006hf6230","country_code":"NL","type":"education","lineage":["https://openalex.org/I94624287"]}],"countries":["NL"],"is_corresponding":false,"raw_author_name":"Milan Lopuha\u00e4-Zwakenberg","raw_affiliation_strings":["Formal Methods &#x0026; Tools Group, University of Twente, Enschede, NB, The Netherlands"],"raw_orcid":"https://orcid.org/0000-0001-5687-854X","affiliations":[{"raw_affiliation_string":"Formal Methods &#x0026; Tools Group, University of Twente, Enschede, NB, The Netherlands","institution_ids":["https://openalex.org/I94624287"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5026004403","display_name":"Carlos E. Budde","orcid":"https://orcid.org/0000-0001-8807-1548"},"institutions":[{"id":"https://openalex.org/I193223587","display_name":"University of Trento","ror":"https://ror.org/05trd4x28","country_code":"IT","type":"education","lineage":["https://openalex.org/I193223587"]}],"countries":["IT"],"is_corresponding":false,"raw_author_name":"Carlos E. Budde","raw_affiliation_strings":["Security Group, University of Trento, Trento, Italy"],"raw_orcid":"https://orcid.org/0000-0001-8807-1548","affiliations":[{"raw_affiliation_string":"Security Group, University of Trento, Trento, Italy","institution_ids":["https://openalex.org/I193223587"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5053065289","display_name":"Mari\u00eblle Stoelinga","orcid":"https://orcid.org/0000-0001-6793-8165"},"institutions":[{"id":"https://openalex.org/I145872427","display_name":"Radboud University Nijmegen","ror":"https://ror.org/016xsfp80","country_code":"NL","type":"education","lineage":["https://openalex.org/I145872427"]},{"id":"https://openalex.org/I94624287","display_name":"University of Twente","ror":"https://ror.org/006hf6230","country_code":"NL","type":"education","lineage":["https://openalex.org/I94624287"]}],"countries":["NL"],"is_corresponding":false,"raw_author_name":"Mari\u00eblle Stoelinga","raw_affiliation_strings":["Formal Methods &#x0026; Tools Group, University of Twente, Enschede, NB, The Netherlands","Department of Software Science, Radboud University, Nijmegen, XZ, The Netherlands"],"raw_orcid":"https://orcid.org/0000-0001-6793-8165","affiliations":[{"raw_affiliation_string":"Formal Methods &#x0026; Tools Group, University of Twente, Enschede, NB, The Netherlands","institution_ids":["https://openalex.org/I94624287"]},{"raw_affiliation_string":"Department of Software Science, Radboud University, Nijmegen, XZ, The Netherlands","institution_ids":["https://openalex.org/I145872427"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":3,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":2.2646,"has_fulltext":true,"cited_by_count":22,"citation_normalized_percentile":{"value":0.88116425,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":99},"biblio":{"volume":"20","issue":"5","first_page":"4169","last_page":"4187"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10400","display_name":"Network Security and Intrusion Detection","score":0.9932000041007996,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T10400","display_name":"Network Security and Intrusion Detection","score":0.9932000041007996,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10734","display_name":"Information and Cyber Security","score":0.9925000071525574,"subfield":{"id":"https://openalex.org/subfields/1710","display_name":"Information Systems"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T11241","display_name":"Advanced Malware Detection Techniques","score":0.9825000166893005,"subfield":{"id":"https://openalex.org/subfields/1711","display_name":"Signal Processing"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/directed-acyclic-graph","display_name":"Directed acyclic graph","score":0.8130158185958862},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.7499397993087769},{"id":"https://openalex.org/keywords/tree","display_name":"Tree (set theory)","score":0.5474265217781067},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.52791428565979},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.4198964834213257},{"id":"https://openalex.org/keywords/domain","display_name":"Domain (mathematical analysis)","score":0.41007184982299805},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.18982496857643127}],"concepts":[{"id":"https://openalex.org/C74197172","wikidata":"https://www.wikidata.org/wiki/Q1195339","display_name":"Directed acyclic graph","level":2,"score":0.8130158185958862},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7499397993087769},{"id":"https://openalex.org/C113174947","wikidata":"https://www.wikidata.org/wiki/Q2859736","display_name":"Tree (set theory)","level":2,"score":0.5474265217781067},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.52791428565979},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.4198964834213257},{"id":"https://openalex.org/C36503486","wikidata":"https://www.wikidata.org/wiki/Q11235244","display_name":"Domain (mathematical analysis)","level":2,"score":0.41007184982299805},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.18982496857643127},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0}],"mesh":[],"locations_count":6,"locations":[{"id":"doi:10.1109/tdsc.2022.3215752","is_oa":false,"landing_page_url":"https://doi.org/10.1109/tdsc.2022.3215752","pdf_url":null,"source":{"id":"https://openalex.org/S133795288","display_name":"IEEE Transactions on Dependable and Secure Computing","issn_l":"1545-5971","issn":["1545-5971","1941-0018","2160-9209"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320439","host_organization_name":"IEEE Computer Society","host_organization_lineage":["https://openalex.org/P4310320439","https://openalex.org/P4310319808"],"host_organization_lineage_names":["IEEE Computer Society","Institute of Electrical and Electronics Engineers"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"IEEE Transactions on Dependable and Secure Computing","raw_type":"journal-article"},{"id":"pmh:oai:arXiv.org:2212.05358","is_oa":true,"landing_page_url":"http://arxiv.org/abs/2212.05358","pdf_url":"https://arxiv.org/pdf/2212.05358","source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"text"},{"id":"pmh:oai:iris.unitn.it:11572/357438","is_oa":true,"landing_page_url":"https://hdl.handle.net/11572/357438","pdf_url":"https://iris.unitn.it/bitstream/11572/357438/3/Efficient_and_Generic_Algorithms_for_Quantitative_Attack_Tree_Analysis.pdf","source":{"id":"https://openalex.org/S4377196320","display_name":"Iris (University of Trento)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I193223587","host_organization_name":"University of Trento","host_organization_lineage":["https://openalex.org/I193223587"],"host_organization_lineage_names":[],"type":"repository"},"license":"other-oa","license_id":"https://openalex.org/licenses/other-oa","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"info:eu-repo/semantics/article"},{"id":"pmh:oai:repository.ubn.ru.nl:2066/297133","is_oa":true,"landing_page_url":"https://hdl.handle.net/2066/297133","pdf_url":"https://repository.ubn.ru.nl//bitstream/handle/2066/297133/297133.pdf","source":{"id":"https://openalex.org/S4306401067","display_name":"Radboud Repository (Radboud University)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I145872427","host_organization_name":"Radboud University Nijmegen","host_organization_lineage":["https://openalex.org/I145872427"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":"Article / Letter to editor"},{"id":"pmh:oai:ris.utwente.nl:openaire_cris_publications/2e056242-7fcd-4fc6-af41-a3bf2a9eae6c","is_oa":true,"landing_page_url":"https://research.utwente.nl/en/publications/2e056242-7fcd-4fc6-af41-a3bf2a9eae6c","pdf_url":"https://ris.utwente.nl/ws/files/349400133/Efficient_and_Generic_Algorithms_for_Quantitative_Attack_Tree_Analysis.pdf","source":{"id":"https://openalex.org/S4406922991","display_name":"University of Twente Research Information","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":"other-oa","license_id":"https://openalex.org/licenses/other-oa","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Lopuhaa-Zwakenberg, M, Budde, C E & Stoelinga, M 2023, 'Efficient and Generic Algorithms for Quantitative Attack Tree Analysis', IEEE transactions on dependable and secure computing, vol. 20, no. 5, pp. 4169-4187. https://doi.org/10.1109/TDSC.2022.3215752","raw_type":"info:eu-repo/semantics/article"},{"id":"pmh:oai:ris.utwente.nl:publications/2e056242-7fcd-4fc6-af41-a3bf2a9eae6c","is_oa":false,"landing_page_url":null,"pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":""}],"best_oa_location":{"id":"pmh:oai:arXiv.org:2212.05358","is_oa":true,"landing_page_url":"http://arxiv.org/abs/2212.05358","pdf_url":"https://arxiv.org/pdf/2212.05358","source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"text"},"sustainable_development_goals":[],"awards":[{"id":"https://openalex.org/G1235585194","display_name":null,"funder_award_id":"GA n.101067199-ProSVED","funder_id":"https://openalex.org/F4320320300","funder_display_name":"European Commission"},{"id":"https://openalex.org/G8014500492","display_name":null,"funder_award_id":"101067199-ProSVED","funder_id":"https://openalex.org/F4320320300","funder_display_name":"European Commission"},{"id":"https://openalex.org/G8491077145","display_name":null,"funder_award_id":"864075","funder_id":"https://openalex.org/F4320320300","funder_display_name":"European Commission"},{"id":"https://openalex.org/G8735403958","display_name":null,"funder_award_id":"101067199","funder_id":"https://openalex.org/F4320320300","funder_display_name":"European Commission"}],"funders":[{"id":"https://openalex.org/F4320320300","display_name":"European Commission","ror":"https://ror.org/00k4n6c32"},{"id":"https://openalex.org/F4320334679","display_name":"Research Executive Agency","ror":"https://ror.org/00k4n6c32"}],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":62,"referenced_works":["https://openalex.org/W201786483","https://openalex.org/W1159968740","https://openalex.org/W1498432697","https://openalex.org/W1505421125","https://openalex.org/W1521415124","https://openalex.org/W1524147119","https://openalex.org/W1533876796","https://openalex.org/W1563330328","https://openalex.org/W1587691136","https://openalex.org/W1793101635","https://openalex.org/W1951555804","https://openalex.org/W1964385350","https://openalex.org/W1967770890","https://openalex.org/W1978353289","https://openalex.org/W1983711511","https://openalex.org/W1999545213","https://openalex.org/W2013781926","https://openalex.org/W2034524431","https://openalex.org/W2048972217","https://openalex.org/W2055097977","https://openalex.org/W2076921432","https://openalex.org/W2080267935","https://openalex.org/W2091973517","https://openalex.org/W2096349415","https://openalex.org/W2096740130","https://openalex.org/W2101508170","https://openalex.org/W2115826669","https://openalex.org/W2120713972","https://openalex.org/W2121337044","https://openalex.org/W2139969801","https://openalex.org/W2146024157","https://openalex.org/W2156607688","https://openalex.org/W2159763578","https://openalex.org/W2169528473","https://openalex.org/W2316039394","https://openalex.org/W2401679532","https://openalex.org/W2402139032","https://openalex.org/W2489519702","https://openalex.org/W2507595475","https://openalex.org/W2533940363","https://openalex.org/W2538768042","https://openalex.org/W2736293034","https://openalex.org/W2788810798","https://openalex.org/W2795657201","https://openalex.org/W2799193011","https://openalex.org/W2896995504","https://openalex.org/W2902473721","https://openalex.org/W2971584138","https://openalex.org/W2971964194","https://openalex.org/W2991092985","https://openalex.org/W3031671265","https://openalex.org/W3112635018","https://openalex.org/W3188190072","https://openalex.org/W3193789558","https://openalex.org/W3204584439","https://openalex.org/W4226481256","https://openalex.org/W4283012892","https://openalex.org/W4301209572","https://openalex.org/W6640841298","https://openalex.org/W6712592528","https://openalex.org/W6803319408","https://openalex.org/W6812742317"],"related_works":["https://openalex.org/W2051487156","https://openalex.org/W4302345037","https://openalex.org/W2731094954","https://openalex.org/W2789273959","https://openalex.org/W2073681303","https://openalex.org/W1998712144","https://openalex.org/W2952978498","https://openalex.org/W4292730466","https://openalex.org/W2951616510","https://openalex.org/W3122467582"],"abstract_inverted_index":{"Numerous":[0],"analysis":[1,7],"methods":[2,46],"for":[3],"quantitative":[4],"attack":[5,59,64,113,117],"tree":[6,114],"have":[8],"been":[9],"proposed.":[10],"These":[11],"algorithms":[12,94],"compute":[13],"relevant":[14],"security":[15,25,108],"metrics,":[16],"i.e.,":[17],"performance":[18],"indicators":[19],"that":[20,95],"quantify":[21],"how":[22],"good":[23],"the":[24,33,37,40,112,133],"of":[26,87,106,136],"a":[27,98,103],"system":[28],"is;":[29],"typical":[30],"metrics":[31,52,109],"being":[32],"most":[34,41],"likely":[35],"attack,":[36],"cheapest,":[38],"or":[39,53],"damaging":[42],"one.":[43],"However,":[44],"existing":[45],"are":[47,124],"only":[48],"geared":[49],"towards":[50],"specific":[51],"do":[54],"not":[55],"work":[56,96],"on":[57,111],"general":[58],"trees.":[60],"This":[61],"article":[62],"classifies":[63],"trees":[65,70,118],"in":[66],"two":[67],"dimensions:":[68],"proper":[69],"versus":[71,81],"directed":[72,120],"acyclic":[73,121],"graphs":[74],"(i.e.,":[75],"with":[76,119],"shared":[77],"subtrees);":[78],"and":[79],"static":[80],"dynamic":[82,116],"gates.":[83],"For":[84],"three":[85],"out":[86],"these":[88],"four":[89],"classes,":[90],"we":[91],"propose":[92],"novel":[93],"over":[97],"generic":[99],"attribute":[100],"domain,":[101],"encompassing":[102],"large":[104],"number":[105],"concrete":[107],"defined":[110],"semantics;":[115],"graph":[122],"structure":[123],"left":[125],"as":[126],"an":[127],"open":[128],"problem.":[129],"We":[130],"also":[131],"analyse":[132],"computational":[134],"complexity":[135],"our":[137],"methods.":[138]},"counts_by_year":[{"year":2026,"cited_by_count":2},{"year":2025,"cited_by_count":8},{"year":2024,"cited_by_count":11},{"year":2023,"cited_by_count":1}],"updated_date":"2026-07-15T18:14:33.161393","created_date":"2025-10-10T00:00:00"}
