Automated Analysis of Probabilistic Infinite-state Systems

被引:0
|
作者
Wojtczak, Dominik [1 ]
机构
[1] Univ Liverpool, Liverpool, Merseyside, England
关键词
D O I
暂无
中图分类号
TP301 [理论、方法];
学科分类号
081202 ;
摘要
引用
收藏
页码:85 / +
页数:4
相关论文
共 50 条
  • [1] Deciding probabilistic bisimilarity over infinite-state probabilistic systems
    Brazdil, Tomas
    Kucera, Antonin
    Strazovsky, Oldrich
    ACTA INFORMATICA, 2008, 45 (02) : 131 - 154
  • [2] Deciding probabilistic bisimilarity over infinite-state probabilistic systems
    Tomáš Brázdil
    Antonín Kučera
    Oldřich Stražovský
    Acta Informatica, 2008, 45 : 131 - 154
  • [3] Deciding probabilistic bisimilarity over infinite-state probabilistic systems
    Brázdil, T
    Kucera, A
    Strazovsky, O
    CONCUR 2004 - CONCURRENCY THEORY, PROCEEDINGS, 2004, 3170 : 193 - 208
  • [4] Analysis of self-stabilization for infinite-state systems
    Yen, HC
    SEVENTH IEEE INTERNATIONAL CONFERENCE ON ENGINEERING OF COMPLEX COMPUTER SYSTEMS, PROCEEDINGS, 2001, : 240 - 248
  • [5] Extensible Proof Systems for Infinite-State Systems
    Cleaveland, Rance
    Keiren, Jeroen J. A.
    ACM TRANSACTIONS ON COMPUTATIONAL LOGIC, 2024, 25 (01)
  • [6] LTL falsification in infinite-state systems
    Cimatti, Alessandro
    Griggio, Alberto
    Magnago, Enrico
    INFORMATION AND COMPUTATION, 2022, 289
  • [7] Set-based analysis of reactive infinite-state systems
    Charatonik, W
    Podelski, A
    TOOLS AND ALGORITHMS FOR THE CONSTRUCTION AND ANALYSIS OF SYSTEMS, 1998, 1384 : 358 - 375
  • [8] Analysis of Infinite-State Graph Transformation Systems by Cluster Abstraction
    Backes, Peter
    Reineke, Jan
    VERIFICATION, MODEL CHECKING, AND ABSTRACT INTERPRETATION (VMCAI 2015), 2015, 8931 : 135 - 152
  • [9] Decidability analysis of self-stabilization for infinite-state systems
    Yen, Hsu-Chun
    Yu, Lien-Po
    FUNDAMENTA INFORMATICAE, 2006, 70 (04) : 387 - 402
  • [10] Languages, rewriting systems, and verification of infinite-state systems
    Bouajjani, A
    AUTOMATA LANGUAGES AND PROGRAMMING, PROCEEDING, 2001, 2076 : 24 - 39