Automated Verification Techniques for Probabilistic Systems

被引:0
|
作者
Forejt, Vojtech [1 ]
Kwiatkowska, Marta [1 ]
Norman, Gethin [2 ]
Parker, David [1 ]
机构
[1] Univ Oxford, Comp Lab, Parks Rd, Oxford OX1 3QD, England
[2] Univ Glasgow, Sch Comp Sci, Glasgow G12 8RZ, Lanark, Scotland
基金
英国工程与自然科学研究理事会;
关键词
MARKOV DECISION-PROCESSES; MODEL CHECKING; ABSTRACTION-REFINEMENT; SYMMETRY REDUCTION; STOCHASTIC GAMES; REACHABILITY; COUNTEREXAMPLES; LOGIC;
D O I
暂无
中图分类号
TP31 [计算机软件];
学科分类号
081202 ; 0835 ;
摘要
This tutorial provides an introduction to probabilistic model checking, a technique for automatically verifying quantitative properties of probabilistic systems. We focus on Markov decision processes (MDPs), which model both stochastic and nondeterministic behaviour. We describe methods to analyse a wide range of their properties, including specifications in the temporal logics PCTL and LTL, probabilistic safety properties and cost- or reward-based measures. We also discuss multi-objective probabilistic model checking, used to analyse trade-offs between several different quantitative properties. Applications of the techniques in this tutorial include performance and dependability analysis of networked systems, communication protocols and randomised distributed algorithms. Since such systems often comprise several components operating in parallel, we also cover techniques for compositional modelling and verification of multi-component probabilistic systems. Finally, we describe three large case studies which illustrate practical applications of the various methods discussed in the tutorial.
引用
收藏
页码:53 / 113
页数:61
相关论文
共 50 条
  • [21] PRISM: A tool for automatic verification of probabilistic systems
    Hinton, Andrew
    Kwiatkowska, Marta
    Norman, Gethin
    Parker, David
    TOOLS AND ALGORITHMS FOR THE CONSTRUCTION AND ANALYSIS OF SYSTEMS, PROCEEDINGS, 2006, 3920 : 441 - 444
  • [22] Towards quantitative verification of probabilistic transition systems
    van Breugel, F
    Worrell, J
    AUTOMATA LANGUAGES AND PROGRAMMING, PROCEEDING, 2001, 2076 : 421 - 432
  • [23] Verification and control of partially observable probabilistic systems
    Norman, Gethin
    Parker, David
    Zou, Xueyi
    REAL-TIME SYSTEMS, 2017, 53 (03) : 354 - 402
  • [24] Complexity of Verification of Nondeterministic Probabilistic Multiagent Systems
    Valiev, M. K.
    Dekhtyar, M. I.
    AUTOMATIC CONTROL AND COMPUTER SCIENCES, 2011, 45 (07) : 390 - 396
  • [25] Assume-Guarantee Verification for Probabilistic Systems
    Kwiatkowska, Marta
    Norman, Gethin
    Parker, David
    Qui, Hongyang
    TOOLS AND ALGORITHMS FOR THE CONSTRUCTION AND ANALYSIS OF SYSTEMS, PROCEEDINGS, 2010, 6015 : 23 - +
  • [26] A probabilistic approach to automatic verification of concurrent systems
    Tronci, E
    Della Penna, G
    Intrigila, B
    Zilli, MV
    APSEC 2001: EIGHTH ASIA-PACIFIC SOFTWARE ENGINEERING CONFERENCE, PROCEEDINGS, 2001, : 317 - 324
  • [27] Verification and control of partially observable probabilistic systems
    Gethin Norman
    David Parker
    Xueyi Zou
    Real-Time Systems, 2017, 53 : 354 - 402
  • [28] Probabilistic verification for "black-box" systems
    Younes, HLS
    COMPUTER AIDED VERIFICATION< PROCEEDINGS, 2005, 3576 : 253 - 265
  • [29] Automated account reconciliation using probabilistic and statistical techniques
    Chew, Peter A.
    Robinson, David G.
    INTERNATIONAL JOURNAL OF ACCOUNTING AND INFORMATION MANAGEMENT, 2012, 20 (04) : 322 - +
  • [30] Automated techniques for higher-order program verification
    1600, National Institute of Informatics, 2-1-2 Hitotsubashi, Chiyoda-ku, Tokyo, 101-8430, Japan