Automated synthesis of reliable and efficient systems through game theory: a case study

Reactive computer systems bear inherent complexity due to continuous interactions with their environment. While this environment often proves to be uncontrollable, we still want to ensure that critical computer systems will not fail, no matter what they face. Examples are legion: railway traffic, power plants, plane navigation systems, etc. Formal verification of a system may ensure that it satisfies a given specification, but only applies to an already existing model of a system. In this work, we address the problem of synthesis: starting from a specification of the desired behavior, we show how to build a suitable system controller that will enforce this specification. In particular, we discuss recent developments of that approach for systems that must ensure Boolean behaviors (e.g., reachability, liveness) along with quantitative requirements over their execution (e.g., never drop out of fuel, ensure a suitable mean response time). We notably illustrate a powerful, practically usable algorithm for the automated synthesis of provably safe reactive systems.

[1]  Krishnendu Chatterjee,et al.  Strategy synthesis for multi-dimensional quantitative objectives , 2012, Acta Informatica.

[2]  Thomas A. Henzinger,et al.  Alternating-time temporal logic , 1999 .

[3]  Thomas A. Henzinger,et al.  Interface Theories for Component-Based Design , 2001, EMSOFT.

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

[5]  Krishnendu Chatterjee,et al.  Mean-payoff parity games , 2005, 20th Annual IEEE Symposium on Logic in Computer Science (LICS' 05).

[6]  Thomas A. Henzinger,et al.  Fair Simulation , 1997, Inf. Comput..

[7]  Wolfgang Thomas,et al.  Languages, Automata, and Logic , 1997, Handbook of Formal Languages.

[8]  Donald A. Martin,et al.  The determinacy of Blackwell games , 1998, Journal of Symbolic Logic.

[9]  Alonzo Church,et al.  Logic, arithmetic, and automata , 1962 .

[10]  Tomás Brázdil,et al.  Reachability Games on Extended Vector Addition Systems with States , 2010, ICALP.

[11]  Véronique Bruyère,et al.  Acacia+, a Tool for LTL Synthesis , 2012, CAV.

[12]  J. Neumann,et al.  Theory of games and economic behavior , 1945, 100 Years of Math Milestones.

[13]  Ralph Duncan James,et al.  Proceedings of the International Congress of Mathematicians , 1975 .

[14]  Krishnendu Chatterjee,et al.  Energy Parity Games , 2010, ICALP.

[15]  Krishnendu Chatterjee,et al.  Generalized Mean-payoff and Energy Games , 2010, FSTTCS.

[16]  Émile Borel,et al.  Applications sux jeux de hasard , 1938 .

[17]  Amir Pnueli,et al.  On the synthesis of a reactive module , 1989, POPL '89.

[18]  Kim G. Larsen,et al.  Energy Games in Multiweighted Automata , 2011, ICTAC.

[19]  Augustin M. Cournot.  Cournot, Antoine Augustin: Recherches sur les principes mathématiques de la théorie des richesses , 2019, Die 100 wichtigsten Werke der Ökonomie.

[20]  P. Ramadge,et al.  Supervisory control of a class of discrete event processes , 1987 .

[21]  Patricia Bouyer,et al.  Measuring Permissiveness in Parity Games: Mean-Payoff Parity Games Revisited , 2011, ATVA.