Optimal controller synthesis for timed systems

Weighted timed games are zero-sum games played by two players on a timed automaton equipped with weights, where one player wants to minimise the cumulative weight while reaching a target. Used in a reactive synthesis perspective, this quantitative extension of timed games allows one to measure the q...

Celý popis

Podrobná bibliografia

Vydané v:	Logical methods in computer science Ročník 19, Issue 1
Hlavní autori:	Busatto-Gaston, Damien, Monmege, Benjamin, Reynier, Pierre-Alain
Médium:	Journal Article
Jazyk:	English
Vydavateľské údaje:	Logical Methods in Computer Science Association 15.03.2023 Logical Methods in Computer Science e.V
Predmet:	Computer Science computer science - computer science and game theory computer science - logic in computer science Computer Science and Game Theory d.2.4 Formal Languages and Automata Theory Logic in Computer Science computational game theory timed automata weighted timed games quantitative constraints
ISSN:	1860-5974, 1860-5974
On-line prístup:	Získať plný text
Tagy:	Pridať tag Žiadne tagy, Buďte prvý, kto otaguje tento záznam!