Reachability games with relaxed energy constraints

被引：0
|
作者：
Hélouët, Loïc [1 ]
Markey, Nicolas [1 ]
Raha, Ritam [2 ,3 ]
机构：
[1] Inria & CNRS & Univ. Rennes, France
[2] Univ. Antwerpen, Belgium
[3] LaBRI, Univ. Bordeaux, France
来源：
Information and Computation | 2022年 / 285卷
关键词：
921.6 Numerical Methods;
D O I：
暂无
中图分类号：
学科分类号：
摘要：
29
引用
收藏
相关论文
共 50 条
  • [1] Reachability Games with Relaxed Energy Constraints
    Helouet, Loic
    Markey, Nicolas
    Raha, Ritam
    ELECTRONIC PROCEEDINGS IN THEORETICAL COMPUTER SCIENCE, 2019, (305): : 17 - 33
  • [2] Reachability games with relaxed energy constraints
    Helouet, Loic
    Markey, Nicolas
    Raha, Ritam
    INFORMATION AND COMPUTATION, 2022, 285
  • [3] REACHABILITY SWITCHING GAMES
    Fearnley, John
    Gairing, Martin
    Mnich, Matthias
    Savani, Rahul
    LOGICAL METHODS IN COMPUTER SCIENCE, 2021, 17 (02) : 10:1 - 10:29
  • [4] Concurrent reachability games
    de Alfaro, L
    Henzinger, TA
    Kupferman, O
    39TH ANNUAL SYMPOSIUM ON FOUNDATIONS OF COMPUTER SCIENCE, PROCEEDINGS, 1998, : 564 - 575
  • [5] Concurrent reachability games
    de Alfaro, Luca
    Henzinger, Thomas A.
    Kupferman, Orna
    THEORETICAL COMPUTER SCIENCE, 2007, 386 (03) : 188 - 217
  • [6] Quantum Reachability Games
    Liu, Wuniu
    Li, Zhihui
    Li, Yongming
    IEEE TRANSACTIONS ON EMERGING TOPICS IN COMPUTATIONAL INTELLIGENCE, 2024,
  • [7] On reachability games of ordinal length
    Cristau, Julien
    Horn, Florian
    SOFSEM 2008: THEORY AND PRACTICE OF COMPUTER SCIENCE, 2008, 4910 : 211 - 221
  • [8] Reachability in Stochastic Timed Games
    Bouyer, Patricia
    Forejt, Vojtech
    AUTOMATA, LANGUAGES AND PROGRAMMING, PT II, PROCEEDINGS, 2009, 5556 : 103 - +
  • [9] On The Complexity of Counter Reachability Games
    Reichert, Julien
    FUNDAMENTA INFORMATICAE, 2016, 143 (3-4) : 415 - 436
  • [10] On relevant equilibria in reachability games
    Brihaye, Thomas
    Bruyère, Véronique
    Goeminne, Aline
    Thomasset, Nathan
    Journal of Computer and System Sciences, 2021, 119 : 211 - 230
12345