Scalable Supervisory Control Approach for Dynamic Cyber Security
Mohammad Rasouli

Citation
Mohammad Rasouli. "Scalable Supervisory Control Approach for Dynamic Cyber Security". Talk or presentation, 28, May, 2015.

Abstract
An analytical and scalable 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. To capture large-scale networks over a long time horizon, we propose scalable algorithms based on defining appropriate information states and using parallel computations.

Electronic downloads


Internal. This publication has been marked by the author for FORCES-only distribution, so electronic downloads are not available without logging in.
Citation formats  
  • HTML
    Mohammad Rasouli. <a
    href="http://www.cps-forces.org/pubs/65.html"
    ><i>Scalable Supervisory Control Approach for
    Dynamic Cyber Security</i></a>, Talk or
    presentation,  28, May, 2015.
  • Plain text
    Mohammad Rasouli. "Scalable Supervisory Control
    Approach for Dynamic Cyber Security". Talk or
    presentation,  28, May, 2015.
  • BibTeX
    @presentation{Rasouli15_ScalableSupervisoryControlApproachForDynamicCyberSecurity,
        author = {Mohammad Rasouli},
        title = {Scalable Supervisory Control Approach for Dynamic
                  Cyber Security},
        day = {28},
        month = {May},
        year = {2015},
        abstract = {An analytical and scalable 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. To capture large-scale networks
                  over a long time horizon, we propose scalable
                  algorithms based on defining appropriate
                  information states and using parallel computations.},
        URL = {http://cps-forces.org/pubs/65.html}
    }
    

Posted by Carolyn Winter on 10 Jun 2015.
Groups: forces
For additional information, see the Publications FAQ or contact webmaster at cps-forces org.

Notice: This material is presented to ensure timely dissemination of scholarly and technical work. Copyright and all rights therein are retained by authors or by other copyright holders. All persons copying this information are expected to adhere to the terms and constraints invoked by each author's copyright.