2019/09/17 by Corina Cîrstea
Computer Science · #cs.GT #cs.LO
paper · pdf · doi:10.4204/eptcs.305.4
published as EPTCS 305, 2019, pp. 50-65 · In Proceedings GandALF 2019, arXiv:1909.05979
arxiv created 2019/09/17 · arxiv updated 2019/09/18
We consider quantitative notions of parity automaton and parity game aimed at modelling resource-aware behaviour, and study (memory-full) strategies for exhibiting accepting runs that require a minimum amount of initial resources, respectively for winning a game with minimum initial resources. We also show how such strategies can be simplified to consist of only two types of moves: the former aimed at increasing resources, the latter aimed at satisfying the acceptance condition.