Resource-Aware Automata and Games for Optimal Synthesis

TL;DR

This paper introduces resource-aware automata and games to model and synthesize strategies that minimize initial resource requirements for acceptance and winning conditions, simplifying strategy complexity.

Contribution

It presents a novel framework for resource-aware automata and games, focusing on strategies with minimal initial resources and their simplification.

Findings

Strategies can be simplified to two move types: increasing resources and satisfying acceptance.

Strategies for minimal initial resources are effectively characterized and synthesized.

The framework models resource-aware behavior in automata and games effectively.

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.