Average-Price-per-Reward Games on Hybrid Automata with Strong Resets

Authors:
Marcin Jurdziński;Ranko Lazić;Michał Rutkowski
Affiliations:
Department of Computer Science, University of Warwick, UK;Department of Computer Science, University of Warwick, UK;Department of Computer Science, University of Warwick, UK
Venue:
VMCAI '09 Proceedings of the 10th International Conference on Verification, Model Checking, and Abstract Interpretation
Year:
2008

Citing 12
Cited 0

A theory of timed automata

Theoretical Computer Science
The algorithmic analysis of hybrid systems

Theoretical Computer Science - Special issue on hybrid systems
Computable analysis: an introduction

Computable analysis: an introduction
The theory of hybrid automata

LICS '96 Proceedings of the 11th Annual IEEE Symposium on Logic in Computer Science
Scheduling with timed automata

Theoretical Computer Science - Tools and algorithms for the construction and analysis of systems (TACAS 2003)
Control in o-minimal Hybrid Systems

LICS '06 Proceedings of the 21st Annual IEEE Symposium on Logic in Computer Science
Optimal infinite scheduling for multi-priced timed automata

Formal Methods in System Design
Weighted O-Minimal Hybrid Systems Are More Decidable Than Weighted Timed Automata!

LFCS '07 Proceedings of the international symposium on Logical Foundations of Computer Science
Average-Price and Reachability-Price Games on Hybrid Automata with Strong Resets

FORMATS '08 Proceedings of the 6th international conference on Formal Modeling and Analysis of Timed Systems
On the expressiveness and decidability of o-minimal hybrid systems

Journal of Complexity - Festschrift for the 70th birthday of Arnold Schönhage
Reachability problems on extended o-minimal hybrid automata

FORMATS'05 Proceedings of the Third international conference on Formal Modeling and Analysis of Timed Systems
Reachability-time games on timed automata

ICALP'07 Proceedings of the 34th international conference on Automata, Languages and Programming

Quantified Score

Hi-index	0.00

Visualization

Abstract

We study price-per-reward games on hybrid automata with strong resets. They generalise priced games previously studied and have applications in scheduling. We obtain decidability results by a translation to a novel class of finite graphs with price and reward information, and games assigned to edges. The cost and reward of following an edge are determined by the outcome of the edge game that is assigned to it.