Synthesising succinct strategies in safety and reachability games

被引：3
|
作者：
Geeraerts, Gilles [1 ]
Goossens, Joël [1 ]
Stainer, Amélie [1 ]
机构：
[1] Université libre de Bruxelles, Département d’Informatique, Brussels, Belgium
来源：
Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) | 2014年 / 8762卷
关键词：
Model checking - Computers;
D O I：
10.1007/978-3-319-11439-2_8
中图分类号：
学科分类号：
摘要：
引用
收藏
页码：98 / 111
相关论文
共 50 条
  • [31] On the Complexity of Counter Reachability Games
    Reichert, Julien
    REACHABILITY PROBLEMS, 2013, 8169 : 196 - 208
  • [32] Equilibria in Quantitative Reachability Games
    Brihaye, Thomas
    Bruyere, Veronique
    De Pril, Julie
    COMPUTER SCIENCE - THEORY AND APPLICATIONS, 2010, 6072 : 72 - 83
  • [33] Reachability Games on Automatic Graphs
    Neider, Daniel
    IMPLEMENTATION AND APPLICATION OF AUTOMATA, 2011, 6482 : 222 - 230
  • [34] On relevant equilibria in reachability games
    Brihaye, Thomas
    Bruyere, Veronique
    Goeminne, Aline
    Thomasset, Nathan
    JOURNAL OF COMPUTER AND SYSTEM SCIENCES, 2021, 119 : 211 - 230
  • [35] On Higher-Order Reachability Games Vs May Reachability
    Asada, Kazuyuki
    Katsura, Hiroyuki
    Kobayashi, Naoki
    REACHABILITY PROBLEMS, RP 2022, 2022, 13608 : 108 - 124
  • [36] Efficient Network Reachability Analysis using a Succinct Control Plane Representation
    Fayaz, Seyed K.
    Sharma, Tushar
    Fogel, Ari
    Mahajan, Ratul
    Millstein, Todd
    Sekar, Vyas
    Varghese, George
    PROCEEDINGS OF OSDI'16: 12TH USENIX SYMPOSIUM ON OPERATING SYSTEMS DESIGN AND IMPLEMENTATION, 2016, : 217 - 232
  • [37] Succinct progress measures for solving parity games
    Jurdzinski, Marcin
    Lazic, Ranko
    2017 32ND ANNUAL ACM/IEEE SYMPOSIUM ON LOGIC IN COMPUTER SCIENCE (LICS), 2017,
  • [38] On the complexity of succinct zero-sum games
    Fortnow, L
    Impagliazzo, R
    Kabanets, V
    Umans, C
    TWENTIETH ANNUAL IEEE CONFERENCE ON COMPUTATIONAL COMPLEXITY, PROCEEDINGS, 2005, : 323 - 332
  • [39] On the complexity of succinct zero-sum games
    Fortnow, Lance
    Impagliazzo, Russell
    Kabanets, Valentine
    Umans, Christopher
    COMPUTATIONAL COMPLEXITY, 2008, 17 (03) : 353 - 376
  • [40] On the Complexity of Succinct Zero-Sum Games
    Lance Fortnow
    Russell Impagliazzo
    Valentine Kabanets
    Christopher Umans
    computational complexity, 2008, 17 : 353 - 376
12345