Recently, Dallal, Neider, and Tabuada studied a generalization of the classical game-theoretic model used in program synthesis, which additionally accounts for unmodeled intermittent disturbances. In this extended framework, one is interested in computing optimally resilient strategies, i.e., strategies that are resilient against as many disturbances as possible. Dallal, Neider, and Tabuada showed how to compute such strategies for safety specifications. In this work, we compute optimally resilient strategies for a much wider range of winning conditions and show that they do not require more memory than winning strategies in the classical model. Our algorithms only have a polynomial overhead in comparison to the ones computing winning strategies. In particular, for parity conditions, optimally resilient strategies are positional and can be computed in quasipolynomial time.


    Access

    Download


    Export, share and cite



    Title :

    Synthesizing optimally resilient controllers


    Contributors:

    Published in:

    Acta Informatica ; 57 , 1 ; 195-221


    Publication date :

    2019-10-31



    Type of media :

    Article (Journal)


    Type of material :

    Electronic Resource


    Language :

    English




    Performance analysis of MR damper based semi-active suspension system using optimally tuned controllers

    Tharehalli mata, Gurubasavaraju / Mokenapalli, Vijay / Krishna, Hemanth | SAGE Publications | 2021


    Optimizing primary and backup SDN controllers' placement resilient to node-targeted attacks

    Mycek, Mariusz / Pióro, Michal / Tomaszewski, Artur et al. | BASE | 2023

    Free access


    Towards Synthesizing Energy-efficient Controllers for Modern Production Systems from Scenario-based Specifications

    Greenyer, Joel / Hansen, Christian / Kotlarski, Jens et al. | BASE | 2014

    Free access

    Locating Airline Hubs Optimally

    Ernst, A. / Krishnamoorthy, M. / Campbell, J. et al. | British Library Conference Proceedings | 2001