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.


    Zugriff

    Download


    Exportieren, teilen und zitieren



    Titel :

    Synthesizing optimally resilient controllers


    Beteiligte:

    Erschienen in:

    Acta Informatica ; 57 , 1 ; 195-221


    Erscheinungsdatum :

    31.10.2019



    Medientyp :

    Aufsatz (Zeitschrift)


    Format :

    Elektronische Ressource


    Sprache :

    Englisch




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

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



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

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

    Freier Zugriff

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

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

    Freier Zugriff

    Locating Airline Hubs Optimally

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