IP Library Granted Patent US 12,470,591
Granted Patent B2
US 12,470,591 · App. 18/318,265 · Granted Nov 11, 2025

Analytical attack graph abstraction for resource-efficiencies

Inventors: Nimrod Busany (Tel Aviv, IL); Dan Klein (Rosh Ha'ayin, IL); Rafi Shalom (Givatayim, IL)
Assignee: Accenture Global Solutions Limited
H04L63/1441H04L63/1416H04L63/1425H04L63/1433
View Patent ↗
Loading inventors, assignments & file history…
Monitor This Case
Get email alerts when status or documents change.
Order Certified Copies
Most orders are placed with the USPTO same day — all within 24 business hours.
Order via The Patent Place →
Pre-filled with this patent's details
Quick Facts
Patent No.
US 12,470,591
App. No.
18/318,265
Granted
Nov 11, 2025
Kind
B2
Abstract

Implementations include methods, systems, computer-readable storage medium for mitigating cyber security risk of an enterprise network. A method includes: receiving an initial analytic attack graph (AAG) that is representative of paths within the enterprise network with respect to at least one target asset, the initial AAG comprising nodes and edges between the nodes; identifying, from the nodes of the initial AAG, a plurality of node groups, each node group including two or more nodes having at least one common attribute; generating an abstract AAG from the initial AAG, the abstract AAG including at least one abstract node, wherein each node group of the initial AAG is represented by a respective abstract node of the abstract AAG; determining a set of remedial actions at least partially based on the abstract AAG; and executing remedial actions in the set of remedial actions to reduce a cyber security risk to the enterprise network.

Claims (41)

1 . A computer-implemented method for mitigating cyber security risk of an enterprise network, the computer-implemented method comprising:

receiving an initial analytic attack graph (AAG) that is representative of paths within the enterprise network with respect to at least one target asset, the initial AAG comprising nodes and edges between the nodes;

identifying, from the nodes of the initial AAG, a plurality of node groups, each node group including two or more nodes having at least one common attribute;

generating an abstract AAG from the initial AAG, the abstract AAG including at least one abstract node, wherein each node group of the initial AAG is represented by a respective abstract node of the abstract AAG;

storing, in a database, mapping data between an abstract node of the abstract AAG and the nodes of the respective node group of the initial AAG represented by the abstract node;

determining a set of remedial actions at least partially based on the abstract AAG, wherein determining the set of remedial actions at least partially based on the abstract AAG comprises processing the abstract AAG with a cyber defense algorithm to identify a set of rule nodes to be removed from the initial AAG; and

executing one or more remedial actions in the set of remedial actions to reduce a cyber security risk to the enterprise network.

2 . The method of claim 1 , wherein each node comprises one of a rule node, a fact node, or a derived fact node.

3 . The method of claim 1 , wherein attributes of nodes comprise labels, arguments, and types.

4 . The method of claim 3 , wherein the node groups of the initial AAG each include two or more nodes having a common label and type.

5 . The method of claim 4 , wherein each abstract node in the abstract AAG is associated with the common label and type of the respective node group of the initial AAG.

6 . The method of claim 1 , wherein processing the abstract AAG with the cyber defense algorithm to identify a set of rule nodes to be removed from the initial AAG comprises:

determining, using the cyber defense algorithm, at least one abstract rule node to be removed from the abstract AAG; and

identifying the set of rule nodes to be removed from the initial AAG by mapping the at least one abstract rule node of the abstract AAG to rule nodes of the initial AAG using stored the mapping data.

7 . The method of claim 1 , wherein the set of rule nodes comprises a locally minimal set of rules of which removal prevents all attacks to the at least one target asset.

8 . The method of claim 1 , wherein executing the one or more remedial actions in the set of remedial actions to reduce the cyber security risk to the enterprise network comprises removing rule nodes of the identified set of rule nodes from the initial AAG.

9 . The method of claim 1 , wherein the abstract AAG includes at least one abstract edge between two abstract nodes.

10 . The method of claim 9 , comprising storing, in a database, mapping data between an abstract edge of the abstract AAG and respective nodes of the initial AAG represented by the abstract nodes connected by the abstract edge.

11 . The method of claim 1 , wherein identifying the plurality of node groups in the initial AAG, each node group including two or more nodes having a common attribute comprises:

searching the initial AAG for bisimular nodes, wherein each node group comprises two or more bisimular nodes.

12 . The method of claim 11 , wherein bisimular nodes have a common label and type.

13 . A non-transitory computer-readable storage medium coupled to one or more processors and having instructions stored thereon which, when executed by the one or more processors, cause the one or more processors to perform operations for mitigating cyber security risk of an enterprise network, the operations comprising:

receiving an initial analytic attack graph (AAG) that is representative of paths within the enterprise network with respect to at least one target asset, the initial AAG comprising nodes and edges between the nodes;

identifying, from the nodes of the initial AAG, a plurality of node groups, each node group including two or more nodes having at least one common attribute;

generating an abstract AAG from the initial AAG, the abstract AAG including at least one abstract node, wherein each node group of the initial AAG is represented by a respective abstract node of the abstract AAG;

storing, in a database, mapping data between an abstract node of the abstract AAG and the nodes of the respective node group of the initial AAG represented by the abstract node;

determining a set of remedial actions at least partially based on the abstract AAG, wherein determining the set of remedial actions at least partially based on the abstract AAG comprises processing the abstract AAG with a cyber defense algorithm to identify a set of rule nodes to be removed from the initial AAG; and

executing one or more remedial actions in the set of remedial actions to reduce a cyber security risk to the enterprise network.

14 . The non-transitory computer-readable storage medium of claim 13 , wherein each node comprises one of a rule node, a fact node, or a derived fact node.

15 . The non-transitory computer-readable storage medium of claim 13 , wherein attributes of nodes comprise labels, arguments, and types.

16 . The non-transitory computer-readable storage medium of claim 15 , wherein the node groups of the initial AAG each include two or more nodes having a common label and type.

17 . The non-transitory computer-readable storage medium of claim 16 , wherein each abstract node in the abstract AAG is associated with the common label and type of the respective node group of the initial AAG.

18 . A system, comprising:

a computing device; and

a computer-readable storage device coupled to the computing device and having instructions stored thereon which, when executed by the computing device, cause the computing device to perform operations for mitigating cyber security risk of an enterprise network, the operations comprising:

receiving an initial analytic attack graph (AAG) that is representative of paths within the enterprise network with respect to at least one target asset, the initial AAG comprising nodes and edges between the nodes;

identifying, from the nodes of the initial AAG, a plurality of node groups, each node group including two or more nodes having at least one common attribute;

generating an abstract AAG from the initial AAG, the abstract AAG including at least one abstract node, wherein each node group of the initial AAG is represented by a respective abstract node of the abstract AAG;

storing, in a database, mapping data between an abstract node of the abstract AAG and the nodes of the respective node group of the initial AAG represented by the abstract node;

determining a set of remedial actions at least partially based on the abstract AAG, wherein determining the set of remedial actions at least partially based on the abstract AAG comprises processing the abstract AAG with a cyber defense algorithm to identify a set of rule nodes to be removed from the initial AAG; and

executing one or more remedial actions in the set of remedial actions to reduce a cyber security risk to the enterprise network.

Assignments (1)
ASSIGNMENT OF ASSIGNOR'S INTEREST Recorded May 17, 2023
From: BUSANY, NIMROD; KLEIN, DAN; SHALOM, RAFI
To: ACCENTURE GLOBAL SOLUTIONS LIMITED
Reel/Frame 063676/0455 →
Continuity (2)
Provisional Application 63343136 · May 18, 2022
Related Publication 20230379356A1 · Nov 23, 2023
References Cited (350)
US 5521910A · Matthews · 1996 [cited by applicant]
US 6279113B1 · Vaidya · 2001 [cited by applicant]
US 6487666B1 · Shanklin et al. · 2002 [cited by applicant]
US 7540025B2 · Tzadikario · 2009 [cited by applicant]
US 7703138B2 · Desai et al. · 2010 [cited by applicant]
US 7904962B1 · Jajodia et al. · 2011 [cited by applicant]
US 8099760B2 · Cohen et al. · 2012 [cited by applicant]
US 8176561B1 · Hurst et al. · 2012 [cited by applicant]
US 8656493B2 · Capalik · 2014 [cited by applicant]
US 8881288B1 · Levy et al. · 2014 [cited by applicant]
US 9256739B1 · Roundy et al. · 2016 [cited by applicant]
US 9563771B2 · Lang et al. · 2017 [cited by applicant]
US 9633306B2 · Liu et al. · 2017 [cited by applicant]
US 10084804B2 · Kapadia et al. · 2018 [cited by applicant]
US 10291645B1 · Frantzen et al. · 2019 [cited by applicant]
US 10382473B1 · Ashkenazy et al. · 2019 [cited by applicant]
US 10447721B2 · Lasser · 2019 [cited by applicant]
US 10447727B1 · Hecht · 2019 [cited by applicant]
US 10601854B2 · Lokamathe et al. · 2020 [cited by applicant]
US 10642840B1 · Attaluri et al. · 2020 [cited by applicant]
US 10659488B1 · Rajasooriya et al. · 2020 [cited by applicant]
US 10771492B2 · Hudis et al. · 2020 [cited by applicant]
US 10848515B1 · Pokhrel et al. · 2020 [cited by applicant]
US 10868825B1 · Dominessy et al. · 2020 [cited by applicant]
US 10873533B1 · Ismailsheriff et al. · 2020 [cited by applicant]
US 10956566B2 · Shu et al. · 2021 [cited by applicant]
US 10958667B1 · Maida et al. · 2021 [cited by applicant]
US 11089040B2 · Jang et al. · 2021 [cited by applicant]
US 11128654B1 · Joyce et al. · 2021 [cited by applicant]
US 11159555B2 · Hadar et al. · 2021 [cited by applicant]
US 11184385B2 · Hadar et al. · 2021 [cited by applicant]
US 11232235B2 · Hadar et al. · 2022 [cited by applicant]
US 11277431B2 · Hassanzadeh et al. · 2022 [cited by applicant]
US 11281806B2 · Hadar et al. · 2022 [cited by applicant]
US 11283824B1 · Berger et al. · 2022 [cited by applicant]
US 11283825B2 · Grabois et al. · 2022 [cited by applicant]
US 11411976B2 · Basovskiy et al. · 2022 [cited by applicant]
US 11483213B2 · Engelberg et al. · 2022 [cited by applicant]
US 11533332B2 · Engelberg et al. · 2022 [cited by applicant]
US 11750657B2 · Hadar et al. · 2023 [cited by applicant]
US 20050138413A1 · Lippmann et al. · 2005 [cited by applicant]
US 20050193430A1 · Cohen et al. · 2005 [cited by applicant]
US 20060037077A1 · Gadde et al. · 2006 [cited by applicant]
US 20080044018A1 · Scrimsher et al. · 2008 [cited by applicant]
US 20080289039A1 · Rits et al. · 2008 [cited by applicant]
US 20080301765A1 · Nicol et al. · 2008 [cited by applicant]
US 20090077666A1 · Chen et al. · 2009 [cited by applicant]
US 20090138590A1 · Lee et al. · 2009 [cited by applicant]
US 20090307772A1 · Markham et al. · 2009 [cited by applicant]
US 20090319248A1 · White et al. · 2009 [cited by applicant]
US 20100058456A1 · Jajodia et al. · 2010 [cited by applicant]
US 20100138925A1 · Barai et al. · 2010 [cited by applicant]
US 20100174670A1 · Malik et al. · 2010 [cited by applicant]
US 20110035803A1 · Lucangeli Obes et al. · 2011 [cited by applicant]
US 20110061104A1 · Sarraute Yamada et al. · 2011 [cited by applicant]
US 20110093916A1 · Lang et al. · 2011 [cited by applicant]
US 20110093956A1 · Laarakkers et al. · 2011 [cited by applicant]
US 20130097125A1 · Marvasti et al. · 2013 [cited by applicant]
US 20130219503A1 · Amnon et al. · 2013 [cited by applicant]
US 20140082738A1 · Bahl · 2014 [cited by applicant]
US 20140173740A1 · Albanese et al. · 2014 [cited by applicant]
US 20150047026A1 · Neil et al. · 2015 [cited by applicant]
US 20150106867A1 · Liang · 2015 [cited by applicant]
US 20150172309A1 · Zandani et al. · 2015 [cited by applicant]
US 20150199207A1 · Lin et al. · 2015 [cited by applicant]
US 20150261958A1 · Hale et al. · 2015 [cited by applicant]
US 20150326601A1 · Grondin et al. · 2015 [cited by applicant]
US 20150350018A1 · Hui et al. · 2015 [cited by applicant]
US 20160105454A1 · Li et al. · 2016 [cited by applicant]
US 20160205122A1 · Bassett · 2016 [cited by applicant]
US 20160277423A1 · Apostolescu et al. · 2016 [cited by applicant]
US 20160292599A1 · Andrews et al. · 2016 [cited by applicant]
US 20160301704A1 · Hassanzadeh et al. · 2016 [cited by applicant]
US 20160301709A1 · Hassanzadeh et al. · 2016 [cited by applicant]
US 20170012836A1 · Tongaonkar et al. · 2017 [cited by applicant]
US 20170032130A1 · Joseph et al. · 2017 [cited by applicant]
US 20170041334A1 · Kahn et al. · 2017 [cited by applicant]
US 20170078322A1 · Seiver et al. · 2017 [cited by applicant]
US 20170085595A1 · Ng et al. · 2017 [cited by applicant]
US 20170163506A1 · Keller · 2017 [cited by applicant]
US 20170230410A1 · Hassanzadeh et al. · 2017 [cited by applicant]
US 20170318050A1 · Hassanzadeh et al. · 2017 [cited by applicant]
US 20170324768A1 · Crabtree et al. · 2017 [cited by applicant]
US 20170364702A1 · Goldfarb et al. · 2017 [cited by applicant]
US 20170366416A1 · Beecham et al. · 2017 [cited by applicant]
US 20180013771A1 · Crabtree et al. · 2018 [cited by applicant]
US 20180103052A1 · Choudhury et al. · 2018 [cited by applicant]
US 20180152468A1 · Nor et al. · 2018 [cited by applicant]
US 20180159890A1 · Warnick et al. · 2018 [cited by applicant]
US 20180183827A1 · Zorlular et al. · 2018 [cited by applicant]
US 20180255077A1 · Paine · 2018 [cited by applicant]
US 20180255080A1 · Paine · 2018 [cited by applicant]
US 20180295154A1 · Crabtree et al. · 2018 [cited by applicant]
US 20180367548A1 · Stokes, III et al. · 2018 [cited by applicant]
US 20190052663A1 · Lee et al. · 2019 [cited by applicant]
US 20190052664A1 · Kibler et al. · 2019 [cited by applicant]
US 20190087737A1 · Pendar et al. · 2019 [cited by applicant]
US 20190132344A1 · Lem et al. · 2019 [cited by applicant]
US 20190141058A1 · Hassanzadeh et al. · 2019 [cited by applicant]
US 20190182119A1 · Ratkovic et al. · 2019 [cited by applicant]
US 20190188389A1 · Peled et al. · 2019 [cited by applicant]
US 20190230129A1 · Digiambattista et al. · 2019 [cited by applicant]
US 20190312898A1 · Verma et al. · 2019 [cited by applicant]
US 20190319987A1 · Levy et al. · 2019 [cited by applicant]
US 20190362279A1 · Douglas · 2019 [cited by applicant]
US 20190373005A1 · Bassett · 2019 [cited by applicant]
US 20200014718A1 · Joseph Durairaj et al. · 2020 [cited by applicant]
US 20200042328A1 · Gupta · 2020 [cited by applicant]
US 20200042712A1 · Foo et al. · 2020 [cited by applicant]
US 20200045069A1 · Nanda et al. · 2020 [cited by applicant]
US 20200099704A1 · Lee et al. · 2020 [cited by applicant]
US 20200099708A1 · Mathews · 2020 [cited by examiner]
US 20200112487A1 · Inamdar et al. · 2020 [cited by applicant]
US 20200128047A1 · Biswas et al. · 2020 [cited by applicant]
US 20200137104A1 · Hassanzadeh et al. · 2020 [cited by applicant]
US 20200175175A1 · Hadar et al. · 2020 [cited by applicant]
US 20200177615A1 · Grabois et al. · 2020 [cited by applicant]
US 20200177616A1 · Hadar et al. · 2020 [cited by applicant]
US 20200177617A1 · Hadar et al. · 2020 [cited by applicant]
US 20200177618A1 · Hassanzadeh et al. · 2020 [cited by applicant]
US 20200177619A1 · Hadar et al. · 2020 [cited by applicant]
US 20200272972A1 · Harry et al. · 2020 [cited by applicant]
US 20200296137A1 · Crabtree et al. · 2020 [cited by applicant]
US 20200311630A1 · Risoldi et al. · 2020 [cited by applicant]
US 20200351295A1 · Nhlabatsi et al. · 2020 [cited by applicant]
US 20200358804A1 · Crabtree et al. · 2020 [cited by applicant]
US 20210006582A1 · Yamada et al. · 2021 [cited by applicant]
US 20210014265A1 · Hadar et al. · 2021 [cited by applicant]
US 20210099490A1 · Crabtree et al. · 2021 [cited by applicant]
US 20210105294A1 · Kruse et al. · 2021 [cited by applicant]
US 20210168175A1 · Crabtree et al. · 2021 [cited by applicant]
US 20210173711A1 · Crabtree et al. · 2021 [cited by applicant]
US 20210218770A1 · Ben-Yosef et al. · 2021 [cited by applicant]
US 20210248443A1 · Shu et al. · 2021 [cited by applicant]
US 20210273978A1 · Hadar et al. · 2021 [cited by applicant]
US 20210288995A1 · Attar et al. · 2021 [cited by applicant]
US 20210336981A1 · Akella et al. · 2021 [cited by applicant]
US 20210350248A1 · Rogers · 2021 [cited by examiner]
US 20210409426A1 · Engelberg et al. · 2021 [cited by applicant]
US 20210409439A1 · Engelberg et al. · 2021 [cited by applicant]
US 20220014445A1 · Engelberg et al. · 2022 [cited by applicant]
US 20220014534A1 · Basovskiy et al. · 2022 [cited by applicant]
US 20220021698A1 · Hadar et al. · 2022 [cited by applicant]
US 20220038491A1 · Hadar et al. · 2022 [cited by applicant]
US 20220051111A1 · Hadar et al. · 2022 [cited by applicant]
US 20220070202A1 · Busany et al. · 2022 [cited by applicant]
US 20220124069A1 · Chiu · 2022 [cited by examiner]
US 20220124115A1 · Grabois et al. · 2022 [cited by applicant]
US 20220129590A1 · Hadar et al. · 2022 [cited by applicant]
US 20220131894A1 · Hassanzadeh et al. · 2022 [cited by applicant]
US 20220150270A1 · Klein et al. · 2022 [cited by applicant]
US 20220182406A1 · Inokuchi · 2022 [cited by applicant]
US 20220188460A1 · Hadar et al. · 2022 [cited by applicant]
US 20220263855A1 · Engelberg et al. · 2022 [cited by applicant]
US 20220337617A1 · Basovskiy et al. · 2022 [cited by applicant]
US 20230021961A1 · Engelberg et al. · 2023 [cited by applicant]
US 20230034910A1 · Engelberg et al. · 2023 [cited by applicant]
US 20230067128A1 · Engelberg et al. · 2023 [cited by applicant]
US 20230067777A1 · Hadar et al. · 2023 [cited by applicant]
US 20230076372A1 · Engelberg et al. · 2023 [cited by applicant]
EP 1559008 · 2005 [cited by applicant]
EP 1768043 · 2007 [cited by applicant]
EP 2385676 · 2011 [cited by applicant]
EP 2816773 · 2014 [cited by applicant]
EP 3644579 · 2020 [cited by applicant]
EP 3664411 · 2020 [cited by applicant]
WO WO2018002484 · 2018 [cited by applicant]
WO WO2020242275 · 2020 [cited by applicant]
3DS.com [online], “New Customer Experience,” available on or before Aug. 7, 2020 via Internet Archive: Wayback Machine URL<https://web.archive.org/web/20200807204455/https://ifwe.3ds.com/transportation-mobility/new-cust… [cited by applicant]
Abraham et al. “A Predictive Framework for Cyber Security Analytics Using Attack Graphs.” International Journal of Computer Networks & Communications (IJCNC). vol. 7, No. 1, Jan. 2015. (Year: 2015). [cited by applicant]
Abraham et al., “Cyber Security Analytics: A Stochastic Model for Security Quantification Using Absorbing Markov Chains,” Journal of Communications, Dec. 2014, 9(12):899-907. [cited by applicant]
Abriola et al., “Bisimulations on Data Graphs,” Journal of Artificial Intelligence Research, Jan. 2018, 61:171-213. [cited by applicant]
Almeida et al., “An ontological analysis of the notion of community in the RM-ODP enterprise language,” Computer Standards & Interfaces, Mar. 2013, 35(3):257-268. [cited by applicant]
Alvarenga et al., “Discovering Attack Strategies Using Process Mining,” Presented at Proceedings of The Eleventh Advanced International Conference on Telecommunications, Brussels, Belgium, Jun. 21-26, 2015, 119-125. [cited by applicant]
Amar et al., “Using finite-state models for log differencing,” Proceedings of the 2018 26th ACM Joint Meeting on European Software Engineering Conference and Symposium on the Foundations of Software Engineering (ESEC/FS… [cited by applicant]
Annane et al., “BBO: BPMN 2.0 based ontology for business process representation,” Presented at Proceedings of the 20th European Conference on Knowledge Management (ECKM 2019), Lisbonne, Portugal, Sep. 5-6, 2019, 49-59. [cited by applicant]
Ashton et al., “That ‘internet of things’ thing,” RFID Journal, Jun. 22, 2009, 1 page. [cited by applicant]
Atoum et al., “A holistic cyber security implementation framework,” Information Management & Computer Security, Jul. 2014, 22(3):251-264. [cited by applicant]
Barik et al., “Attack Graph Generation and Analysis Techniques,” Defence Science Journal, Nov. 2016, 66(6):559-567. [cited by applicant]
Barrère et al., “Naggen: a Network Attack Graph GENeration Tool—IEE CNS 17 Poster,” 2017 IEEE Conference on Communications and Network Security, Oct. 2017, Las Vegas, NV, USA, 378-379. [cited by applicant]
Bonacich, “Power and Centrality: A Family of Measures,” American Journal of Sociology, Mar. 1987, 92(5):1170-1182. [cited by applicant]
Borgatti et al., “A Graph-theoretic perspective on centrality,” Social Networks, Oct. 2006, 28(4):466-484. [cited by applicant]
Borgo et al., “Ontological Foundations of DOLCE,” Theory and Applications of Ontology: Computer Applications, Aug. 5, 2010, 279-295. [cited by applicant]
Brazhuk, “Towards automation of threat modeling based on a semantic model of attack patterns and weaknesses,” arXiv, Dec. 8, 2021, arXiv:2112.04231v1, 14 pages. [cited by applicant]
Burger et al., “Scaling to the end of silicon with edge architectures,” Computer, Jul. 2004, 37(7):44-55. [cited by applicant]
Challenge.org [online], “Incorporating digital twin into internet cyber security—creating a safer future,” May 2018, retrieved on Jul. 9, 2021, retrieved from URL<https://www.challenge.org/insights/digital-twin-cyber-se… [cited by applicant]
Chen et al., “Distributed Attack Modeling Approach Based on Process Mining and Graph Segmentation,” Entropy, Sep. 2020, 22(9):1026, 21 pages. [cited by applicant]
Chen Zhong, Towards Agile Cyber Analysis: Leveraging Visualization as Functions in Collaborative Visual Analytics, IEEE:2017, pp. 1-2. [cited by applicant]
Cohen-Addad et al., “Hierarchical Clustering: Objective Functions and Algorithms,” Journal of the ACM, Jun. 2019, 66(4):26, 42 pages. [cited by applicant]
Coltellese et al., “Triage of IoT Attacks Through Process Mining,” Presented at Proceedings of On the Move to Meaningful Internet Systems Conference 2019, Rhodes, Greece, Oct. 21-25, 2019; Lecture Notes in Computer Scie… [cited by applicant]
Cravero, “Big data architectures and the internet of things: A systematic mapping study,” IEEE Latin America Transactions, Apr. 2018, 16(4):1219-1226. [cited by applicant]
CyberSecurityWorks.com [online], “MITRE Mapping of CISA KEVs and its Challenges,” Jun. 29, 2022, retrieved on Oct. 4, 2022, retrieved from URL<https://cybersecurityworks.com/blog/cisa/mitre-mapping-of-cisa-kevs-and-its-… [cited by applicant]
Cycognito.com [online], “Identifying and Managing Vulnerabilities on All Your Attacker-Exposed Assets, All the Time: Benefits of the CyCognito Platform for Vulnerability Management,” available on or before Oct. 22, 2020… [cited by applicant]
Daniele et al., “An ontological approach to logistics,” Enterprise Interoperability: Research and Applications in the Service-oriented Ecosystem, Oct. 11, 2013, 199-213. [cited by applicant]
Das et al., “V2W-BERT: A Framework for Effective Hierarchical Multiclass Classification of Software Vulnerabilities,” CoRR, submitted on Feb. 23, 2021, arXiv:2102.11498v1, 11 pages. [cited by applicant]
Degen et al., “Gol: toward an axiomatized upper-level ontology,” Presented at Proceedings of the International Conference on Formal Ontology in Information Systems, Ogunquit, Maine, USA, Oct. 17-19, 2001, 34-46. [cited by applicant]
Dovier et al., “An Efficient Algorithm for Computing Bisimulation Equivalence,” Theoretical Computer Science, Jan. 23, 2004, 311(1-3):221-256. [cited by applicant]
Dovier, “Logic Programming and Bisimulation,” Proceedings of the Technical Communications of the 31st International Conference on Logic Programming (ICLP 2015), Cork, Ireland, Aug. 31-Sep. 4, 2015, 14 pages. [cited by applicant]
Duarte et al., “Towards an Ontology of Requirements at Runtime,” Formal Ontology in Information Systems, Jan. 2016, 283:255-268. [cited by applicant]
El Saddik, “Digital Twins: The Convergence of Multimedia Technologies,” IEEE MultiMedia, Apr.-Jun. 2018, 25(2):87-92. [cited by applicant]
EP Extended Search Report in European Appln. No. 21191752.1, dated Jan. 4, 2022, 8 pages. [cited by applicant]
EP Extended Search Report in European Appln. No. 22157487.4, dated Jun. 9, 2022, 10 pages. [cited by applicant]
EP Extended Search Report in European Appln. No. 22187514.9, dated Nov. 29, 2022, 7 pages. [cited by applicant]
EP Extended Search Report in European Appln. No. 22193272.6, dated Jan. 25, 2023, 8 pages. [cited by applicant]
EP Search Report in European Application No. EP 19212981, dated Mar. 4, 2020, 6 pages. [cited by applicant]
EP Search Report in European Application No. EP19212974, dated Feb. 14, 2020, 8 pages. [cited by applicant]
EP Search Report in European Application No. EP19212976, dated Feb. 14, 2020, 8 pages. [cited by applicant]
EP Search Report in European Application. No. 21159421.3, dated Jun. 30, 2021, 11 pages. [cited by applicant]
EP Search Report in European Application. No. EP20185251, dated Oct. 21, 2020, 7 pages. [cited by applicant]
Fielder et al., “Decision support approaches for cyber security investment,” Decision Support Systems, Jun. 2016, 86:13-23. [cited by applicant]
Foundations of Databases, 1st ed., Abiteboul et al. (eds.), 1995, Chapter 12, 38 pages. [cited by applicant]
Fundamentals of Business Process Management, 2nd ed., Dumas et al. (eds.), 2018, 546 pages. [cited by applicant]
Gailly et al., “Ontological Reengineering of the REA-EO using UFO,” Presented at Proceedings of the International Workshop on Ontology-Driven Software Engineering, Orlando, FL, USA, Oct. 2009, 15 pages. [cited by applicant]
Gandomi et al., “Beyond the hype: Big data concepts, methods, and analytics,” International Journal of Information Management, Apr. 2015, 35(2):137-144. [cited by applicant]
GE.com [online], “Predix Platform,” available on or before Nov. 16, 2018 via Internet Archive: Wayback Machine URL<https://web.archive.org/web/20181116005032/https://www.ge.com/digital/iiot-platform>, retrieved on Jul. … [cited by applicant]
Genovese, “Data mesh: the newest paradigm shift for a distributed architecture in the data world and its application,” Thesis for the degree of Computer Engineering, Politecnico di Torino, 2021, 76 pages. [cited by applicant]
Gergeleit et al., “Modeling Security Requirements and Controls for an Automated Deployment of Industrial IT Systems,” Kommunikation und Bildverarbeitung in der Automation. Technologien für die intelligente Automation (T… [cited by applicant]
GitHub.com [online], “ALFA-group/BRON,” available on or before Nov. 23, 2021 via Internet Archive: Wayback Machine URL<https://web.archive.org/web/20211123023700/https://github.com/ALFA- group/BRON>, retrieved on Oct. 4… [cited by applicant]
Giunchiglia et al., “Lightweight Ontologies,” Technical Report DIT-07-071, University of Trento, Oct. 2007, 10 pages. [cited by applicant]
Gomez-Perez et al., “Ontology languages for the Semantic Web,” IEEE Intelligent Systems, Feb. 2002, 17(1):54-60. [cited by applicant]
Grieves, “Virtually Intelligent Product Systems: Digital and Physical Twins”, Complex Systems Engineering: Theory and Practice, Jul. 2019, 256:175-200. [cited by applicant]
Grigorescu et al., “CVE2ATT&CK: BERT-Based Mapping of CVEs to MITRE ATT&CK Techniques,” Algorithms, Aug. 31, 2022, 15(9):314, 22 pages. [cited by applicant]
Guarino, “Formal Ontology in Information Systems,” Presented at Proceedings of the 1st International Conference, Trento, Italy, Jun. 6-8, 1998, 3-15. [cited by applicant]
Guizzardi et al., “An Ontology-Based Approach for Evaluating the Domain Appropriateness and Comprehensibility Appropriateness of Modeling Languages,” MoDELS, 2005, 691-705. [cited by applicant]
Guizzardi, “On Ontology, ontologies, Conceptualizations, Modeling Languages, and (Meta)Models,” Presented at Proceedings of the 2007 conference on Databases and Information Systems IV: Selected Papers from the Seventh I… [cited by applicant]
Guizzardi, “Ontological Foundations for Structural Conceptual Models,” Thesis for the degree of Doctor, University of Twente, 2005, 441 pages. [cited by applicant]
Guizzardi, “Ontology, Ontologies and the “I” of FAIR,” Data Intelligence, Jan. 1, 2020, 2(1-2):181-191. [cited by applicant]
Guizzardi, “The role of foundational ontology for conceptual modeling and domain ontology representation,” Presented at Proceedings of the 7th International Baltic Conference on Databases and Information Systems, Vilniu… [cited by applicant]
Hadar et al., “Big Data Analytics on Cyber Attack Graphs for Prioritizing Agile Security Requirements”, Proceedings of the 2019 IEEE 27th International Requirements Engineering Conference, Sep. 23-27, 2019, Jeju Island,… [cited by applicant]
Hadar et al., “Cyber Digital Twin Simulator for Automatic Gathering and Prioritization of Security Controls Requirements,” Proceedings of the 2020 IEEE 28th International Requirements Engineering Conference, Aug. 31-Sep… [cited by applicant]
Hansen et al., “Model-in-the-Loop and Software-in-the-Loop Testing of Closed-Loop Automotive Software with Arttest,” Informatik, 2017, 13 pages. [cited by applicant]
Hasan et al., “Towards Optimal Cyber Defense Remediation in Energy Delivery Systems”, Proceedings of 2019 IEEE Global Communications Conference, Dec. 9-13, 2019, Waikoloa, Hawaii, 7 pages. [cited by applicant]
Hassani et al., “Artificial Intelligence (AI) or Intelligence Augmentation (IA): What Is the Future?,” AI, Apr. 12, 2020, 1(2):143-155. [cited by applicant]
Hemberg et al., “BRON—Linking Attack Tactics, Techniques, and Patterns with Defensive Weaknesses, Vulnerabilities and Affected Platform Configurations,” arXiv, Oct. 1, 2020, arXiv:2010.00533v1, 14 pages. [cited by applicant]
Hemberg et al., “Using a Collated Cybersecurity Dataset for Machine Learning and Artificial Intelligence,” arXiv, Aug. 5, 2021, arXiv:2108.02618v1, 5 pages. [cited by applicant]
Herre, “General Formal Ontology (GFO): A Foundational Ontology for Conceptual Modelling,” Theory and Applications of Ontology: Computer Applications, Aug. 12, 2010, 297-345. [cited by applicant]
Hofner et al., “Dijkstra, Floyd and Warshall meet Kleene,” Formal Aspects of Computing, Jul. 2012, 24(4-6):459-476. [cited by applicant]
Homer et al., “Improving Attack Graph Visualization through Data Reduction and Attack Grouping,” Proceedings of the VizSEC 2008 Workshop on Visualization for Computer Security, Cambridge, MA, USA, Sep. 15, 2008, 17 page… [cited by applicant]
Horrocks et al., “SWRL: A Semantic Web Rule Language Combining OWL and RuleML,” W3C Member Submission, May 21, 2004, 24 pages. [cited by applicant]
Husák et al., “Survey of Attack Projection, Prediction, and Forecasting in Cyber Security,” IEEE Communications Surveys & Tutorials, Sep. 24, 2018, 21(1):640-660. [cited by applicant]
Idika et al., “Extending attack graph-based security metrics and aggregating their application,” IEEE Transactions on Dependable and Secure Computing, Jan./Feb. 2012, 9(1):75-85. [cited by applicant]
IEEE, “IEEE Standard for extensible Event Stream (XES) for Achieving Interoperability in Event Logs and Event Stream,” IEEE Std 1849™-2016, Sep. 22, 2016, 50 pages. [cited by applicant]
IEEE.org [online], “This Car Runs on Code,” Feb. 1, 2009, retrieved on Jul. 9, 2021, retrieved from URL<https://spectrum.ieee.org/transportation/systems/this-car-runs-on-code>, 5 pages. [cited by applicant]
Ingols et al., “Practical Attack Graph Generation for Network Defense,” 2006 22nd Annual Computer Security Applications Conference (ACSAC'06), Miami Beach, Florida, Dec. 11-15, 2006, 10 pages. [cited by applicant]
International Organization for Standardization, “International Standard: ISO/IEC 27001,” ISO/IEC 27001:2013(E), Oct. 1, 2013, 29 pages. [cited by applicant]
Jacobsen et al., “FAIR Principles: Interpretations and Implementation Considerations,” Data Intelligence, Jan. 1, 2020, 2(1-2):10-29. [cited by applicant]
Joint Task Force Transformation Initiative, “Security and Privacy Controls for Federal Information Systems and Organizations,” National Institute of Standards and Technology Special Publication 800-53, Revision 4, Jan. … [cited by applicant]
Kaloroumakis et al., “Toward a Knowledge Graph of Cybersecurity Countermeasures,” Technical Report, The MITRE Corporation, 2021, 11 pages. [cited by applicant]
Khouzani et al., “Scalable min-max multi-objective cyber-security optimization over probabilistic attack graphs”, European Journal of Operational Research, Nov. 1, 2019, 278(3):894-903. [cited by applicant]
Li et al., “Cluster security research involving the modeling of network exploitations using exploitation graphs,” Proceedings of the IEEE International Symposium on Cluster Computing and the Grid, Singapore, May 16-19, … [cited by applicant]
Lippmann et al., “Validating and restoring defense in depth using attack graphs,” Proceedings of the Military Communications Conference, Washington, DC, USA, Oct. 23-25, 2006, 10 pages. [cited by applicant]
Lu et al., “Ranking attack graphs with graph neural networks,” Proceedings of the 5th International Conference on Information Security Practice and Experience, Xi'an, China, Apr. 13-15, 2009; Lecture Notes in Computer S… [cited by applicant]
Machado et al., “Data Mesh: Concepts and Principles of a Paradigm Shift in Data Architectures,” Procedia Computer Science, 2022, 196:263-271. [cited by applicant]
Machado et al., “Data-Driven Information Systems: The Data Mesh Paradigm Shift,” Presented at Proceedings of the 29th International Conference on Information Systems Development, Valencia, Spain, Sep. 8-10, 2021, 6 page… [cited by applicant]
Makridakis, “The forthcoming artificial intelligence (ai) revolution: Its impact on society and firms,” Futures, Jun. 2017, 90:46-60. [cited by applicant]
Manning Free Content Center [online], “Building Your Vocabulary,” dated May 19, 2017, retrieved on Jun. 3, 2020, retrieved from URL <https://freecontent.manning.com/building-your-vocabulary/>, 10 pages. [cited by applicant]
Martins et al., “A framework for conceptual characterization of ontologies and its application in the cybersecurity domain,” Software and Systems Modeling, Jul. 2, 2022, 21:1437-1464. [cited by applicant]
Martins et al., “Conceptual Characterization of Cybersecurity Ontologies,” The Practice of Enterprise Modelling, Nov. 18, 2020, 323-338. [cited by applicant]
MaschinenMarkt.international [online], “Digital twin in the automobile industry,” Aug. 1, 2019, retrieved on Jul. 9, 2021, retrieved from URL<https://www.maschinenmarkt.international/digital-twin-in-the-automobile-indus… [cited by applicant]
Mashable.com [online], “Ford ready to innovate, but not at the expense of customer needs,” May 31, 2016, retrieved on Jul. 9, 2021, retrieved from URL<https://mashable.com/article/mark-fields-ford-codecon>, 7 pages. [cited by applicant]
Mathis, “Data lakes,” Datenbank-Spektrum, Oct. 6, 2017, 17(3):289-293. [cited by applicant]
Mehta et al., “Ranking attack graphs,” Proceedings of the International Conference on Recent Advances in Intrusion Detection, Hamburg, Germany, Sep. 20-22, 2006; Lecture Notes in Computer Science, Sep. 2006, 4219:127-14… [cited by applicant]
Mitre.org [online], “CAPEC: Common Attack Pattern Enumerations and Classifications,” available on or before Jul. 21, 2007 via Internet Archive: Wayback Machine URL<https://web.archive.org/web/20070721234158/https://cape… [cited by applicant]
Mitre.org [online], “CWE: Common Weakness Enumeration,” available on or before Oct. 9, 2006 via Internet Archive: Wayback Machine URL<https://web.archive.org/web/20061009060144/https://cwe.mitre.org/>, retrieved on Oct.… [cited by applicant]
MITRE.org [online], “D3FEND,” available on or before Jun. 22, 2021 via Internet Archive: Wayback Machine URL<https://web.archive.org/web/20210622142005/https://d3fend.mitre.org/>, retrieved on Jul. 13, 2022, retrieved f… [cited by applicant]
MITRE.org [online], “Digital Artifact Ontology,” available on or before Jun. 25, 2021 via Internet Archive: Wayback Machine URL<https://web.archive.org/web/20210625024718/https://d3fend.mitre.org/dao>, retrieved on Jul.… [cited by applicant]
MITRE.org [online], “Service Application,” available on or before Jun. 25, 2021 via Internet Archive: Wayback Machine URL<https://web.archive.org/web/20210625024952/https://d3fend.mitre.org/dao/artifact/d3f:ServiceAppli… [cited by applicant]
Monino, “Data Value, Big Data Analytics, and Decision-Making,” Journal of the Knowledge Economy, Aug. 20, 2016, 256-267. [cited by applicant]
Murata, “Petri Nets: Properties, Analysis and Applications,” Proceedings of the IEEE, Apr. 1989, 77(4):541-580. [cited by applicant]
Narmeen Zakaria Bawany; DDOS Attack Detection and Mitigation Using SON: Methods, Practices, and Solutions; Springer-2017; p. 425-441. [cited by applicant]
National Institute of Standards and Technology [online], “National Vulnerability Database,” last updated Jun. 2, 2020, retrieved on Jun. 3, 2020, retrieved from URL<https://nvd.nist.gov/>, 4 pages. [cited by applicant]
Neo4j.com [online], “Random Walk,” available on or before Aug. 6, 2020 via Internet Archive: Wayback Machine URL<https://web.archive.org/web/20200806193136/https://neo4j.com/docs/graph-data-science/current/alpha-algorit… [cited by applicant]
Neo4j.com [online], “Topological link prediction,” available on or before May 17, 2020, via Internet Archive: Wayback Machine URL<https://web.archive.org/web/20200517111258/https://neo4j.com/docs/graph-data-science/curr… [cited by applicant]
Neo4j.com [online], “Yen's K-Shortest Paths,” available on or before Aug. 6, 2020 via Internet Archive: Wayback Machine URL<https://web.archive.org/web/20200806185626/https://neo4j.com/docs/graph-data-science/current/al… [cited by applicant]
Networks: An Introduction, Newman (ed.), May 2010, 789 pages. [cited by applicant]
Noel et al., “CyGraph: Graph-Based Analytics and Visualization for Cybersecurity,” Handbook of Statistics, Jan. 2016, 35:117-167. [cited by applicant]
Noel et al., “Managing attack graph complexity through visual hierarchical aggregation,” Proceedings of the 2004 ACM Workshop on Visualization and Data Mining for Computer Security (VizSEC/DMSEC '04), Washington, DC, US… [cited by applicant]
Noel et al., “Understanding complex network attack graphs through clustered adjacency matrices,” Proceedings of the 21st Annual Computer Security Applications Conference (ACSAC'05), Tucson, AZ, USA, Dec. 5-9, 2005, 10 p… [cited by applicant]
Ortalo et al., “Experimenting with quantitative evaluation tools for monitoring operational security,” IEEE Transactions on Software Engineering, Sep./Oct. 1999, 25(5):633-650. [cited by applicant]
Ou et al., “A Scalable Approach to Attack Graph Generation,” Proceedings of the 13th ACM Conference on Computer and Communication Security, Oct. 2006, 336-345. [cited by applicant]
Ou et al., “MulVAL: A Logic-based Network Security Analyzer,” 14th USENIX Security Symposium, Aug. 2005, Baltimore, MD, USA, 16 pages. [cited by applicant]
Phillips et al., “A graph-based system for network-vulnerability analysis,” Proceedings of the 1998 Workshop on New Security Paradigms, Charlottesville, Virginia, Sep. 22-26, 1998, 71-79. [cited by applicant]
PM4Py.de [online], “DFG: Process Discovery using Directly-Follows Graphs,” available on or before Mar. 7, 2019 via Internet Archive: Wayback Machine URL<https://web.archive.org/web/20190307062454/http://pm4py.pads.rwth-… [cited by applicant]
PM4Py.de [online], “Process Discovery,” available on or before Jun. 26, 2020 via Internet Archive: Wayback Machine URL<https://web.archive.org/web/20200626094921/https://pm4py.fit.fraunhofer.de/documentation#discovery>,… [cited by applicant]
Process Mining, 1st ed., van der Aalst, 2011, Chapters 5-6, 63 pages. [cited by applicant]
Purvine et al., “A Graph-Based Impact Metric for Mitigating Latheral Movement Cyber Attacks”, Automated Descision Making for Active Cyber Defence, Oct. 2016, pp. 45-52. [cited by applicant]
Q. Liu et al., “Latte: Large-Scale Lateral Movement Detection,” MILCOM 2018—2018 IEEE Military Communications Conference (MILCOM), 2018, pp. 1-6, doi: 10.1109/MILCOM.2018.8599748. (Year: 2018). [cited by applicant]
Rossi et al., “Knowledge Graph Embedding for Link Prediction: A Comparative Analysis,” arXiv, Feb. 3, 2020, arXiv:2002.00819v1, 42 pages. [cited by applicant]
Sales et al., “Ontological anti-patterns in taxonomic structures,” Presented at Proceedings of ONTOBRAS 2019: XII Seminar on Ontology Research in Brazil, Porto Alegre, Brazil, Sep. 2-5, 2019, 13 pages. [cited by applicant]
Schatz et al., “Economic valuation for information security investment: a systematic literature review,” Information Systems Frontiers, Apr. 18, 2016, 19:1205-1228. [cited by applicant]
Shandilya et al., “Use of Attack Graphs in Security Systems”, Hindawi Journal of Computer Networks and Communications, Oct. 20, 2014, 2014:818957, 14 pages. [cited by applicant]
Shi et al., “Normalized Cuts and Image Segmentation,” IEEE Transactions on Pattern Analysis and Machine Intelligence, Aug. 2000, 22(8):888-905. [cited by applicant]
Siemens.com [online], “From vehicle design to multi-physical simulations,” available on or before Jul. 26, 2019 via Internet Archive: Wayback Machine URL<https://web.archive.org/web/20190726044643/https://new.siemens.co… [cited by applicant]
Sitton-Candanedo et al., “A review of edge computing reference architectures and a new global edge proposal,” Future Generation Computer Systems, Oct. 2019, 99:278-294. [cited by applicant]
SMMT.co.uk [online], “Role of Digital Twin in Automotive Industry,” Dec. 17, 2018, retrieved on Jul. 9, 2021, retrieved from URL<https://www.smmt.co.uk/2018/12/role-of-digital-twin-in-automotive-industry/>, 9 pages. [cited by applicant]
Sourceforge.net [online], “XSB,” last updated Oct. 29, 2017, retrieved on Jun. 3, 2020, retrieved from URL <http://xsb.sourceforge.net/>, 2 pages. [cited by applicant]
Stanek et al., “Method of comparing graph differencing algorithms for software differencing,” 2008 IEEE International Conference on Electro/Information Technology, Ames, Iowa, May 18-20, 2008, 482-487. [cited by applicant]
Strom et al., “MITRE ATT&CK™: Design and Philosophy”, The MITRE Corporation, Jul. 2018, 37 pages. [cited by applicant]
Swiler et al., “A graph-based network-vulnerability analysis system,” Sandia National Laboratories, 1997, Tech. Rep. SAND97-3010/1, 25 pages. [cited by applicant]
Tan et al., “Future internet: The Internet of Things,” Presented at Proceedings of the 2010 3rd International Conference on Advanced Computer Theory and Engineering (ICACTE), Chengdu, China, Aug. 20-22, 2010,. [cited by applicant]
TechCrunch.com [online], “Tesla is rolling out its Navigate on Autopilot feature,” Oct. 27, 2018, retrieved on Jul. 9, 2021, retrieved from URL<https://techcrunch.com/2018/10/26/tesla-is-rolling-out-its-navigate-on-auto… [cited by applicant]
The Fourth Industrial Revolution, 1st. ed., Schwab, Jan. 2017, 218 pages. [cited by applicant]
The MITRE Corporation [online], “MITRE ATT&CK,” last updated May 27, 2020, retrieved on Jun. 3, 2020, retrieved from URL <https://attack.mitre.org/>, 3 pages. [cited by applicant]
Ullah et al., “Towards Modeling Attacker's Opportunity for Improving Cyber Resilience in Energy Delivery Systems”, Resilience Week, Aug. 2018, pp. 100-107. [cited by applicant]
Uschold et al., “Ontologies: Principles, methods and applications,” The Knowledge Engineering Review, Jan. 1996, 11(2):93-136. [cited by applicant]
Van Der Aalst et al., “Causal Nets: A Modeling Language Tailored towards Process Discovery,” Presented at Proceedings of CONCUR 2011—Concurrency Theory, Aachen, Germany, Sep. 6-9, 2011; Lecture Notes in Computer Science… [cited by applicant]
Van Heijst et al., “Using explicit ontologies in KBS development,” International Journal of Human-Computer Studies, Feb. 1997, 46(2-3):183-292. [cited by applicant]
Vehicle Power Management, 1st ed., Zhang et al (eds.), Aug. 2011, Chapter 10, 27 pages. [cited by applicant]
W3.org [online], “SWRL: A Semantic Web Rule Language Combining OWL and RuleML,” May 21, 2004, retrieved on Oct. 4, 2022, retrieved from URL<https://www.w3.org/Submission/SWRL/>, 24 pages. [cited by applicant]
Wand et al., “On the deep structure of information systems,” Information Systems Journal, Jul. 1995, 5(3):203-223. [cited by applicant]
Wang et al., “A Network Vulnerability Assessment Method Based on Attack Graph,” 2018 IEEE 4th International Conference on Computer and Communications, Dec. 7-10, 2018, Chengdu, China, 1149-1154. [cited by applicant]
Wang et al., “Big data analytics in cyber security: network traffic and attacks,” Journal of Computer Information Systems, Jan. 2020, 61(3):1-8. [cited by applicant]
Wang et al., “Exploring Attack Graph for Cost-benefit Security Hardening: A Probabilistic Approach,” Computers & Security, Feb. 2013, 32:158-169. [cited by applicant]
Ward et al., “Threat Analysis and Risk Assessment in Automotive Cyber Security,” SAE Int. J. Passeng. Cars Electron. Electr. Systems, May 2013, 6(2):507-513. [cited by applicant]
Wikipedia.org [online], “5G,” last updated Jul. 9, 2021, retrieved on Jul. 9, 2021, retrieved from URL<https://en.wikipedia.org/wiki/5G>, 29 pages. [cited by applicant]
Wikipedia.org [online], “Active Directory,” last updated Jun. 1, 2020, retrieved on Jun. 3, 2020, retrieved from URL <https://en.wikipedia.org/wiki/Active_Directory>, 14 pages. [cited by applicant]
Wikipedia.org [online], “Backward Chaining,” last updated Nov. 16, 2019, retrieved on Jun. 3, 2020, retrieved from URL <https://en.wikipedia.org/wiki/Backward_chaining>, 3 pages. [cited by applicant]
Wikipedia.org [online], “Breadth-first search,” last updated Jul. 21, 2021, retrieved on Jul. 28, 2021, retrieved from URL<https://en.wikipedia.org/wiki/Breadth-first_search>, 6 pages. [cited by applicant]
Wikipedia.org [online], “Cartesian Product,” last updated Feb. 28, 2020, retrieved on Jun. 3, 2020, retrieved from URL <https://en.wikipedia.org/wiki/Cartesian_product>, 9 pages. [cited by applicant]
Wikipedia.org [online], “Centrality,” last updated May 29, 2020, retrieved on Jun. 3, 2020, retrieved from URL <https://en.wikipedia.org/wiki/Centrality>, 15 pages. [cited by applicant]
Wikipedia.org [online], “Centrality,” last updated Oct. 18, 2020, retrieved on Oct. 26, 2020, retrieved from URL<https://en.wikipedia.org/wiki/Centrality>, 15 pages. [cited by applicant]
Wikipedia.org [online], “Common Vulnerabilities and Exposures,” last updated Jul. 6, 2021, retrieved on Jul. 9, 2021, retrieved from URL<https://en.wikipedia.org/wiki/Common_Vulnerabilities_and_Exposures>, 5 pages. [cited by applicant]
Wikipedia.org [online], “Common Vulnerability Scoring System,” last updated Jun. 21, 2021, retrieved on Jul. 9, 2021, retrieved from URL<https://en.wikipedia.org/wiki/Common_Vulnerability_Scoring_System>, 7 pages. [cited by applicant]
Wikipedia.org [online], “Depth-first search,” last updated Jun. 16, 2021, retrieved on Jul. 28, 2021, retrieved from URL<https://en.wikipedia.org/wiki/Depth-first_search>, 8 pages. [cited by applicant]
Wikipedia.org [online], “Digital twin,” last updated Jul. 8, 2021, retrieved on Jul. 9, 2021, retrieved from URL<https://en.wikipedia.org/wiki/Digital_twin>, 13 pages. [cited by applicant]
Wikipedia.org [online], “Eigenvector centrality,” last updated Dec. 1, 2020 retrieved on Jan. 11, 2021, retrieved from URL<https://en.wikipedia.org/wiki/Eigenvector_centrality>, 4 pages. [cited by applicant]
Wikipedia.org [online], “Flood Fill,” last updated Dec. 24, 2019, retrieved on Jun. 3, 2020, retrieved from URL <https://en.wikipedia.org/wiki/Flood_fill>, 7 pages. [cited by applicant]
Wikipedia.org [online], “Floyd-Warshall algorithm,” last updated Jan. 5, 2021, retrieved on Jan. 11, 2021, retrieved from URL<https://en.wikipedia.org/wiki/Floyd%E2%80%93Warshall_algorithm>, 7 pages. [cited by applicant]
Wikipedia.org [online], “Forward Chaining,” last updated Nov. 18, 2019, retrieved on Jun. 3, 2020, retrieved from URL <https://en.wikipedia.org/wiki/Forward_chaining>, 3 pages. [cited by applicant]
Wikipedia.org [online], “Look-ahead (backtracking),” last updated May 23, 2020, retrieved on Jun. 3, 2020, retrieved from URL <https://en.wikipedia.org/wiki/Look-ahead_(backtracking)>, 3 pages. [cited by applicant]
Wikipedia.org [online], “Natural language processing,” last updated Jun. 10, 2022, retrieved on Jun. 14, 2022, retrieved from URL<https://en.wikipedia.org/wiki/Natural_language_processing>, 13 pages. [cited by applicant]
Wikipedia.org [online], “Reachability,” last updated Oct. 22, 2021, retrieved on Jul. 13, 2022, retrieved from URL<https://en.wikipedia.org/wiki/Reachability>, 5 pages. [cited by applicant]
Wikipedia.org [online], “SCADA,” last updated Jun. 2, 2020, retrieved on Jun. 3, 2020, retrieved from URL <https://en.wikipedia.org/wiki/SCADA>, 12 pages. [cited by applicant]
Wikipedia.org [online], “Sigmoid function,” last updated Dec. 25, 2020, retrieved on Jan. 11, 2021, retrieved from URL<https://en.wikipedia.org/wiki/Sigmoid_function>, 4 pages. [cited by applicant]
Wikipedia.org [online], “SWOT analysis,” last updated Oct. 20, 2020, retrieved on Oct. 26, 2020, retrieved from URL<https://en.wikipedia.org/wiki/SWOT_analysis>, 8 pages. [cited by applicant]
Wikipedia.org [online], “Traffic congestion,” last updated Oct. 5, 2020, retrieved on Oct. 26, 2020, retrieved from URL<https://en.wikipedia.org/wiki/Traffic_congestion>, 24 pages. [cited by applicant]
Wikipedia.org [online], “Traffic flow,” last updated Oct. 19, 2020, retrieved on Oct. 26, 2020, retrieved from URL<https://en.wikipedia.org/wiki/Traffic_flow>, 41 pages. [cited by applicant]
Wikipedia.org [online], “Zero-day (computing),” last updated Oct. 16, 2020, retrieved on Oct. 26, 2020, retrieved from URL<https://en.wikipedia.org/wiki/Zero-day_(computing)>, 8 pages. [cited by applicant]
Williams et al., “An Interactive Attack Graph Cascade and Reachability Display,” Proceedings of the Workshop on Visualization for Computer Security (VizSEC 2007), Sacramento, CA, USA, Oct. 29, 2007, 17 pages. [cited by applicant]
Wu et al., “A service-oriented architecture for business intelligence,” Presented at Proceedings of the IEEE International Conference on Service-Oriented Computing and Applications (SOCA '07), Newport Beach, CA, USA, Ju… [cited by applicant]
X. Li, C. Zhang, T. Jung, J. Qian and L. Chen, “Graph-based privacy-preserving data publication,” IEEE INFOCOM 2016—The 35th Annual IEEE International Conference on Computer Communications, 2016, pp. 1-9, doi: 10.1109/I… [cited by applicant]
Xie et al., “Using Bayesian Networks for Cyber Security Analysis,” Proceedings of the 2010 IEEE/IFIP International Conference on Dependable Systems & Networks, Jun. 28-Jul. 1, 2010, Chicago, Illinois, 211-220. [cited by applicant]
Yi et al., “Overview on attack graph generation and visualization technology,” 2013 International Conference on Anti-Counterfeiting, Security and Identification (ASID), Shanghai, China, Oct. 25-27, 2013, 6 pages. [cited by applicant]
You et al., “A Review of Cyber Security Controls from An ICS Perspective,” Proceedings of 2018 International Conference on Platform Technology and Service (PlatCon), Jan. 29-31, 2018, Jeju, South Korea, 5 pages. [cited by applicant]
Yousefi et al., “A novel approach for analysis of attack graph,” Proceedings of the 2017 IEEE International Conference on Intelligence and Security Informatics (ISI), Beijing, China, Jul. 22-24, 2017, 6 pages. [cited by applicant]
Zeng et al., “Survey of Attack Graph Analysis Methods from the Perspective of Data and Knowledge Processing,” Hindawi Security and Communication Networks, Dec. 26, 2019, 2019:2031063, 17 pages. [cited by applicant]
Zhang et al., “Co-simulation framework for design of time-triggered cyber physical systems,” 2013 ACM/IEEE International Conference on Cyber-Physical Systems (ICCPS), Philadelphia, Pennsylvania, Apr. 8-11, 2013, 119-128. [cited by applicant]
Zhang et al., “Optimal Decision-Making Approach for Cyber Security Defense Using Game Theory and Intelligent Learning,” Security and Communication Networks, Dec. 23, 2019, 2019:3038586, 17 pages. [cited by applicant]
Zhao et al., “Attack graph analysis method for large scale network security hardening,” J. Front. Comput. Sci. Technology, 2018, 12(2):263-273 (with English Abstract). [cited by applicant]
Zhou et al., “Automatically Correcting Networks with NEAt,” Proceedings of the 15th USENIX Symposium on Networked Systems Design and Implementation (NSDI '18), Renton, WA, USA, Apr. 9-11, 2018, 595-608. [cited by applicant]