Indecision and delays are the parents of failure—taming them algorithmically by synthesizing delay-resilient control

Chen, Mingshuai; Fränzle, Martin; Li, Yangjia; Mosaad, Peter Nazier; Zhan, Naijun

doi:10.1007/s00236-020-00374-7

Cited by 8 publications

(12 citation statements)

References 29 publications

(56 reference statements)

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Thus, it is natural to ask whether environment and Player O also share such a tight correspondence. A first indication that this is not the case can be obtained by considering the determinacy of these games: While delay games with Borel winning conditions are determined [8], even safety games under delayed action are not necessarily determined [2].…”

Section: Environment's Viewmentioning

confidence: 99%

“…Stated differently, if environment picks h (t) in his first move, then the play in which the second action of controller is t (h) is winning for controller. 2 Now, we consider the delay game Γ k (L(G )) for k = 1. Recall that the winning condition L(G ) contains the winning plays for Player O, i.e., we have…”

Section: Environment's Viewmentioning

confidence: 99%

“…Remark 3. Our definition of games under delayed control differs in three aspects from the original definition of Chen et al [2].…”

Section: Games Under Delayed Controlmentioning

confidence: 99%

See 2 more Smart Citations

Strategies Resilient to Delay: Games under Delayed Control vs. Delay Games

Fränzle,

Winter,

Zimmermann

2023

Electron. Proc. Theor. Comput. Sci.

Self Cite

View full text Add to dashboard Cite

We compare games under delayed control and delay games, two types of infinite games modelling asynchronicity in reactive synthesis. Our main result, the interreducibility of the existence of sure winning strategies for the protagonist, allows to transfer known complexity results and bounds on the delay from delay games to games under delayed control, for which no such results had been known. We furthermore analyze existence of randomized strategies that win almost surely, where this correspondence between the two types of games breaks down.signal processing chains based on computer vision to detect the locations of obstacles. Thus, decisions have to be made based on incomplete information, which only arrives after some delay.Games under Delayed Control. Chen et al.[2] introduced (graph) games under delayed control to capture this type of incomplete information. Intuitively, assume the players so far have constructed a finite path v 0 • • • v k through the graph. Then, the controller has to base her decision on a visible proper prefix v 0 • • • v k−δ , where δ is the amount of delay. Hence, the suffix v k−δ +1 • • • v k is not yet available to base the decision on, although the decision to be made is to be applied at the last state v k in the sequence.They showed that solving games under delayed control with safety conditions and with respect to a given delay is decidable: They presented two algorithms, an exponential one based on a reduction to delay-free safety games using a queue of length δ , and a more practical incremental algorithm synthesizing a series of controllers handling increasing delays and reducing game-graph size in between. They showed that even a naïve implementation of this algorithm outperforms the reduction-based one, even when the latter is used with state-of-the-art solvers for delay-free games. However, the exact complexity of the incremental algorithm and that of solving games under delayed control remained open.Note that asking whether there is some delay δ that allows controller to win reduces to solving standard, i.e., delay-free games, as they correspond to the case δ = 0. The reason is monotonicity in the delay: if the controller can win for delay δ then also for any δ ′ < δ . More interesting is the question whether controller wins with respect to every possible delay. Chen et al. conjectured that there is some exponential δ such that if the controller wins under delay δ , then also under every δ ′ .Delay Games. There is also a variant of Gale-Stewart games modelling delayed interaction between the players [7]. Here, the player representing the environment (often called Player I) has to provide a lookahead on her moves, i.e., the player representing the controller (accordingly called Player O) has access to the first n + k letters picked by Player I when picking her n-th letter. So, k is the amount of lookahead that Player I has to grant Player O. Note that the lookahead benefits Player O (representing the controller) while the delay in a game under delayed control disadvantages the...

show abstract

Section: Environment's Viewmentioning

confidence: 99%

Section: Environment's Viewmentioning

confidence: 99%

See 1 more Smart Citation

Strategies Resilient to Delay: Games under Delayed Control vs. Delay Games

Fränzle,

Winter,

Zimmermann

2023

Electron. Proc. Theor. Comput. Sci.

Self Cite

View full text Add to dashboard Cite

show abstract

“…This is because ODEs are Markovian, but DDEs are non-Markovian, whose states are functionals with infinite dimension. In [7,9], a controller synthesis problem for time-delay discrete dynamical systems was first investigated by reduction to solving imperfect two-player safety game, but it is unclear whether their approach can be extended to time-delay continuous dynamical systems and delay hybrid systems.…”

Section: Related Workmentioning

confidence: 99%

Switching Controller Synthesis for Delay Hybrid Systems under Perturbations

Bai

Gan

et al. 2021

Preprint

Self Cite

View full text Add to dashboard Cite

Delays are ubiquitous in modern hybrid systems, which exhibit both continuous and discrete dynamical behaviors. Induced by signal transmission, conversion, the nature of plants, and so on, delays may appear either in the continuous evolution of a hybrid system such that the evolution depends not only on the present state but also on its execution history, or in the discrete switching between its different control modes. In this paper we come up with a new model of hybrid systems, called delay hybrid automata, to capture the dynamics of systems with the aforementioned two kinds of delays. Furthermore, based upon this model we study the robust switching controller synthesis problem such that the controlled delay system is able to satisfy the specified safety properties regardless of perturbations. To the end, a novel method is proposed to synthesize switching controllers based on the computation of differential invariants for continuous evolution and backward reachable sets of discrete jumps with delays. Finally, we implement a prototypical tool of our approach and demonstrate it on some case studies. CCS CONCEPTS• Security and privacy → Formal security models; Logic and verification.

show abstract

“…This advantage allows her to win games she cannot win without lookahead. These games capture the asynchronous interaction of two agents [6],…”

Section: Introductionmentioning

confidence: 99%

Weakness Makes Muller Delay Games Hard

Winter¹,

Zimmermann²

2022

Preprint

View full text Add to dashboard Cite

We show that solving delay games with winning conditions given by deterministic and nondeterministic weak Muller automata is 2EXPTIME-complete respectively 3EXPTIME-complete. Furthermore, doubly and triply exponential lookahead is necessary and sufficient to win such games. These results are the first that show that the succinctness of the automata types used to specify the winning conditions has an influence on the complexity of these problems.

show abstract

Indecision and delays are the parents of failure—taming them algorithmically by synthesizing delay-resilient control

Cited by 8 publications

References 29 publications

Strategies Resilient to Delay: Games under Delayed Control vs. Delay Games

Strategies Resilient to Delay: Games under Delayed Control vs. Delay Games

Switching Controller Synthesis for Delay Hybrid Systems under Perturbations

Weakness Makes Muller Delay Games Hard

Contact Info

Product

Resources

About