A Supervisory Control Approach to Dynamic Cyber-Security
Not on the map. Why?
Abstract (arXiv)
An analytical approach for a dynamic cyber-security problem that captures progressive attacks to a computer network is presented. We formulate the dynamic security problem from the defender's point of view as a supervisory control problem with imperfect information, modeling the computer network's operation by a discrete event system. We consider a min-max performance criterion and use dynamic programming to determine, within a restricted set of policies, an optimal policy for the defender. We study and interpret the behavior of this optimal policy as we vary certain parameters of the supervisory control problem.
Key facts. Cited by 5 papers in the map (data through 14 Oct 2026). First posted on arXiv 2 Sep 2014.
Builds on
No reference list yet.
Built on by
Citing papers per year: 2021: 2; 2022: 1; 2023: 2.
5 papers.
- 2021Intrusion Prevention through Optimal Stoppingcited by 18
- 2023Learning Near-Optimal Intrusion Responses Against Dynamic Attackerscited by 15
- 2021Learning Intrusion Prevention Policies through Optimal Stoppingcited by 11
- 2023Scalable Learning of Intrusion Responses through Recursive Decompositioncited by 8
- 2022Learning Security Strategies through Game Play and Optimal Stoppingcited by 5
- 2023Scalable Learning of Intrusion Responses through Recursive Decomposition6 Sep 2023
- 2023Learning Near-Optimal Intrusion Responses Against Dynamic Attackers11 Jan 2023
- 2022Learning Security Strategies through Game Play and Optimal Stopping29 May 2022
- 2021Intrusion Prevention through Optimal Stopping30 Oct 2021
- 2021Learning Intrusion Prevention Policies through Optimal Stopping14 Jun 2021