Energy Games in Multiweighted Automata

Energy games have recently attracted a lot of attention. These are games played on finite weighted automata and concern the existence of infinite runs subject to boundary constraints on the accumulated weight, allowing e.g. only for behaviours where a resource is always available (nonnegative accumulated weight), yet does not exceed a given maximum capacity. We extend energy games to a multiweighted and parameterized setting, allowing us to model systems with multiple quantitative aspects. We present reductions between Petri nets and multiweighted automata and among different types of multiweighted automata and identify new complexity and (un)decidability results for both one- and two-player games. We also investigate the tractability of an extension of multiweighted energy games in the setting of timed automata.

[1]  George J. Pappas,et al.  Optimal Paths in Weighted Timed Automata , 2001, HSCC.

[2]  Kim G. Larsen,et al.  Minimum-Cost Reachability for Priced Timed Automata , 2001, HSCC.

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

[4]  Thomas A. Henzinger,et al.  Hybrid Systems: Computation and Control , 1998, Lecture Notes in Computer Science.

[5]  Szymon Torunczyk,et al.  Energy and Mean-Payoff Games with Imperfect Information , 2010, CSL.

[6]  Gregory F. Sullivan,et al.  Detecting cycles in dynamic graphs in polynomial time , 1988, STOC '88.

[7]  Alex K. Simpson,et al.  Computational Adequacy in an Elementary Topos , 1998, CSL.

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

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

[10]  Uri Zwick,et al.  The Complexity of Mean Payoff Games on Graphs , 1996, Theor. Comput. Sci..

[11]  Kim G. Larsen,et al.  Timed automata with observers under energy constraints , 2010, HSCC '10.

[12]  Hsu-Chun Yen,et al.  A Unified Approach for Deciding the Existence of Certain Petri Net Paths , 1992, Inf. Comput..

[13]  Marvin Minsky,et al.  Computation : finite and infinite machines , 2016 .

[14]  Mohamed Faouzi Atig,et al.  On Yen's Path Logic for Petri Nets , 2009, Int. J. Found. Comput. Sci..

[15]  Javier Esparza,et al.  Decidability and Complexity of Petri Net Problems - An Introduction , 1996, Petri Nets.

[16]  Wolfgang Reisig,et al.  Lectures on Petri Nets I: Basic Models , 1996, Lecture Notes in Computer Science.

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

[18]  Robin Milner,et al.  On Observing Nondeterminism and Concurrency , 1980, ICALP.

[19]  Jirí Srba,et al.  Comparing the Expressiveness of Timed Automata and Timed Extensions of Petri Nets , 2008, FORMATS.

[20]  Jakub Chaloupka.  Z-Reachability Problem for Games on 2-Dimensional Vector Addition Systems with States Is in P , 2010, RP.

[21]  A. Ehrenfeucht,et al.  Positional strategies for mean payoff games , 1979 .

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