{"year":"2005","publisher":"Elsevier","intvolume":"       345","publist_id":"80","volume":345,"date_created":"2018-12-11T12:09:49Z","quality_controlled":0,"title":"Model checking discounted temporal properties","status":"public","month":"11","date_updated":"2021-01-12T08:00:37Z","type":"journal_article","author":[{"last_name":"De Alfaro","first_name":"Luca","full_name":"de Alfaro, Luca"},{"last_name":"Faella","first_name":"Marco","full_name":"Faella, Marco"},{"last_name":"Henzinger","first_name":"Thomas A","id":"40876CD8-F248-11E8-B48F-1D18A9856A87","full_name":"Thomas Henzinger","orcid":"0000−0002−2985−7724"},{"last_name":"Majumdar","first_name":"Ritankar","full_name":"Majumdar, Ritankar S"},{"full_name":"Stoelinga, Mariëlle","first_name":"Mariëlle","last_name":"Stoelinga"}],"day":"21","publication":"Theoretical Computer Science","doi":"10.1016/j.tcs.2005.07.033","page":"139 - 170","_id":"4625","abstract":[{"text":"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.\n\nWe 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.","lang":"eng"}],"extern":1,"citation":{"short":"L. De Alfaro, M. Faella, T.A. Henzinger, R. Majumdar, M. Stoelinga, Theoretical Computer Science 345 (2005) 139–170.","ama":"De Alfaro L, Faella M, Henzinger TA, Majumdar R, Stoelinga M. Model checking discounted temporal properties. <i>Theoretical Computer Science</i>. 2005;345(1):139-170. doi:<a href=\"https://doi.org/10.1016/j.tcs.2005.07.033\">10.1016/j.tcs.2005.07.033</a>","apa":"De Alfaro, L., Faella, M., Henzinger, T. A., Majumdar, R., &#38; Stoelinga, M. (2005). Model checking discounted temporal properties. <i>Theoretical Computer Science</i>. Elsevier. <a href=\"https://doi.org/10.1016/j.tcs.2005.07.033\">https://doi.org/10.1016/j.tcs.2005.07.033</a>","ista":"De Alfaro L, Faella M, Henzinger TA, Majumdar R, Stoelinga M. 2005. Model checking discounted temporal properties. Theoretical Computer Science. 345(1), 139–170.","chicago":"De Alfaro, Luca, Marco Faella, Thomas A Henzinger, Ritankar Majumdar, and Mariëlle Stoelinga. “Model Checking Discounted Temporal Properties.” <i>Theoretical Computer Science</i>. Elsevier, 2005. <a href=\"https://doi.org/10.1016/j.tcs.2005.07.033\">https://doi.org/10.1016/j.tcs.2005.07.033</a>.","ieee":"L. De Alfaro, M. Faella, T. A. Henzinger, R. Majumdar, and M. Stoelinga, “Model checking discounted temporal properties,” <i>Theoretical Computer Science</i>, vol. 345, no. 1. Elsevier, pp. 139–170, 2005.","mla":"De Alfaro, Luca, et al. “Model Checking Discounted Temporal Properties.” <i>Theoretical Computer Science</i>, vol. 345, no. 1, Elsevier, 2005, pp. 139–70, doi:<a href=\"https://doi.org/10.1016/j.tcs.2005.07.033\">10.1016/j.tcs.2005.07.033</a>."},"date_published":"2005-11-21T00:00:00Z","publication_status":"published","issue":"1"}