Security-Aware Synthesis Using Delayed-Action Games

  title={Security-Aware Synthesis Using Delayed-Action Games},
  author={Mahmoud Elfar and Yu Wang and Miroslav Pajic},
Stochastic multiplayer games (SMGs) have gained attention in the field of strategy synthesis for multi-agent reactive systems. However, standard SMGs are limited to modeling systems where all agents have full knowledge of the state of the game. In this paper, we introduce delayed-action games (DAGs) formalism that simulates hidden-information games (HIGs) as SMGs, where hidden information is captured by delaying a player's actions. The elimination of private variables enables the usage of SMG… 
Learning Optimal Strategies for Temporal Tasks in Stochastic Games
This work intro-duce a model-free reinforcement learning (RL) approach that derives controllers from given LTL specifications even when the environment is completely unknown, and shows that this approach is scalable to a wide range of LTL formulas, and outperforming existing methods for learning controllers from LTL speakers in SGs.
Security-Aware Synthesis of Human-UAV Protocols
This work presents a stochastic game-based model for the H-UAV protocol synthesis that accounts for both the operator and an adversary capable of launching stealthy false-data injection attacks, causing the UAV to deviate from its path.
Hyperproperties for Robotics: Planning via HyperLTL
It is shown that important planning objectives, such as optimality, robustness, and privacy, involve the interrelation between multiple paths, and cannot be expressed with usual temporal logics like the linear temporal logic (LTL).
A Security Reference Model for Autonomous Vehicles in Military Operations
A reference model is defined for autonomous vehicles to use as a common basis for the assessment of risks and the design of the security controls and this layer focuses on the risk assessment of the vehicles themselves and on producing a highlevel security design adequate for the mission defined in the first layer.
Secure Planning Against Stealthy Attacks via Model-Free Reinforcement Learning
It is shown that the planning problem, described formally as the problem of satisfying an LTL formula in a stochastic game, can be solved via model-free reinforcement learning when the environment is completely unknown.


PRISM-games: verification and strategy synthesis for stochastic multi-player games with multiple objectives
A detailed overview of the PRISM-games tool, including its modelling and property specification formalisms, and its underlying architecture and implementation, is provided, which includes multi-objective and compositional approaches to verification and strategy synthesis.
PRISM-games: A Model Checker for Stochastic Multi-Player Games
The tool is based on the probabilistic model checker PRISM, benefiting from its existing user interface and simulator, whilst adding novel model checking algorithms for stochastic games, as well as functionality to synthesise optimal player strategies.
Strategy Representation by Decision Trees in Reactive Synthesis
Decision trees are proposed for strategy representation in graph games, and new techniques to extend decision trees to overcome the above obstacles, while retaining the entropy-based techniques to obtain succinct trees are developed.
Semiperfect-Information Games
This model is appropriate in control situations where a controller must cope with plant behavior that is as adversarial as possible, i.e., the controller has partial information while the plant has perfect information, and it is shown that these semiperfect-information turn-based games are equivalent to perfect-information concurrent games, where the two players choose their moves simultaneously and independently.
Assume-guarantee strategy synthesis for stochastic games
This thesis presents a framework for the automatic strategy synthesis from quantitative specifications, in order to control autonomous systems. We model systems as turn-based two-player zero-sum
An Automaton Learning Approach to Solving Safety Games over Infinite Graphs
This work proposes a method to construct finite-state reactive controllers for systems whose interactions with their adversarial environment are modeled by infinite-duration two-player games over possibly infinite graphs, and presents a symbolic representation of safety games inspired by regular model checking.
Stochastic Game Logic
The paper presents the syntax and semantics of SGL and discusses its model checking problem, which turns out to be undecidable when the strategies are history-dependent and shows PSPACE completeness for memoryless strategies.
Reactive Control Improvisation
The resulting framework of reactive control improvisation provides a natural way to integrate a randomness requirement with the usual functional specifications of reactive synthesis over a finite window and is theoretically characterize when such problems are realizable, and gives a general method for solving them.