期刊
IEEE TRANSACTIONS ON SOFTWARE ENGINEERING
卷 37, 期 1, 页码 126-141出版社
IEEE COMPUTER SOC
DOI: 10.1109/TSE.2010.80
关键词
Probabilistic model checking; linear temporal logic; Discrete Time Markov Chain; pharmacokinetics
资金
- CNS [05-09321]
- US Office of Naval Research under US Department of Defense MURI [N0014-020100715]
We propose a new probabilistic temporal logic, iLTL, which captures properties of systems whose state can be represented by probability mass functions (pmfs). Using iLTL, we can specify reachability to a state (i.e., a pmf), as well as properties representing the aggregate (expected) behavior of a system. We then consider a class of systems whose transitions are governed by a Markov Chain-in this case, the set of states a system may be in is specified by the transitions of pmfs from all potential initial states to the final state. We then provide a model checking algorithm to check iLTL properties of such systems. Unlike existing model checking techniques, which either compute the portions of the computational paths that satisfy a specification or evaluate properties along a single path of pmf transitions, our model checking technique enables us to do a complete analysis on the expected behaviors of large-scale systems. Desirable system parameters may also be found as a counterexample of a negated goal. Finally, we illustrate the usefulness of iLTL model checking by means of two examples: assessing software reliability and ensuring the results of administering a drug.
作者
我是这篇论文的作者
点击您的名字以认领此论文并将其添加到您的个人资料中。
推荐
暂无数据