Abstract
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.
Author supported by F.R.S.-FNRS. fellowship.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
References
Alur R, Henzinger TA, Kupferman O (2002) Alternating-time temporal logic. J ACM 49(5):672–713
Bloem R, Chatterjee K, Henzinger TA, Jobstmann B (2009) Better quality in synthesis through quantitative objectives. In: Proc of CAV. LNCS, vol 5643. Springer, Berlin, pp 140–156
Bohy A, Bruyère V, Filiot E, Jin N, Raskin J-F (2012) Acacia+, a tool for LTL synthesis. In: Proc of CAV. LNCS, vol 7358. Springer, Berlin, pp 652–657
Borel E, Ville J (1938) Applications aux jeux de hasard. Gauthier-Vilars, Paris
Bouyer P, Markey N, Olschewski J, Ummels M (2011) Measuring permissiveness in parity games: mean-payoff parity games revisited. In: Proc of ATVA. LNCS, vol 6996. Springer, Berlin, pp 135–149
Brázdil T, Jancar P, Kucera A (2010) Reachability games on extended vector addition systems with states. In: Proc of ICALP. LNCS, vol 6199. Springer, Berlin, pp 478–489
Chatterjee K, Doyen L (2010) Energy parity games. In: Proc of ICALP. LNCS, vol 6199. Springer, Berlin, pp 599–610
Chatterjee K, Doyen L, Henzinger TA, Raskin J-F (2010) Generalized mean-payoff and energy games. In: Proc of FSTTCS, LIPIcs 8, Schloss Dagstuhl, LZI, pp 505–516
Chatterjee K, Henzinger TA, Jurdzinski M (2005) Mean-payoff parity games. In: Proc of LICS. IEEE Comput Soc, Los Alamitos, pp 178–187
Chatterjee K, Randour M, Raskin J-F (2012) Strategy synthesis for multi-dimensional quantitative objectives. In: Proc of CONCUR. LNCS, vol 7454. Springer, Berlin, pp 115–131. Extended version on CoRR. arXiv:1201.5073 [cs.GT]
Church A (1962) Logic, arithmetic, and automata. In: Proceedings of the international congress of mathematicians, Institut Mittag-Leffler, pp 23–35
Cournot AA (1838) Recherches sur les principes mathématiques de la théorie des richesses/par Augustin Cournot. Hachette, Paris
de Alfaro L, Henzinger TA (2001) Interface theories for component-based design. In: Proc of EMSOFT. LNCS, vol 2211. Springer, Berlin, pp 148–165
Fahrenberg U, Juhl L, Larsen KG, Srba J (2011) Energy games in multiweighted automata. In: Proc of ICTAC. LNCS, vol 6916. Springer, Berlin, pp 95–115
Henzinger TA, Kupferman O, Rajamani S (2002) Fair simulation. Inf Comput 173(1):64–81
Martin DA (1998) The determinacy of Blackwell games. J Symb Log 63(4):1565–1581
Pnueli A, Rosner R (1989) On the synthesis of a reactive module. In: Proc of POPL, pp 179–190
Ramadge PJ, Wonham WM (1987) Supervisory control of a class of discrete-event processes. SIAM J Control Optim 25(1):206–230
Thomas W (1997) Languages, automata, and logic. In: Handbook of formal languages, beyond words, vol 3. Springer, Berlin, pp 389–455
Von Neumann J, Morgenstern O (1944) Theory of games and economic behavior. Princeton University Press, Princeton
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2013 Springer International Publishing Switzerland
About this paper
Cite this paper
Randour, M. (2013). Automated Synthesis of Reliable and Efficient Systems Through Game Theory: A Case Study. In: Gilbert, T., Kirkilionis, M., Nicolis, G. (eds) Proceedings of the European Conference on Complex Systems 2012. Springer Proceedings in Complexity. Springer, Cham. https://doi.org/10.1007/978-3-319-00395-5_90
Download citation
DOI: https://doi.org/10.1007/978-3-319-00395-5_90
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-00394-8
Online ISBN: 978-3-319-00395-5
eBook Packages: Physics and AstronomyPhysics and Astronomy (R0)