{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,4]],"date-time":"2026-02-04T17:04:15Z","timestamp":1770224655618,"version":"3.49.0"},"reference-count":30,"publisher":"Zhejiang University Press","issue":"9","license":[{"start":{"date-parts":[[2019,9,1]],"date-time":"2019-09-01T00:00:00Z","timestamp":1567296000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2019,9,1]],"date-time":"2019-09-01T00:00:00Z","timestamp":1567296000000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"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":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Frontiers Inf Technol Electronic Eng"],"published-print":{"date-parts":[[2019,9]]},"DOI":"10.1631\/fitee.1800532","type":"journal-article","created":{"date-parts":[[2019,10,18]],"date-time":"2019-10-18T12:01:05Z","timestamp":1571400065000},"page":"1277-1288","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":38,"title":["NIG-AP: a new method for automated penetration testing"],"prefix":"10.1631","volume":"20","author":[{"given":"Tian-yang","family":"Zhou","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-1791-586X","authenticated-orcid":false,"given":"Yi-chao","family":"Zang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jun-hu","family":"Zhu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Qing-xian","family":"Wang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"635","published-online":{"date-parts":[[2019,10,18]]},"reference":[{"key":"1435_CR1","series-title":"MS Thesis","volume-title":"Automated Attack Planning Using a Partially Observable Model for Penetration Testing of Industrial Control Systems","author":"AS Alexander Pretschner","year":"2017","unstructured":"Alexander Pretschner AS, 2017. Automated Attack Planning Using a Partially Observable Model for Penetration Testing of Industrial Control Systems. MS Thesis, Technische Universit\u00e4t M\u00fcnchen, M\u00fcnchen, Germany."},{"key":"1435_CR2","unstructured":"Backes M, Hoffmann J, K\u00fcnnemann R, et al., 2017. Simulated penetration testing and mitigation analysis. https:\/\/arxiv.org\/abs\/1705.05088v1"},{"issue":"2","key":"1435_CR3","doi-asserted-by":"publisher","first-page":"109","DOI":"10.1016\/S1369-5266(99)80022-3","volume":"2","author":"DC Baulcombe","year":"1999","unstructured":"Baulcombe DC, 1999. Fast forward genetics based on virus-induced gene silencing. Curr Opin Plant Biol, 2(2):109\u2013113. https:\/\/doi.org\/10.1016\/S1369-5266(99)80022-3","journal-title":"Curr Opin Plant Biol"},{"key":"1435_CR4","volume-title":"Nessus Network Auditing: Jay Beale Open Source Security Series","author":"J Beale","year":"2004","unstructured":"Beale J, Meer H, van der Walt C, et al., 2004. Nessus Network Auditing: Jay Beale Open Source Security Series. Elsevier, Amsterdam, the Netherlands."},{"issue":"9","key":"1435_CR5","doi-asserted-by":"publisher","first-page":"916","DOI":"10.1111\/ecog.00888","volume":"37","author":"I Chad\u00e8s","year":"2014","unstructured":"Chad\u00e8s I, Chapron G, Cros MJ, et al., 2014. MDPtoolbox: a multi-platform toolbox to solve stochastic dynamic programming problems. Ecography, 37(9):916\u2013920. https:\/\/doi.org\/10.1111\/ecog.00888","journal-title":"Ecography"},{"key":"1435_CR6","unstructured":"Core Security, 2019. Core Impact Penetration System. https:\/\/www.secureauth.com\/products\/penetration-testing\/core-impact [Accessed on Feb. 23, 2019]."},{"key":"1435_CR7","doi-asserted-by":"publisher","first-page":"61","DOI":"10.1613\/jair.1129","volume":"20","author":"M. Fox","year":"2003","unstructured":"Fox M, Long D, 2003. PDDL2.1: an extension to PDDL for expressing temporal planning domains. J Artif Intell Res, 20:61\u2013124. https:\/\/doi.org\/10.1613\/jair.1129","journal-title":"Journal of Artificial Intelligence Research"},{"key":"1435_CR8","unstructured":"Futoransky A, Notarfrancesco L, Richarte G, et al., 2010. Building computer network attacks. https:\/\/arxiv.org\/abs\/1006.1916"},{"key":"1435_CR9","doi-asserted-by":"publisher","unstructured":"Holik F, Horalek J, Marik O, et al., 2014. Effective penetration testing with metasploit framework and methodologies. IEEE 15th Int Symp on Computational Intelligence and Informatics, p.237\u2013242. https:\/\/doi.org\/10.1109\/CINTI.2014.7028682","DOI":"10.1109\/CINTI.2014.7028682"},{"key":"1435_CR10","unstructured":"Khan S, Parkinson S, 2017. Towards automated vulnerability assessment. 27th Int Conf on Automated Planning and Scheduling, p.33\u201340."},{"key":"1435_CR11","unstructured":"Kingma DP, Ba J, 2014. Adam: a method for stochastic optimization. https:\/\/arxiv.org\/abs\/1412.6980"},{"key":"1435_CR12","volume-title":"Robotics: Science and Systems IV","author":"H Kurniawati","year":"2008","unstructured":"Kurniawati H, Hsu D, Lee WS, 2008. SARSOP: efficient point-based POMDP planning by approximating optimally reachable belief spaces. In: Brock O, Trinkle J, Ramos F (Eds.), Robotics: Science and Systems IV. MIT Press, Massachusetts, USA, Chapter 10."},{"issue":"1","key":"1435_CR13","doi-asserted-by":"publisher","first-page":"155","DOI":"10.1016\/j.ipm.2004.08.006","volume":"42","author":"C Lee","year":"2006","unstructured":"Lee C, Lee GG, 2006. Information gain and divergence-based feature selection for machine learning-based text categorization. Inform Process Manag, 42(1):155\u2013165. https:\/\/doi.org\/10.1016\/j.ipm.2004.08.006","journal-title":"Inform Process Manag"},{"issue":"1","key":"1435_CR14","doi-asserted-by":"publisher","first-page":"37","DOI":"10.1142\/S0218488504002631","volume":"12","author":"JY Liang","year":"2004","unstructured":"Liang JY, Shi ZZ, 2004. The information entropy, rough entropy and knowledge granulation in rough set theory. Int J Uncert Fuzzy Knowl Syst, 12(1):37\u201346. https:\/\/doi.org\/10.1142\/S0218488504002631","journal-title":"Int J Uncert Fuzzy Knowl Syst"},{"key":"1435_CR15","unstructured":"Mnih V, Kavukcuoglu K, Silver D, et al., 2013. Playing Atari with deep reinforcement learning. https:\/\/arxiv.org\/abs\/1312.5602"},{"issue":"7540","key":"1435_CR16","doi-asserted-by":"publisher","first-page":"529","DOI":"10.1038\/nature14236","volume":"518","author":"V Mnih","year":"2015","unstructured":"Mnih V, Kavukcuoglu K, Silver D, et al., 2015. Human-level control through deep reinforcement learning. Nature, 518(7540):529\u2013533. https:\/\/doi.org\/10.1038\/nature14236","journal-title":"Nature"},{"key":"1435_CR17","unstructured":"Obes JL, Sarraute C, Richarte G, 2013. Attack planning in the real world. https:\/\/arxiv.org\/abs\/1306.4044"},{"key":"1435_CR18","unstructured":"Roberts M, Howe A, Ray I, et al., 2011. Personalized vulnerability analysis through automated planning. Proc Int Joint Conf on Artificial Intelligence, p.50\u201357."},{"key":"1435_CR19","series-title":"MS Thesis","doi-asserted-by":"publisher","DOI":"10.31979\/etd.fxpj-pt6k","volume-title":"Automated Penetration Testing","author":"N Samant","year":"2011","unstructured":"Samant N, 2011. Automated Penetration Testing. MS Thesis, San Jose State University, California, USA."},{"key":"1435_CR20","doi-asserted-by":"publisher","unstructured":"Sarraute C, Richarte G, Luc\u00e1ngeli Obes J, 2011. An algorithm to find optimal attack paths in nondeterministic scenarios. 4th ACM Workshop on Security and Artificial Intelligence, p.71\u201380. https:\/\/doi.org\/10.1145\/2046684.2046695","DOI":"10.1145\/2046684.2046695"},{"key":"1435_CR21","doi-asserted-by":"crossref","unstructured":"Sarraute C, Buffet O, Hoffmann J, 2012. POMDPs make better hackers: accounting for uncertainty in penetration testing. 26th AAAI Conf on Artificial Intelligence, p.1816\u20131824.","DOI":"10.1609\/aaai.v26i1.8363"},{"key":"1435_CR22","unstructured":"Sarraute C, Buffet O, Hoffmann J, 2013. Penetration testing == POMDP solving? https:\/\/arxiv.org\/abs\/1306.4714"},{"issue":"12","key":"1435_CR23","first-page":"21","volume":"24","author":"B Schneier","year":"1999","unstructured":"Schneier B, 1999. Attack trees. Dr Dobb\u2019s J, 24(12):21\u201329.","journal-title":"Dr Dobb\u2019s J"},{"key":"1435_CR24","doi-asserted-by":"publisher","unstructured":"Sheyner O, Haines J, Jha S, et al., 2002. Automated generation and analysis of attack graphs. IEEE Symp on Security and Privacy, p.273\u2013284. https:\/\/doi.org\/10.1109\/SECPRI.2002.1004377","DOI":"10.1109\/SECPRI.2002.1004377"},{"key":"1435_CR25","unstructured":"Shmaryahu D, Shani G, Hoffmann J, et al., 2017. Partially observable contingent planning for penetration testing. 1st Int Workshop on Artificial Intelligence in Security, p.33\u201340."},{"issue":"2","key":"1435_CR26","doi-asserted-by":"publisher","first-page":"129","DOI":"10.30748\/soi.2017.148.25","volume":"148","author":"Y Stefinko","year":"2017","unstructured":"Stefinko Y, Piskuzub A, 2017. Theory of modern penetration testing expert system. Inform Process Syst, 148(2):129\u2013133. https:\/\/doi.org\/10.30748\/soi.2017.148.25","journal-title":"Inform Process Syst"},{"key":"1435_CR27","unstructured":"Steinmetz M, 2016. Critical constrained planning and an application to network penetration testing. 26th Int Conf on Automated Planning and Scheduling, p.141\u2013144."},{"key":"1435_CR28","volume-title":"Reinforcement Learning: an Introduction","author":"RS Sutton","year":"1998","unstructured":"Sutton RS, Barto AG, 1998. Reinforcement Learning: an Introduction. MIT Press, Cambridge, London."},{"key":"1435_CR29","doi-asserted-by":"publisher","DOI":"10.2200\/S00268ED1V01Y201005AIM009","volume-title":"Algorithms for Reinforcement Learning","author":"C Szepesv\u00e1ri","year":"2010","unstructured":"Szepesv\u00e1ri C, 2010. Algorithms for Reinforcement Learning. Morgan & Claypool Publishers, San Rafael, Argentina."},{"issue":"1","key":"1435_CR30","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1631\/FITEE.1601883","volume":"18","author":"YT Zhuang","year":"2017","unstructured":"Zhuang YT, Wu F, Chen C, et al., 2017. Challenges and opportunities: from big data to knowledge in AI 2.0. Front Inform Technol Electron Eng, 18(1):3\u201314. https:\/\/doi.org\/10.1631\/FITEE.1601883","journal-title":"Front Inform Technol Electron Eng"}],"container-title":["Frontiers of Information Technology & Electronic Engineering"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1631\/FITEE.1800532.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1631\/FITEE.1800532\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1631\/FITEE.1800532.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,10,2]],"date-time":"2022-10-02T02:46:57Z","timestamp":1664678817000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1631\/FITEE.1800532"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,9]]},"references-count":30,"journal-issue":{"issue":"9","published-print":{"date-parts":[[2019,9]]}},"alternative-id":["1435"],"URL":"https:\/\/doi.org\/10.1631\/fitee.1800532","relation":{},"ISSN":["2095-9184","2095-9230"],"issn-type":[{"value":"2095-9184","type":"print"},{"value":"2095-9230","type":"electronic"}],"subject":[],"published":{"date-parts":[[2019,9]]},"assertion":[{"value":"3 September 2018","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"1 February 2019","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"18 October 2019","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"Tian-yang ZHOU, Yi-chao ZANG, Jun-hu ZHU, and Qing-xian WANG declare that they have no conflict of interest.","order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Compliance with ethics guidelines"}}]}}