Efficient model checking of the stochastic logic CSLTA

被引:4
|
作者
Amparore, E. G. [1 ]
Donatelli, S. [1 ]
机构
[1] Univ Torino, Dipartimento Informat, Turin, Italy
关键词
Stochastic model checking; CSLTA; Markov regenerative process (MRgP); Path properties; Timed automata; PETRI NETS; MARKOV; ALGORITHMS;
D O I
10.1016/j.peva.2018.03.002
中图分类号
TP3 [计算技术、计算机技术];
学科分类号
0812 ;
摘要
CSLTA is a stochastic temporal logic for continuous-time Markov chains (CTMCs) which includes the well known CSL. CSLTA properties are defined using single-clock Deterministic Timed Automata (DTAs). The model checking of CSLTA amounts, in the worst-case, to the computation of the steady-state probability of a non-ergodic Markov Regenerative Process (MRgP) of size of vertical bar CTMC vertical bar x vertical bar DTA vertical bar. Various MRgP solution techniques are available in the literature, and we shall use the Component Method, which computes the steady state distribution of a non-ergodic MRgP by recognizing that, in an MRgP, certain components may actually be solved at a lower cost (same cost as that of a CTMC solution). Unfortunately the technique still requires the construction of the whole MRgP. This paper applies the Component Method to devise various CSLTA model checking algorithms, forward and backward. The Component Method can be applied to the MRgP constructed from the CTMC and the DTA, which is a rather straightforward application of the method, or to the MRgP constructed from the CTMC and the region graph of the DTA, a construction that takes into account the timed reachability in the DTA and that allows, in most cases, a significant reduction in the considered MRgP states. In both cases the whole MRgP is built. The primary result of this paper is instead to devise a model checking algorithm in which the component identification is based only on the region graph of the DTA. The MRgP components are generated "on-the-fly", when needed, starting from the components of the region graph; they are then solved with the cheapest available solution method. Once a component has been solved it is discarded, therefore the whole MRgP is never constructed nor solved. The on-the-fly algorithm is "adaptive": the time and space used depend on the formula, and, when the DTA actually expresses a CSL property, the algorithm complexity reduces, seamlessly, to that of standard CSL model checking algorithms. (C) 2018 Elsevier B.V. All rights reserved.
引用
收藏
页码:1 / 34
页数:34
相关论文
共 50 条
  • [21] Model checking linear logic specifications
    Bozzano, M
    DelZanno, G
    Martelli, M
    [J]. THEORY AND PRACTICE OF LOGIC PROGRAMMING, 2004, 4 : 573 - 619
  • [22] UTP and Temporal Logic Model Checking
    Anderson, Hugh
    Ciobanu, Gabriel
    Freitas, Leo
    [J]. UNIFYING THEORIES OF PROGRAMMING, 2010, 5713 : 22 - +
  • [23] Model Checking Using Description Logic
    Ben-David, Shoham
    Trefler, Richard
    Weddell, Grant
    [J]. JOURNAL OF LOGIC AND COMPUTATION, 2010, 20 (01) : 111 - 131
  • [24] Model checking interval temporal logic
    Zhang, Hai-Bin
    Duan, Zhen-Hua
    [J]. Xi'an Dianzi Keji Daxue Xuebao/Journal of Xidian University, 2009, 36 (02): : 338 - 342
  • [25] Model Checking a Logic for True Concurrency
    Baldan, Paolo
    Padoan, Tommaso
    [J]. ACM TRANSACTIONS ON COMPUTATIONAL LOGIC, 2020, 21 (04)
  • [26] Model checking distributed temporal logic
    Dionisio, Francisco
    Ramos, Jaime
    Subtil, Fernando
    Vigano, Luca
    [J]. LOGIC JOURNAL OF THE IGPL, 2024,
  • [27] MCK: Model checking the logic of knowledge
    Gammie, P
    van der Meyden, R
    [J]. COMPUTER AIDED VERIFICATION, 2004, 3114 : 479 - 483
  • [28] Techniques for temporal logic model checking
    Deharbe, David
    [J]. REFINEMENT TECHNIQUES IN SOFTWARE ENGINEERING, 2006, 3167 : 315 - 367
  • [29] A logic of probability with decidable model checking
    Beauquier, Daniele
    Rabinovich, Alexander
    Slissenko, Anatol
    [J]. JOURNAL OF LOGIC AND COMPUTATION, 2006, 16 (04) : 461 - 487
  • [30] Model Checking for Coalition Announcement Logic
    Galimullin, Rustam
    Alechina, Natasha
    van Ditmarsch, Hans
    [J]. KI 2018: ADVANCES IN ARTIFICIAL INTELLIGENCE, 2018, 11117 : 11 - 23