Authors:
Norihiro Kamide
1
and
Noriko Yamamoto
2
Affiliations:
1
Teikyo University, Faculty of Science and Engineering, Department of Information and Electronic Engineering, Toyosatodai 1-1, Utsunomiya-shi, Tochigi 320-8551, Japan
;
2
Teikyo University, Graduate School of Science and Engineering, Division of Information Science, Toyosatodai 1-1, Utsunomiya, Tochigi 320-8551, Japan
Keyword(s):
Probabilistic Temporal Logic, Inconsistency-tolerant Temporal Logic, Hierarchical Temporal Logic, Probabilistic Model Checking, Inconsistency-tolerant Model Checking, Hierarchical Model Checking.
Abstract:
An inconsistency-tolerant hierarchical probabilistic computation tree logic (IHpCTL) is developed to establish a new extended model checking paradigm referred to as IHpCTL model checking, which is intended to verify randomized, open, large, and complex concurrent systems. The proposed IHpCTL is constructed based on several previously established extensions of the standard probabilistic temporal logic known as probabilistic computation tree logic (pCTL), which is widely used for probabilistic model checking. IHpCTL is shown to be embeddable into pCTL and is relatively decidable with respect to pCTL. This means that the decidability of pCTL with certain probability measures implies the decidability of IHpCTL. The results indicate that we can effectively reuse the previously proposed pCTL model-checking algorithms for IHpCTL model checking.