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
来源
FORMAL METHODS FOR ETERNAL NETWORKED SOFTWARE SYSTEMS, SFM 2011 | 2011年 / 6659卷
基金
英国工程与自然科学研究理事会;
关键词
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 条
  • [41] Safe Networked Robotics With Probabilistic Verification
    Narasimhan, Sai Shankar
    Bhat, Sharachchandra
    Chinchali, Sandeep P.
    IEEE ROBOTICS AND AUTOMATION LETTERS, 2024, 9 (03) : 2917 - 2924
  • [42] Automated Verification of Linearization Policies
    Abdulla, Parosh Aziz
    Jonsson, Bengt
    Cong Quy Trinh
    STATIC ANALYSIS, (SAS 2016), 2016, 9837 : 61 - 83
  • [43] Automated Verification of Virtualized Infrastructures
    Bleikertz, Soren
    Gross, Thomas
    Modersheim, Sebastian
    PROCEEDINGS OF THE 3RD ACM WORKSHOP CLOUD COMPUTING SECURITY WORKSHOP (CCSW'11), 2011, : 47 - 58
  • [44] Parametrized verification diagrams: temporal verification of symmetric parametrized concurrent systems
    Sanchez, Alejandro
    Sanchez, Cesar
    ANNALS OF MATHEMATICS AND ARTIFICIAL INTELLIGENCE, 2017, 80 (3-4) : 249 - 282
  • [45] Model Checking for Probabilistic Multiagent Systems
    Fu, Chen
    Turrini, Andrea
    Huang, Xiaowei
    Song, Lei
    Feng, Yuan
    Zhang, Li-Jun
    JOURNAL OF COMPUTER SCIENCE AND TECHNOLOGY, 2023, 38 (05) : 1162 - 1186
  • [46] QUALITATIVE LOGICS AND EQUIVALENCES FOR PROBABILISTIC SYSTEMS
    Chatterjee, Krishnendu
    De Alfaro, Luca
    Faella, Marco
    Legay, Axel
    LOGICAL METHODS IN COMPUTER SCIENCE, 2009, 5 (02)
  • [47] Symbolic Verification and Strategy Synthesis for Linearly-Priced Probabilistic Timed Automata
    Kwiatkowska, Marta
    Norman, Gethin
    Parker, David
    MODELS, ALGORITHMS, LOGICS AND TOOLS: ESSAYS DEDICATED TO KIM GULDSTRAND LARSEN ON THE OCCASION OF HIS 60TH BIRTHDAY, 2017, 10460 : 289 - 309
  • [48] Model checking epistemic-probabilistic logic using probabilistic interpreted systems
    Wan, Wei
    Bentahar, Jamal
    Ben Hamza, Abdessamad
    KNOWLEDGE-BASED SYSTEMS, 2013, 50 : 279 - 295
  • [49] Probabilistic Formal Verification of the SATS Concept of Operation
    Sardar, Muhammad Usama
    Afaq, Nida
    Hoque, Khaza Anuarul
    Johnson, Taylor T.
    Hasan, Osman
    NASA FORMAL METHODS, NFM 2016, 2016, 9690 : 191 - 205
  • [50] Modeling and verification of trust and reputation systems
    Aldini, Alessandro
    SECURITY AND COMMUNICATION NETWORKS, 2015, 8 (16) : 2933 - 2946