多资源类型消耗游戏的高效控制器综合
Efficient Controller Synthesis for Consumption Games with Multiple Resource Types
AI总结：
针对多资源消耗或重载的离散交互系统，提出消耗游戏模型，并证明对于固定资源类型数量，相关算法问题可在多项式时间内求解。
摘要：
我们引入消耗游戏，一种用于具有多个独立消耗或重载资源的离散交互系统的模型。更精确地说，消耗游戏是一个有限状态图，其中每条转移都标记有一个资源更新向量，每个更新是一个非正数或ω。ω更新模拟给定资源的重载。每个顶点属于玩家□或玩家◇，玩家□的目标是使资源永不耗尽。我们考虑了消耗游戏的几个自然算法问题，并表明尽管这些问题通常计算困难，但对于每个固定的资源类型数量（即更新向量的维度），它们可以在多项式时间内求解。
英文摘要：
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 omega. The omega updates model the reloading of a given resource. Each vertex belongs either to player \Box or player \Diamond, where the aim of player \Box 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).
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
