Model checking discounted temporal properties

Temporal logic is two-valued: formulas are interpreted as either true or false. When applied to the analysis of stochastic systems, or systems with imprecise formal models, temporal logic is therefore fragile: even small changes in the model can lead to opposite truth values for a specification. We present a generalization of the branching-time logic CTL which achieves robustness with respect to model perturbations by giving a quantitative interpretation to predicates and logical operators, and by discounting the importance of events according to how late they occur. In every state, the value of a formula is a real number in the interval [0,1], where 1 corresponds to truth and 0 to falsehood. The boolean operators and and or are replaced by min and max, the path quantifiers ∃ and ¬ determine sup and inf over all paths from a given state, and the temporal operators ♦ and □ specify sup and inf over a given path; a new operator averages all values along a path. Furthermore, all path operators are discounted by a parameter that can be chosen to give more weight to states that are closer to the beginning of the path.We interpret the resulting logic DCTL over transition systems, Markov chains, and Markov decision processes. We present two semantics for DCTL: a path semantics, inspired by the standard interpretation of state and path formulas in CTL, and a fixpoint semantics, inspired by the µ-calculus evaluation of CTL formulas. We show that, while these semantics coincide for CTL, they differ for DCTL, and we provide model-checking algorithms for both semantics.

[1]  Annabelle McIver.  Reasoning about efficiency within a probabilistic µ-calculus , 1999, Electron. Notes Theor. Comput. Sci..

[2]  J. Kemeny,et al.  Denumerable Markov chains , 1969 .

[3]  Michael Huth,et al.  Quantitative analysis and model checking , 1997, Proceedings of Twelfth Annual IEEE Symposium on Logic in Computer Science.

[4]  Edmund M. Clarke,et al.  Model Checking , 1999, Handbook of Automated Reasoning.

[5]  Ugo Montanari,et al.  Quantitative ?-calculus and CTL Based on Constraint Semirings , 2004, QAPL.

[6]  Dimitri P. Bertsekas,et al.  Dynamic Programming and Optimal Control, Two Volume Set , 1995 .

[7]  M. Paterson,et al.  The omplexity of mean payo games ? , 2022 .

[8]  J. Filar,et al.  Competitive Markov Decision Processes , 1996 .

[9]  Dimitri P. Bertsekas,et al.  Dynamic Programming and Optimal Control, Two Volume Set , 1995 .

[10]  Christel Baier,et al.  Model Checking Continuous-Time Markov Chains by Transient Analysis , 2000, CAV.

[11]  David Williams,et al.  Probability with Martingales , 1991, Cambridge mathematical textbooks.

[12]  Andrea Bianco,et al.  Model Checking of Probabalistic and Nondeterministic Systems , 1995, FSTTCS.

[13]  Uri Zwick,et al.  The Complexity of Mean Payoff Games on Graphs , 1996, Theor. Comput. Sci..

[14]  Clifford Stein,et al.  Introduction to Algorithms, 2nd edition. , 2001 .

[15]  Thomas A. Henzinger,et al.  Discounting the Future in Systems Theory , 2003, ICALP.

[16]  Dexter Kozen,et al.  A probabilistic PDL , 1983, J. Comput. Syst. Sci..

[17]  Thomas A. Henzinger,et al.  Model checking discounted temporal properties , 2005, Theoretical Computer Science.

[18]  R. Blute,et al.  Bisimulation for Labeled Markov Processes , 1997 .

[19]  Ronald L. Rivest,et al.  Introduction to Algorithms , 1990 .

[20]  Annabelle McIver,et al.  Games, Probability and the Quantitative µ-Calculus qMµ , 2002, LPAR.

[21]  Abbas Edalat,et al.  Bisimulation for Labelled Markov Processes , 2002, Inf. Comput..

[22]  Jerzy A. Filar,et al.  Competitive Markov decision processes : with 57 illustrations , 1997 .

[23]  Hans A. Hansson.  Time and probability in formal design of distributed systems , 1991, DoCS.

[24]  Marta Z. Kwiatkowska,et al.  Model checking for probability and time: from theory to practice , 2003, 18th Annual IEEE Symposium of Logic in Computer Science, 2003. Proceedings..

[25]  A. McIver,et al.  Games , probability and the quantitative μ-calculus , 2002 .

[26]  Zohar Manna,et al.  Formal verification of probabilistic systems , 1997 .

[27]  Luca de Alfaro,et al.  Quantitative Verification and Control via the Mu-Calculus , 2003, CONCUR.

[28]  Zohar Manna,et al.  The Temporal Logic of Reactive and Concurrent Systems , 1991, Springer New York.

[29]  Robin Milner,et al.  On Observing Nondeterminism and Concurrency , 1980, ICALP.