Zobrazeno 1 - 5
of 5
pro vyhledávání: '"Damien Busatto-Gaston"'
Publikováno v:
Logical Methods in Computer Science, Vol Volume 19, Issue 1 (2023)
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 ex
Externí odkaz:
https://doaj.org/article/f87dd068c7794c72bd2691d7343d7ad0
Autor:
Shibashis Guha, Dhiman Chakraborty, Damien Busatto-Gaston, Guillermo A. Pérez, Jean-François Raskin
Publikováno v:
Quantitative Evaluation of Systems ISBN: 9783030851712
QEST
QEST
In this paper, we investigate the combination of synthesis, model-based learning, and online sampling techniques to obtain safe and near-optimal schedulers for a preemptible task scheduling problem. Our algorithms can handle Markov decision processes
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::e3b51c6dca5f5c5059c36cf8dddeed98
https://doi.org/10.1007/978-3-030-85172-9_13
https://doi.org/10.1007/978-3-030-85172-9_13
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 ex
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::624f1a0e7a8103bef1eda3068058aa9f
Publikováno v:
CAV 2019-31st International Conference on Computer Aided Verification
CAV 2019-31st International Conference on Computer Aided Verification, Jul 2019, New-York, United States. pp.572-590, ⟨10.1007/978-3-030-25540-4_33⟩
Computer Aided Verification ISBN: 9783030255398
CAV (1)
CAV 2019-31st International Conference on Computer Aided Verification, Jul 2019, New-York, United States. pp.572-590, ⟨10.1007/978-3-030-25540-4_33⟩
Computer Aided Verification ISBN: 9783030255398
CAV (1)
We solve in a purely symbolic way the robust controller synthesis problem in timed automata with Buchi acceptance conditions. The goal of the controller is to play according to an accepting lasso of the automaton, while resisting to timing perturbati
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::3e4bd50e04655c4eb9ff4b8ff6a828a8
https://hal.archives-ouvertes.fr/hal-02264083/file/paper.pdf
https://hal.archives-ouvertes.fr/hal-02264083/file/paper.pdf
Publikováno v:
Lecture Notes in Computer Science
20th International Conference on Foundations of Software Science and Computation Structures (FoSSaCS'17)
20th International Conference on Foundations of Software Science and Computation Structures (FoSSaCS'17), Apr 2017, Uppsala, Sweden. pp.162-178, ⟨10.1007/978-3-662-54458-7_10⟩
Lecture Notes in Computer Science ISBN: 9783662544570
FoSSaCS
20th International Conference on Foundations of Software Science and Computation Structures (FoSSaCS'17)
20th International Conference on Foundations of Software Science and Computation Structures (FoSSaCS'17), Apr 2017, Uppsala, Sweden. pp.162-178, ⟨10.1007/978-3-662-54458-7_10⟩
Lecture Notes in Computer Science ISBN: 9783662544570
FoSSaCS
International audience; Weighted timed games are played by two players on a timed automaton equipped with weights: one player wants to minimise the accumulated weight while reaching a target, while the other has an opposite objective. Used in a react
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::076236b2d7ee09d0345519b6118585e1
https://hal.science/hal-01522546
https://hal.science/hal-01522546