Keeping a Crowd Safe: On the Complexity of Parameterized Verification

被引：22
|
作者：
Esparza, Javier [1 ]
机构：
[1] Tech Univ Munich, Fac Comp Sci, Munich, Germany
来源：
31ST INTERNATIONAL SYMPOSIUM ON THEORETICAL ASPECTS OF COMPUTER SCIENCE (STACS 2014) | 2014年 / 25卷
关键词：
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 条
  • [41] Parameterized Complexity of the Firefighter Problem
    Bazgan, Cristina
    Chopin, Morgan
    Fellows, Michael R.
    ALGORITHMS AND COMPUTATION, 2011, 7074 : 643 - +
  • [42] The Parameterized Complexity of Stabbing Rectangles
    Michael Dom
    Michael R. Fellows
    Frances A. Rosamond
    Somnath Sikdar
    Algorithmica, 2012, 62 : 564 - 594
  • [43] Parameterized Complexity of Paired Domination
    Andreev, Nikita
    Bliznets, Ivan
    Kundu, Madhumita
    Saurabh, Saket
    Tripathi, Vikash
    Verma, Shaily
    COMBINATORIAL ALGORITHMS, IWOCA 2024, 2024, 14764 : 523 - 536
  • [44] Parameterized complexity and approximation algorithms
    Marx, Daniel
    COMPUTER JOURNAL, 2008, 51 (01): : 60 - 78
  • [45] The parameterized complexity of counting problems
    Flum, J
    Grohe, M
    FOCS 2002: 43RD ANNUAL IEEE SYMPOSIUM ON FOUNDATIONS OF COMPUTER SCIENCE, PROCEEDINGS, 2002, : 538 - 547
  • [46] The Parameterized Complexity of Network Microaggregation
    Blazej, Vaclav
    Ganian, Robert
    Knop, Dusan
    Pokorny, Jan
    Schierreich, Simon
    Simonov, Kirill
    THIRTY-SEVENTH AAAI CONFERENCE ON ARTIFICIAL INTELLIGENCE, VOL 37 NO 5, 2023, : 6262 - 6270
  • [47] Counting Problems in Parameterized Complexity
    Zhang, Chihao
    Chen, Yijia
    TSINGHUA SCIENCE AND TECHNOLOGY, 2014, 19 (04) : 410 - 420
  • [48] On the Parameterized Complexity of Pooling Design
    Cheng, Yongxi
    Du, Ding-Zhu
    Ko, Ker-I
    Lin, Guohui
    JOURNAL OF COMPUTATIONAL BIOLOGY, 2009, 16 (11) : 1529 - 1537
  • [49] The parameterized complexity of counting problems
    Flum, J
    Grohe, M
    SIAM JOURNAL ON COMPUTING, 2004, 33 (04) : 892 - 922
  • [50] Parameterized complexity of determinant and permanent
    Singh, Ranveer
    THEORETICAL COMPUTER SCIENCE, 2020, 845 : 50 - 58
12345