Optimally Resilient Strategies in Pushdown Safety Games

Infinite-duration games with disturbances extend the classical framework of infinite-duration games, which captures the reactive synthesis problem, with a discrete measure of resilience against non-antagonistic external influence. This concerns events where the observed system behavior differs from the intended one prescribed by the controller. For games played on finite arenas it is known that computing optimally resilient strategies only incurs a polynomial overhead over solving classical games. This paper studies safety games with disturbances played on infinite arenas induced by pushdown systems. We show how to compute optimally resilient strategies in triply-exponential time. For the subclass of safety games played on one-counter configuration graphs, we show that determining the degree of resilience of the initial configuration is PSPACE-complete and that optimally resilient strategies can be computed in doubly-exponential time.

[1]  Anne Condon,et al.  On Algorithms for Simple Stochastic Games , 1990, Advances In Computational Complexity Theory.

[2]  Daniel Neider.  Reachability Games on Automatic Graphs , 2010, CIAA.

[3]  Thierry Cachat,et al.  Higher Order Pushdown Automata, the Caucal Hierarchy of Graphs and Parity Games , 2003, ICALP.

[4]  Rüdiger Ehlers,et al.  How to Handle Assumptions in Synthesis , 2014, SYNT.

[5]  Paul Hunter.  Reachability in Succinct One-Counter Games , 2015, RP.

[6]  Krishnendu Chatterjee,et al.  Better Quality in Synthesis through Quantitative Objectives , 2009, CAV.

[7]  Éric Rutten,et al.  Automating the addition of fault tolerance with discrete controller synthesis , 2009, Formal Methods Syst. Des..

[8]  Wladimir Fridman,et al.  Playing Pushdown Parity Games in a Hurry , 2012, GandALF.

[9]  Anish Arora,et al.  FTSyn: a framework for automatic synthesis of fault-tolerance , 2008, International Journal on Software Tools for Technology Transfer.

[10]  Orna Kupferman,et al.  An Automata-Theoretic Approach to Reasoning about Infinite-State Systems , 2000, CAV.

[11]  Igor Walukiewicz,et al.  Pushdown Processes: Games and Model-Checking , 1996, Inf. Comput..

[12]  Kim G. Larsen,et al.  Infinite Runs in Weighted Timed Automata with Energy Constraints , 2008, FORMATS.

[13]  Thierry Cachat.  Symbolic Strategy Synthesis for Games on Pushdown Graphs , 2002, ICALP.

[14]  Paulo Tabuada,et al.  Robust Linear Temporal Logic , 2015, CSL.

[15]  Ufuk Topcu,et al.  On synthesizing robust discrete controllers under modeling uncertainty , 2012, HSCC '12.

[16]  Géraud Sénizergues,et al.  The Bisimulation Problem for Equational Graphs of Finite Out-Degree , 2000, SIAM J. Comput..

[17]  Ufuk Topcu,et al.  Resilience to intermittent assumption violations in reactive synthesis , 2014, HSCC.

[18]  Thomas W. Reps,et al.  Program Analysis Using Weighted Pushdown Systems , 2007, FSTTCS.

[19]  Parosh Aziz Abdulla,et al.  Infinite-state energy games , 2014, CSL-LICS.

[20]  Jirí Srba,et al.  Roadmap of Infinite Results , 2002, Bull. EATCS.

[21]  Arnaud Carayol,et al.  Optimal Strategies in Pushdown Reachability Games , 2018, MFCS.

[22]  Géraud Sénizergues,et al.  L(A) = L(B) ? decidability results from complete formal systems , 2001 .

[23]  Lukás Holík,et al.  Summaries for Context-Free Games , 2016, FSTTCS.

[24]  George S. Avrunin,et al.  Patterns in property specifications for finite-state verification , 1999, Proceedings of the 1999 International Conference on Software Engineering (IEEE Cat. No.99CB37002).

[25]  Olivier Serre,et al.  Parity Games Played on Transition Graphs of One-Counter Processes , 2006, FoSSaCS.

[26]  Farn Wang,et al.  A Game-Theoretic Foundation for the Maximum Software Resilience against Dense Errors , 2016, IEEE Transactions on Software Engineering.

[27]  Paulo Tabuada,et al.  Synthesis of safety controllers robust to unmodeled intermittent disturbances , 2016, 2016 IEEE 55th Conference on Decision and Control (CDC).

[28]  Lawrence H. Landweber,et al.  Finite Delay Solutions for Sequential Conditions , 1972, ICALP.

[29]  Ufuk Topcu,et al.  An Automaton Learning Approach to Solving Safety Games over Infinite Graphs , 2016, TACAS.

[30]  Kousha Etessami,et al.  Recursive Markov Decision Processes and Recursive Stochastic Games , 2005, ICALP.

[31]  Jean-François Raskin,et al.  Games with imperfect information: theory and algorithms , 2011, Lectures in Game Theory for Computer Scientists.

[32]  Thomas W. Reps,et al.  Precise interprocedural dataflow analysis via graph reachability , 1995, POPL '95.

[33]  Alexander Moshe Rabinovich,et al.  Church Synthesis Problem for Noisy Input , 2011, FoSSaCS.

[34]  Paulo Tabuada,et al.  Towards Robustness for Cyber-Physical Systems , 2014, IEEE Transactions on Automatic Control.

[35]  Gabriel Renault,et al.  Quantitative Games under Failures , 2015, FSTTCS.

[36]  Géraud Sénizergues,et al.  L(A) = L(B)? Decidability Results from Complete Formal Systems , 2002, ICALP.

[37]  David E. Muller,et al.  The Theory of Ends, Pushdown Automata, and Second-Order Logic , 1985, Theor. Comput. Sci..

[38]  Petr Jancar,et al.  A note on emptiness for alternating finite automata with a one-letter alphabet , 2007, Inf. Process. Lett..

[39]  Orna Kupferman,et al.  Latticed-LTL synthesis in the presence of noisy inputs , 2017, Discret. Event Dyn. Syst..

[40]  Martin Zimmermann,et al.  Synthesizing optimally resilient controllers , 2017, Acta Informatica.

[41]  Anish Arora,et al.  Synthesis of fault-tolerant concurrent programs , 2004, TOPL.

[42]  Leslie G. Valiant,et al.  Decision procedures for families of deterministic pushdown automata , 1973 .

[43]  Thomas A. Henzinger,et al.  Resource Interfaces , 2003, EMSOFT.

[44]  Krishnendu Chatterjee,et al.  Synthesizing robust systems , 2009, 2009 Formal Methods in Computer-Aided Design.

[45]  J. R. Büchi,et al.  Solving sequential conditions by finite-state strategies , 1969 .

[46]  Thomas Wilke,et al.  Automata logics, and infinite games: a guide to current research , 2002 .

[47]  Stanislav Böhm,et al.  Bisimulation equivalence and regularity for real-time one-counter automata , 2014, J. Comput. Syst. Sci..

[48]  Paulo Tabuada,et al.  A theory of robust omega-regular software synthesis , 2013, TECS.