Resource-Aware Automata and Games for Optimal Synthesis
arXiv:1909.07656 · doi:10.4204/EPTCS.305.4
Abstract
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.
In Proceedings GandALF 2019, arXiv:1909.05979