Playing Stochastically in Weighted Timed Games to Emulate Memory

Weighted timed games are two-player zero-sum games played in a timed automaton equipped with integer weights. We consider optimal reachability objectives, in which one of the players, that we call Min, wants to reach a target location while minimising the cumulated weight. While knowing if Min has a...

Ausführliche Beschreibung

Bibliographische Detailangaben

Veröffentlicht in:	Logical methods in computer science Jg. 21, Issue 1; H. 1
Hauptverfasser:	Monmege, Benjamin, Parreaux, Julie, Reynier, Pierre-Alain
Format:	Journal Article
Sprache:	Englisch
Veröffentlicht:	Logical Methods in Computer Science Association 26.02.2025 Logical Methods in Computer Science e.V
Schlagworte:	Computation and Language Computer Science computer science - computer science and game theory Computer Science and Game Theory Formal Languages and Automata Theory Logic in Computer Science
ISSN:	1860-5974, 1860-5974
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!