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.
|Bogserie||Lecture Notes in Computer Science|
|Status||Udgivet - 1 jan. 2011|
|Begivenhed||8th International Colloquium on Theoretical Aspects of Computing - Johannesburg, Sydafrika|
Varighed: 31 aug. 2011 → 2 sep. 2011
Konferencens nummer: 8
|Konference||8th International Colloquium on Theoretical Aspects of Computing|
|Periode||31/08/2011 → 02/09/2011|