{
  "id": "0910.4738",
  "version": "v1",
  "published": "2009-10-25T14:59:37.000Z",
  "updated": "2009-10-25T14:59:37.000Z",
  "title": "On the connections between PCTL and Dynamic Programming",
  "authors": [
    "Federico Ramponi",
    "Debasish Chatterjee",
    "Sean Summers",
    "John Lygeros"
  ],
  "comment": "Submitted",
  "journal": "HSCC Stockholm, 2010, pages 253-262",
  "doi": "10.1145/1755952.1755988",
  "categories": [
    "math.OC",
    "cs.SY"
  ],
  "abstract": "Probabilistic Computation Tree Logic (PCTL) is a well-known modal logic which has become a standard for expressing temporal properties of finite-state Markov chains in the context of automated model checking. In this paper, we give a definition of PCTL for noncountable-space Markov chains, and we show that there is a substantial affinity between certain of its operators and problems of Dynamic Programming. After proving some uniqueness properties of the solutions to the latter, we conclude the paper with two examples to show that some recovery strategies in practical applications, which are naturally stated as reach-avoid problems, can be actually viewed as particular cases of PCTL formulas.",
  "revisions": [
    {
      "version": "v1",
      "updated": "2009-10-25T14:59:37.000Z"
    }
  ],
  "analyses": {
    "subjects": [
      "60J10"
    ],
    "keywords": [
      "dynamic programming",
      "connections",
      "probabilistic computation tree logic",
      "finite-state markov chains",
      "noncountable-space markov chains"
    ],
    "tags": [
      "journal article"
    ],
    "publication": {
      "publisher": "ACM",
      "journal": "Commun. ACM"
    },
    "note": {
      "typesetting": "TeX",
      "pages": 0,
      "language": "en",
      "license": "arXiv",
      "status": "editable",
      "adsabs": "2009arXiv0910.4738R"
    }
  }
}