{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,4]],"date-time":"2026-03-04T17:05:23Z","timestamp":1772643923530,"version":"3.50.1"},"reference-count":32,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","license":[{"start":{"date-parts":[[2019,1,1]],"date-time":"2019-01-01T00:00:00Z","timestamp":1546300800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/OAPA.html"}],"funder":[{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["61502528"],"award-info":[{"award-number":["61502528"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Access"],"published-print":{"date-parts":[[2019]]},"DOI":"10.1109\/access.2019.2915091","type":"journal-article","created":{"date-parts":[[2019,5,8]],"date-time":"2019-05-08T00:48:40Z","timestamp":1557276520000},"page":"59346-59356","source":"Crossref","is-referenced-by-count":20,"title":["An Improved Attack Path Discovery Algorithm Through Compact Graph Planning"],"prefix":"10.1109","volume":"7","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-1791-586X","authenticated-orcid":false,"given":"Zang","family":"Yichao","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Zhou","family":"Tianyang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ge","family":"Xiaoyue","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Wang","family":"Qingxian","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref32","doi-asserted-by":"publisher","DOI":"10.1109\/CINTI.2014.7028682"},{"key":"ref31","first-page":"615","article-title":"Heuristic planning for PDDL+ domains","author":"piotrowski","year":"2016","journal-title":"Proc Workshops 13th AAAI Conf Artif Intell"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.3150\/14-BEJ689"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-66505-4_3"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1145\/1180405.1180446"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1109\/TIFS.2018.2821095"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1109\/TSG.2015.2409775"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1145\/3180374.3181346"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1109\/CyberC.2014.18"},{"key":"ref16","first-page":"1180","article-title":"An attack graph generation method based on heuristic searching strategy","author":"wang","year":"2016","journal-title":"Proc 2nd IEEE Int Conf Comput Commun (ICCC)"},{"key":"ref17","first-page":"126","article-title":"Method of network attack graph generation based on greedy policy","volume":"37","author":"shunhong","year":"2011","journal-title":"Comput Eng"},{"key":"ref18","author":"wilkins","year":"2014","journal-title":"Practical Planning Extending the Classical AI Planning Paradigm"},{"key":"ref19","article-title":"Automated cyber red teaming","author":"yuen","year":"2015"},{"key":"ref28","first-page":"8000","article-title":"A brief history and recent achievements in bidirectional search","author":"sturtevant","year":"2018","journal-title":"Proc 32nd AAAI Conf Artif Intell"},{"key":"ref4","year":"2019","journal-title":"AutoSploit–Automated Mass Exploiter"},{"key":"ref27","author":"stephane","year":"0","journal-title":"Functional dependencies"},{"key":"ref3","year":"2019","journal-title":"APT2—An Automated Penetration Testing Toolkit"},{"key":"ref6","first-page":"70","article-title":"Modeling and computation in planning: Better heuristics from more expressive languages","author":"frances","year":"2015","journal-title":"Proc of the Int Conf on Automated Planning and Scheduling"},{"key":"ref29","first-page":"3409","article-title":"tburton: A divide and conquer temporal planner","author":"wang","year":"2015","journal-title":"Proc 29th AAAI Conf Artif Intell"},{"key":"ref5","first-page":"8","article-title":"MulVAL: A logic-based network security analyzer","author":"ou","year":"2005","journal-title":"Proc Usenix Secur Symp"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1109\/DISCEX.2001.932182"},{"key":"ref7","first-page":"344","article-title":"Tools for generating and analyzing attack graphs","author":"sheyner","year":"2003","journal-title":"Proc Symp Formal Methods for Components and Objects"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1016\/j.csi.2017.09.006"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1109\/CISE.2009.5365235"},{"key":"ref1","year":"2019","journal-title":"National Internet Emergency Response Center (CNCERT-CC)"},{"key":"ref20","author":"obes","year":"2013","journal-title":"Attack planning in the real world"},{"key":"ref22","first-page":"12","article-title":"Course of action generation for cyber security using classical planning","author":"boddy","year":"2005","journal-title":"Proc ICAPS"},{"key":"ref21","author":"sarraute","year":"2013","journal-title":"Automated attack planning"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1016\/j.compbiomed.2014.08.004"},{"key":"ref23","first-page":"50","article-title":"Personalized vulnerability analysis through automated planning","author":"roberts","year":"2011","journal-title":"Proc Working Notes IJCAI Workshop Intell Secur (SecArt)"},{"key":"ref26","first-page":"580","article-title":"Dependency structures of database relationship","volume":"54","author":"armstrong","year":"1974","journal-title":"Inf Process"},{"key":"ref25","first-page":"6343","article-title":"Armstrong’s axioms and navigation strategies","author":"deuser","year":"2018","journal-title":"Proc 32nd AAAI Conf Artif Intell"}],"container-title":["IEEE Access"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/6287639\/8600701\/08708196.pdf?arnumber=8708196","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,8,10]],"date-time":"2021-08-10T19:40:00Z","timestamp":1628624400000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/8708196\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019]]},"references-count":32,"URL":"https:\/\/doi.org\/10.1109\/access.2019.2915091","relation":{},"ISSN":["2169-3536"],"issn-type":[{"value":"2169-3536","type":"electronic"}],"subject":[],"published":{"date-parts":[[2019]]}}}