Keeping a Crowd Safe: On the Complexity of Parameterized Verification

被引:22
|
作者
Esparza, Javier [1 ]
机构
[1] Tech Univ Munich, Fac Comp Sci, Munich, Germany
关键词
Parameterized verification; automata theory; MINIMAL COVERABILITY SET; SYSTEMS;
D O I
10.4230/LIPIcs.STACS.2014.1
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
We survey some results on the automatic verification of parameterized programs without identities. These are systems composed of arbitrarily many components, all of them running exactly the same finite-state program. We discuss the complexity of deciding that no component reaches an unsafe state. The note is addressed at theoretical computer scientists in general.
引用
收藏
页码:1 / 10
页数:10
相关论文
共 50 条
  • [1] Parameterized complexity of safe set
    Belmonte R.
    Hanaka T.
    Katsikarelis I.
    Lampis M.
    Ono H.
    Otachi Y.
    Journal of Graph Algorithms and Applications, 2020, 24 (03) : 215 - 245
  • [2] Parameterized Complexity of Safe Set
    Belmonte, Rémy
    Hanaka, Tesshu
    Katsikarelis, Ioannis
    Lampis, Michael
    Ono, Hirotaka
    Otachi, Yota
    Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 2019, 11485 LNCS : 38 - 49
  • [3] Parameterized complexity of safe set
    Belmonte, Rémy
    Hanaka, Tesshu
    Katsikarelis, Ioannis
    Lampis, Michael
    Ono, Hirotaka
    Otachi, Yota
    arXiv, 2019,
  • [4] Parameterized Complexity Results for 1-safe Petri Nets
    Praveen, M.
    Lodaya, Kamal
    CONCUR 2011: CONCURRENCY THEORY, 2011, 6901 : 358 - 372
  • [5] Parameterized verification
    Parosh A. Abdulla
    Giorgio Delzanno
    International Journal on Software Tools for Technology Transfer, 2016, 18 : 469 - 473
  • [6] Parameterized verification
    Abdulla, Parosh A.
    Delzanno, Giorgio
    INTERNATIONAL JOURNAL ON SOFTWARE TOOLS FOR TECHNOLOGY TRANSFER, 2016, 18 (05) : 469 - 473
  • [7] Beyond parameterized verification
    Bozzano, M
    Delzanno, G
    TOOLS AND ALGORITHMS FOR THE CONSTRUCTION AND ANAYLSIS OF SYSTEMS, PROCEEDINGS, 2002, 2280 : 221 - 235
  • [8] Decidability of parameterized verification
    Bloem, Roderick
    Khalimov, Ayrat
    Jacobs, Swen
    Konnov, Igor
    Veith, Helmut
    Widder, Josef
    Rubin, Sasha
    Synthesis Lectures on Distributed Computing Theory, 2015, 6 (01): : 1 - 170
  • [9] Verification of parameterized protocols
    Baukus, K
    Lakhnech, Y
    Stahl, K
    JOURNAL OF UNIVERSAL COMPUTER SCIENCE, 2001, 7 (02): : 141 - 158
  • [10] Keeping it safe
    Tebo, MG
    ABA JOURNAL, 2005, 91 : 40 - 45