Zobrazeno 1 - 10
of 10
pro vyhledávání: '"Steen Vester"'
Publikováno v:
Electronic Proceedings in Theoretical Computer Science, Vol 146, Iss Proc. SR 2014, Pp 49-55 (2014)
We investigate a model for representing large multiplayer games, which satisfy strong symmetry properties. This model is made of multiple copies of an arena; each player plays in his own arena, and can partially observe what the other players do. The
Externí odkaz:
https://doaj.org/article/f90474f694414c3a9f59367d3cb0b30c
Autor:
Steen Vester
Publikováno v:
Electronic Proceedings in Theoretical Computer Science, Vol 119, Iss Proc. GandALF 2013, Pp 194-207 (2013)
Model-checking the alternating-time temporal logics ATL and ATL* with incomplete information is undecidable for perfect recall semantics. However, when restricting to memoryless strategies the model-checking problem becomes decidable. In this paper w
Externí odkaz:
https://doaj.org/article/3ff5cf54eb084ad4bbaa3788ba2c3452
Publikováno v:
Information and Computation
Information and Computation, 2017, 254, pp.238-258. ⟨10.1016/j.ic.2016.10.010⟩
Information and Computation, Elsevier, 2017, 254, pp.238-258. ⟨10.1016/j.ic.2016.10.010⟩
Bouyer, P, Markey, N & Vester, S 2017, ' Nash Equilibria in Symmetric Graph Games with Partial Observation ', Information and Computation, vol. 254, no. 2, pp. 238–258 . https://doi.org/10.1016/j.ic.2016.10.010
Information and Computation, 2017, 254, pp.238-258. ⟨10.1016/j.ic.2016.10.010⟩
Information and Computation, Elsevier, 2017, 254, pp.238-258. ⟨10.1016/j.ic.2016.10.010⟩
Bouyer, P, Markey, N & Vester, S 2017, ' Nash Equilibria in Symmetric Graph Games with Partial Observation ', Information and Computation, vol. 254, no. 2, pp. 238–258 . https://doi.org/10.1016/j.ic.2016.10.010
International audience; We investigate a model for representing large multiplayer games, which satisfy strong symmetry properties. This model is made of multiple copies of an arena; each player plays in his own arena, and can partially observe what t
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::117edf9b5a94b601802f4f1e3df26d76
https://hal.science/hal-01633415
https://hal.science/hal-01633415
Publikováno v:
Lecture Notes in Computer Science ISBN: 9783662496299
FoSSaCS
FoSSaCS
We introduce a formalism modelling communication of distributed agents strictly in continuous-time. Within this framework, we study the problem of synthesising local strategies for individual agents such that a specified set of goal states is reached
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::39fab5b87a607c97c6ce10bf47ddec4f
https://doi.org/10.1007/978-3-662-49630-5_21
https://doi.org/10.1007/978-3-662-49630-5_21
Publikováno v:
Kasting, P F S, Hansen, M R & Vester, S 2016, Synthesis of railway-signaling plans using reachability games . in 28th Symposium on the Implementation and Application of Functional Programming Languages, . vol. Part F127410, Association for Computing Machinery, Acm Int. Conf. Proc. Ser, 28th Symposium on the Implementation and Application of Functional Programming Languages, Leuven, Belgium, 31/08/2016 . https://doi.org/10.1145/3064899.3064908
IFL
IFL
In this work, we show the feasibility of using functional programming (more specifically F#) in connection with gamebased methods for synthesis of correct-by-construction controllers (also called signaling plans) for railway networks. This is a massi
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::3a269f44f037218baa3333b051d1e13e
https://orbit.dtu.dk/en/publications/e591054d-4906-4725-9918-f85d1f9b99d1
https://orbit.dtu.dk/en/publications/e591054d-4906-4725-9918-f85d1f9b99d1
Autor:
Steen Vester
Publikováno v:
LICS
We introduce the novel notion of winning cores in parity games and develop a deterministic polynomial-time under-approximation algorithm for solving parity games based on winning core approximation. Underlying this algorithm are a number properties a
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::573adc06e883481971a952b0f019039b
Publikováno v:
Annals of Mathematics and Artificial Intelligence. 61:297-307
We describe the approach used to develop the multi-agent system of herders that competed as the Jason-DTU team at the Multi-Agent Programming Contest 2010. We also participated in 2009 with a system developed in the agent-oriented programming languag
Autor:
Steen Vester
Publikováno v:
Automated Technology for Verification and Analysis ISBN: 9783319249520
ATVA
ATVA
We study the complexity of the model-checking problem for the branching-time logic \(\text {CTL}^*\) and the alternating-time temporal logics \(\text {ATL}/\text {ATL}^*\) in one-counter processes and one-counter games respectively. The complexity is
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::fdef2985dff504d5d755fe6908dc3eb3
https://doi.org/10.1007/978-3-319-24953-7_27
https://doi.org/10.1007/978-3-319-24953-7_27
Publikováno v:
Electronic Proceedings in Theoretical Computer Science
Electronic Proceedings in Theoretical Computer Science, Vol 146, Iss Proc. SR 2014, Pp 49-55 (2014)
SR
Electronic Proceedings in Theoretical Computer Science, Vol 146, Iss Proc. SR 2014, Pp 49-55 (2014)
SR
We investigate a model for representing large multiplayer games, which satisfy strong symmetry properties. This model is made of multiple copies of an arena; each player plays in his own arena, and can partially observe what the other players do. The
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::63cdeeb6f55d75812738c9a2e354c33e
Autor:
Steen Vester, Nicolas Markey
Publikováno v:
Automated Technology for Verification and Analysis ISBN: 9783319119359
ATVA
Lecture Notes in Computer Science
ATVA
Lecture Notes in Computer Science
Symmetry reductions have been applied extensively for the verification of finite-state concurrent systems and hardware designs using model-checking of temporal logics such as LTL, CTL and CTLs, as well as real-time and probabilistic-system model-chec
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::b1bca832d919e13cf4f788f33fe2425d
https://doi.org/10.1007/978-3-319-11936-6_21
https://doi.org/10.1007/978-3-319-11936-6_21