IDEAS home Printed from https://ideas.repec.org/a/gam/jgames/v14y2023i2p30-d1112039.html
   My bibliography  Save this article

Robust Satisfaction of Metric Interval Temporal Logic Objectives in Adversarial Environments

Author

Listed:
  • Luyao Niu

    (Network Security Lab, Department of Electrical and Computer Engineering, University of Washington, Seattle, WA 98195, USA)

  • Bhaskar Ramasubramanian

    (Electrical and Computer Engineering, Western Washington University, Bellingham, WA 98225, USA)

  • Andrew Clark

    (Department of Electrical and Systems Engineering, Washington University in St. Louis, St. Louis, MO 63130, USA)

  • Radha Poovendran

    (Network Security Lab, Department of Electrical and Computer Engineering, University of Washington, Seattle, WA 98195, USA)

Abstract

This paper studies the synthesis of controllers for cyber-physical systems (CPSs) that are required to carry out complex time-sensitive tasks in the presence of an adversary. The time-sensitive task is specified as a formula in the metric interval temporal logic (MITL). CPSs that operate in adversarial environments have typically been abstracted as stochastic games (SGs); however, because traditional SG models do not incorporate a notion of time, they cannot be used in a setting where the objective is time-sensitive. To address this, we introduce durational stochastic games (DSGs). DSGs generalize SGs to incorporate a notion of time and model the adversary’s abilities to tamper with the control input (actuator attack) and manipulate the timing information that is perceived by the CPS (timing attack). We define notions of spatial, temporal, and spatio-temporal robustness to quantify the amounts by which system trajectories under the synthesized policy can be perturbed in space and time without affecting satisfaction of the MITL objective. In the case of an actuator attack, we design computational procedures to synthesize controllers that will satisfy the MITL task along with a guarantee of its robustness. In the presence of a timing attack, we relax the robustness constraint to develop a value iteration-based procedure to compute the CPS policy as a finite-state controller to maximize the probability of satisfying the MITL task. A numerical evaluation of our approach is presented on a signalized traffic network to illustrate our results.

Suggested Citation

  • Luyao Niu & Bhaskar Ramasubramanian & Andrew Clark & Radha Poovendran, 2023. "Robust Satisfaction of Metric Interval Temporal Logic Objectives in Adversarial Environments," Games, MDPI, vol. 14(2), pages 1-23, March.
  • Handle: RePEc:gam:jgames:v:14:y:2023:i:2:p:30-:d:1112039
    as

    Download full text from publisher

    File URL: https://www.mdpi.com/2073-4336/14/2/30/pdf
    Download Restriction: no

    File URL: https://www.mdpi.com/2073-4336/14/2/30/
    Download Restriction: no
    ---><---

    References listed on IDEAS

    as
    1. William S. Jewell, 1963. "Markov-Renewal Programming. I: Formulation, Finite Return Models," Operations Research, INFORMS, vol. 11(6), pages 938-948, December.
    Full references (including those not matched with items on IDEAS)

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. Nooshin Salari & Viliam Makis, 2020. "Application of Markov renewal theory and semi‐Markov decision processes in maintenance modeling and optimization of multi‐unit systems," Naval Research Logistics (NRL), John Wiley & Sons, vol. 67(7), pages 548-558, October.
    2. Chris P. Lee & Glenn M. Chertow & Stefanos A. Zenios, 2008. "Optimal Initiation and Management of Dialysis Therapy," Operations Research, INFORMS, vol. 56(6), pages 1428-1449, December.
    3. Zhang, Xueqing & Gao, Hui, 2012. "Road maintenance optimization through a discrete-time semi-Markov decision process," Reliability Engineering and System Safety, Elsevier, vol. 103(C), pages 110-119.
    4. Prasenjit Mondal, 2020. "Computing semi-stationary optimal policies for multichain semi-Markov decision processes," Annals of Operations Research, Springer, vol. 287(2), pages 843-865, April.

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:gam:jgames:v:14:y:2023:i:2:p:30-:d:1112039. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: MDPI Indexing Manager (email available below). General contact details of provider: https://www.mdpi.com .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.