Model checking of infinite state space Markov chains by stochastic bounds

被引:0
作者
Ben Mamoun, Mouad [1 ]
Pekergin, Nihal [2 ]
机构
[1] Univ Mohammed 5, Dept Math & Informat, BP 1014, Rabat, Morocco
[2] Univ Paris Est, LACL, F-94010 Creteil, France
来源
ANALYTICAL AND STOCHASTIC MODELING TECHNIQUES AND APPLICATIONS, PROCEEDINGS | 2008年 / 5055卷
关键词
D O I
暂无
中图分类号
TP301 [理论、方法];
学科分类号
081202 ;
摘要
In this paper, we discuss how to check Probablistic Computation Tree Logic (PCTL) logic operators over infinite state Discrete Time Markov Chains (DTMC). Probabilistic model checking has been largely applied over finite state space Markov models. Recently infinite state models have been considered when underlying infinite Markov models have special structures. We propose to consider finite state models providing bounds on transient and the stationary distributions in the sense of the <=(st) stochastic order to check infinite state models. The operators of the PCTL logic are then checked by considering these finite bounding models.
引用
收藏
页码:264 / +
页数:3
相关论文
共 22 条
[1]  
Abu-Amsha O, 1998, 4 INFORMS C TEL BOC
[2]  
ANDOVA S, 2003, FORMAL MODELLING ANA
[3]  
Aziz A., 2000, ACM Transactions on Computational Logic, V1, P162, DOI [/10.1145/343369.343402, DOI 10.1145/343369.343402]
[4]  
Baier C, 2002, LECT NOTES COMPUT SC, V2459, P261
[5]   Model-checking algorithms for continuous-time Markov chains [J].
Baier, C ;
Haverkort, B ;
Hermanns, H ;
Katoen, JP .
IEEE TRANSACTIONS ON SOFTWARE ENGINEERING, 2003, 29 (06) :524-541
[6]  
BENMAMOUN M, 2006, QEST, P189
[7]  
Bianco A., 1995, LNCS, V1026
[8]  
D'Argenio Pedro R., 2001, PROCESS ALGEBRA PROB
[9]  
Doisy M., 1992, THESIS U PAU PAYS AD
[10]  
DOISY M, 2000, J APPL MATH DECISION, V4, P39, DOI DOI 10.1155/S1173912600000031