A Probabilistic Temporal Logic with Frequency Operators and Its Model Checking
Abstract
Probabilistic Computation Tree Logic (PCTL) and Continuous Stochastic Logic (CSL) are often used to describe specifications of probabilistic properties for discrete time and continuous time, respectively. In PCTL and CSL, the possibility of executions satisfying some temporal properties can be quantitatively represented by the probabilistic extension of the path quantifiers in their basic Computation Tree Logic (CTL), however, path formulae of them are expressed via the same operators in CTL. For this reason, both of them cannot represent formulae with quantitative temporal properties, such as those of the form "some properties hold to more than 80% of time points (in a certain bounded interval) on the path." In this paper, we introduce a new temporal operator which expressed the notion of frequency of events, and define probabilistic frequency temporal logic (PFTL) based on CTL\star. As a result, we can easily represent the temporal properties of behavior in probabilistic systems. However, it is difficult to develop a model checker for the full PFTL, due to rich expressiveness. Accordingly, we develop a modelchecking algorithm for the CTLlike fragment of PFTL against finitestate Markov chains, and an approximate modelchecking algorithm for the bounded Linear Temporal Logic (LTL) like fragment of PFTL against countablestate Markov chains.
 Publication:

arXiv eprints
 Pub Date:
 November 2011
 DOI:
 10.48550/arXiv.1111.3111
 arXiv:
 arXiv:1111.3111
 Bibcode:
 2011arXiv1111.3111T
 Keywords:

 Computer Science  Logic in Computer Science
 EPrint:
 In Proceedings INFINITY 2011, arXiv:1111.2678