TY - GEN

T1 - Energy Games with Resource-Bounded Environments

AU - Kupferman, Orna

AU - Halevy, Naama Shamash

N1 - Funding Information: Supported by the Israel Science Foundation, grant No. Publisher Copyright: © Orna Kupferman and Naama Shamash Halevy; licensed under Creative Commons License CC-BY 4.0.

PY - 2022/9/1

Y1 - 2022/9/1

N2 - An energy game is played between two players, modeling a resource-bounded system and its environment. The players take turns moving a token along a finite graph. Each edge of the graph is labeled by an integer, describing an update to the energy level of the system that occurs whenever the edge is traversed. The system wins the game if it never runs out of energy. Different applications have led to extensions of the above basic setting. For example, addressing a combination of the energy requirement with behavioral specifications, researchers have studied richer winning conditions, and addressing systems with several bounded resources, researchers have studied games with multidimensional energy updates. All extensions, however, assume that the environment has no bounded resources. We introduce and study both-bounded energy games (BBEGs), in which both the system and the environment have multi-dimensional energy bounds. In BBEGs, each edge in the game graph is labeled by two integer vectors, describing updates to the multi-dimensional energy levels of the system and the environment. A system wins a BBEG if it never runs out of energy or if its environment runs out of energy. We show that BBEGs are determined, and that the problem of determining the winner in a given BBEG is decidable iff both the system and the environment have energy vectors of dimension 1. We also study how restrictions on the memory of the system and/or the environment as well as upper bounds on their energy levels influence the winner and the complexity of the problem.

AB - An energy game is played between two players, modeling a resource-bounded system and its environment. The players take turns moving a token along a finite graph. Each edge of the graph is labeled by an integer, describing an update to the energy level of the system that occurs whenever the edge is traversed. The system wins the game if it never runs out of energy. Different applications have led to extensions of the above basic setting. For example, addressing a combination of the energy requirement with behavioral specifications, researchers have studied richer winning conditions, and addressing systems with several bounded resources, researchers have studied games with multidimensional energy updates. All extensions, however, assume that the environment has no bounded resources. We introduce and study both-bounded energy games (BBEGs), in which both the system and the environment have multi-dimensional energy bounds. In BBEGs, each edge in the game graph is labeled by two integer vectors, describing updates to the multi-dimensional energy levels of the system and the environment. A system wins a BBEG if it never runs out of energy or if its environment runs out of energy. We show that BBEGs are determined, and that the problem of determining the winner in a given BBEG is decidable iff both the system and the environment have energy vectors of dimension 1. We also study how restrictions on the memory of the system and/or the environment as well as upper bounds on their energy levels influence the winner and the complexity of the problem.

KW - Decidability

KW - Energy Games

KW - Infinite-State Systems

UR - http://www.scopus.com/inward/record.url?scp=85138710309&partnerID=8YFLogxK

U2 - https://doi.org/10.4230/LIPIcs.CONCUR.2022.19

DO - https://doi.org/10.4230/LIPIcs.CONCUR.2022.19

M3 - Conference contribution

T3 - Leibniz International Proceedings in Informatics, LIPIcs

SP - 19:1-19:23

BT - 33rd International Conference on Concurrency Theory, CONCUR 2022

A2 - Klin, Bartek

A2 - Lasota, Slawomir

A2 - Muscholl, Anca

PB - Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing

T2 - 33rd International Conference on Concurrency Theory, CONCUR 2022

Y2 - 12 September 2022 through 16 September 2022

ER -