受强制性开放获取政策约束的文章 - Veronique Bruyere了解详情
无法在其他位置公开访问的文章：2 篇
Synthesis of equilibria in infinite-duration games on graphs
V Bruyère
ACM SIGLOG News 8 (2), 4-29, 2021
强制性开放获取政策： European Commission
A Game-Theoretic Approach for the Synthesis of Complex Systems
V Bruyère
Conference on Computability in Europe, 52-63, 2022
强制性开放获取政策： National Fund for Scientific Research, Belgium
可在其他位置公开访问的文章：15 篇
Meet your expectations with guarantees: Beyond worst-case synthesis in quantitative games
V Bruyère, E Filiot, M Randour, JF Raskin
Information and Computation 254, 259-295, 2017
强制性开放获取政策： European Commission
Secure equilibria in weighted games
V Bruyère, N Meunier, JF Raskin
Proceedings of the Joint Meeting of the Twenty-Third EACSL Annual Conference …, 2014
强制性开放获取政策： National Fund for Scientific Research, Belgium, European Commission
The complexity of subgame perfect equilibria in quantitative reachability games
T Brihaye, V Bruyère, A Goeminne, JF Raskin, M Van den Bogaard
Logical Methods in Computer Science 16, 2020
强制性开放获取政策： Research Foundation (Flanders), European Commission
On the existence of weak subgame perfect equilibria
V Bruyère, S Le Roux, A Pauly, JF Raskin
Foundations of Software Science and Computation Structures: 20th …, 2017
强制性开放获取政策： European Commission
On the complexity of heterogeneous multidimensional quantitative games
V Bruyère, Q Hautem, JF Raskin
arXiv preprint arXiv:1511.08334, 2015
强制性开放获取政策： National Fund for Scientific Research, Belgium, European Commission
Constrained Existence Problem for Weak Subgame Perfect Equilibria with -Regular Boolean Objectives
T Brihaye, V Bruyère, A Goeminne, JF Raskin
arXiv preprint arXiv:1809.03888, 2018
强制性开放获取政策： National Fund for Scientific Research, Belgium, Research Foundation …
Stackelberg-pareto synthesis
V Bruyère, B Fievet, JF Raskin, C Tamines
ACM Transactions on Computational Logic 25 (2), 1-49, 2024
强制性开放获取政策： European Commission
On equilibria in quantitative games with reachability/safety objectives
T Brihaye, V Bruyère, J De Pril
Theory of Computing Systems 54, 150-189, 2014
强制性开放获取政策： National Fund for Scientific Research, Belgium
On relevant equilibria in reachability games
T Brihaye, V Bruyere, A Goeminne, N Thomasset
Reachability Problems: 13th International Conference, RP 2019, Brussels …, 2019
强制性开放获取政策： National Fund for Scientific Research, Belgium, European Commission
Partial solvers for generalized parity games
V Bruyère, GA Pérez, JF Raskin, C Tamines
Reachability Problems: 13th International Conference, RP 2019, Brussels …, 2019
强制性开放获取政策： European Commission
Learning realtime one-counter automata
V Bruyère, GA Pérez, G Staquet
International Conference on Tools and Algorithms for the Construction and …, 2022
强制性开放获取政策： National Fund for Scientific Research, Belgium, Research Foundation (Flanders)
Quantitative reachability stackelberg-pareto synthesis is NEXPTIME-complete
T Brihaye, V Bruyère, G Reghem
International Conference on Reachability Problems, 70-84, 2023
强制性开放获取政策： National Fund for Scientific Research, Belgium
Automata with timers
V Bruyère, GA Pérez, G Staquet, FW Vaandrager
International Conference on Formal Modeling and Analysis of Timed Systems, 33-49, 2023
强制性开放获取政策： National Fund for Scientific Research, Belgium, Research Foundation …
Validating Streaming JSON Documents with Learned VPAs
V Bruyère, GA Pérez, G Staquet
International Conference on Tools and Algorithms for the Construction and …, 2023
强制性开放获取政策： National Fund for Scientific Research, Belgium, Research Foundation (Flanders)
Symblicit algorithms for mean-payoff and shortest path in monotonic Markov decision processes
A Bohy, V Bruyère, JF Raskin, N Bertrand
Acta Informatica 54 (6), 545-587, 2017
强制性开放获取政策： National Fund for Scientific Research, Belgium, European Commission
出版信息和资助信息由计算机程序自动确定