Resource-Aware Automata and Games for Optimal Synthesis
Logic in Computer Science
2019-09-18 v1 Computer Science and Game Theory
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.
Keywords
Cite
@article{arxiv.1909.07656,
title = {Resource-Aware Automata and Games for Optimal Synthesis},
author = {Corina Cîrstea},
journal= {arXiv preprint arXiv:1909.07656},
year = {2019}
}
Comments
In Proceedings GandALF 2019, arXiv:1909.05979