Efficient Controller Synthesis for Consumption Games with Multiple Resource Types
We introduce consumption games, a model for discrete interactive system with multiple resources that are consumed or reloaded independently. More precisely, a consumption game is a finite-state graph where each transition is labeled by a vector of resource updates, where every update is a non-positive number or ω. The ω updates model the reloading of a given resource. Each vertex belongs either to player □ or player Open image in new window , where the aim of player □ is to play so that the resources are never exhausted. We consider several natural algorithmic problems about consumption games, and show that although these problems are computationally hard in general, they are solvable in polynomial time for every fixed number of resource types (i.e., the dimension of the update vectors) and bounded resource updates.
KeywordsPolynomial Time Minimal Element Current Load Safe Distance Winning Strategy
Unable to display preview. Download preview PDF.
- 2.Bouyer, P., Fahrenberg, U., Larsen, K.G., Markey, N.: Timed automata with observers under energy constraints. In: Johansson, K., Yi, W. (eds.) HSCC 2010, pp. 61–70. ACM (2010)Google Scholar
- 3.Brázdil, T., Chatterjee, K., Kučera, A., Novotný, P.: Efficient controller synthesis for consumption games with multiple resource types, CoRR abs/1202.0796 (2012)Google Scholar
- 7.Chatterjee, K., Doyen, L., Henzinger, T.A., Raskin, J.-F.: Generalized mean-payoff and energy games. In: Lodaya, K., Mahajan, M. (eds.) Proc. of FSTTCS 2010. LIPIcs, vol. 8, pp. 505–516. Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik (2010)Google Scholar
- 8.Dziembowski, S., Jurdzinski, M., Walukiewicz, I.: How much memory is needed to win infinite games? In: LICS 1997, pp. 99–110. IEEE (1997)Google Scholar
- 9.Emerson, E., Jutla, C.: The complexity of tree automata and logics of programs. In: FOCS 1988, pp. 328–337. IEEE (1988)Google Scholar
- 11.Kurshan, R.: Computer-aided verification of coordinating processes: the automata-theoretic approach. Princeton University Press (1994)Google Scholar
- 12.Lipton, R.: The reachability problem requires exponential space. Technical report 62, Yale University (1976)Google Scholar
- 13.Piterman, N., Pnueli, A.: Faster solution of Rabin and Streett games. In: LICS 2006, pp. 275–284. IEEE (2006)Google Scholar