Zobrazeno 1 - 10
of 21
pro vyhledávání: '"Mickael Randour"'
Publikováno v:
Logical Methods in Computer Science, Vol Volume 20, Issue 3 (2024)
In two-player games on graphs, the simplest possible strategies are those that can be implemented without any memory. These are called positional strategies. In this paper, we characterize objectives recognizable by deterministic B\"uchi automata (a
Externí odkaz:
https://doaj.org/article/454507a3c3354b06bf46c7c822f9e07f
Publikováno v:
Logical Methods in Computer Science, Vol Volume 19, Issue 4 (2023)
We study stochastic zero-sum games on graphs, which are prevalent tools to model decision-making in presence of an antagonistic opponent in a random environment. In this setting, an important question is the one of strategy complexity: what kinds of
Externí odkaz:
https://doaj.org/article/95a2799723e64aa5b931b8730bb0ee4e
Publikováno v:
TheoretiCS, Vol Volume 2 (2023)
We consider zero-sum games on infinite graphs, with objectives specified as sets of infinite words over some alphabet of colors. A well-studied class of objectives is the one of $\omega$-regular objectives, due to its relation to many natural problem
Externí odkaz:
https://doaj.org/article/d6f84a6ab3a445f0a877ca55e6453466
Publikováno v:
Logical Methods in Computer Science, Vol Volume 18, Issue 1 (2022)
For decades, two-player (antagonistic) games on graphs have been a framework of choice for many important problems in theoretical computer science. A notorious one is controller synthesis, which can be rephrased through the game-theoretic metaphor as
Externí odkaz:
https://doaj.org/article/c49da1dd2b4c42db88563c7cb050ce6b
Publikováno v:
Logical Methods in Computer Science, Vol Volume 16, Issue 4 (2020)
The window mechanism was introduced by Chatterjee et al. to strengthen classical game objectives with time bounds. It permits to synthesize system controllers that exhibit acceptable behaviors within a configurable time frame, all along their infinit
Externí odkaz:
https://doaj.org/article/abd3b0297aa84cbea89954013fa27159
Publikováno v:
Electronic Proceedings in Theoretical Computer Science, Vol 277, Iss Proc. GandALF 2018, Pp 250-264 (2018)
In this paper, we are interested in the synthesis of schedulers in double-weighted Markov decision processes, which satisfy both a percentile constraint over a weighted reachability condition, and a quantitative constraint on the expected value of a
Externí odkaz:
https://doaj.org/article/3cae925e086c4b859920046a2abb280f
Publikováno v:
Electronic Proceedings in Theoretical Computer Science, Vol 226, Iss Proc. GandALF 2016, Pp 135-148 (2016)
Classical objectives in two-player zero-sum games played on graphs often deal with limit behaviors of infinite plays: e.g., mean-payoff and total-payoff in the quantitative setting, or parity in the qualitative one (a canonical way to encode omega-re
Externí odkaz:
https://doaj.org/article/8900d6f698884de2b00757e4ef07ce79
Publikováno v:
Electronic Proceedings in Theoretical Computer Science, Vol 193, Iss Proc. GandALF 2015, Pp 1-15 (2015)
Two-player quantitative zero-sum games provide a natural framework to synthesize controllers with performance guarantees for reactive systems within an uncontrollable environment. Classical settings include mean-payoff games, where the objective is t
Externí odkaz:
https://doaj.org/article/a87a5c255e5a463ba2d933f1030f3835
Publikováno v:
Electronic Proceedings in Theoretical Computer Science, Vol 146, Iss Proc. SR 2014, Pp 1-8 (2014)
When reasoning about the strategic capabilities of an agent, it is important to consider the nature of its adversaries. In the particular context of controller synthesis for quantitative specifications, the usual problem is to devise a strategy for a
Externí odkaz:
https://doaj.org/article/532a33e24a904a4e91e8c5dfdc081016
Publikováno v:
Lecture Notes in Computer Science ISBN: 9783031158384
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::d4a935afcb287cf2ef1f29c6bfa36006
https://hdl.handle.net/2318/1881421
https://hdl.handle.net/2318/1881421
