An axiomatization of PCTL

    Research output: Contribution to journalArticlepeer-review

    26 Citations (Scopus)


    A sound and complete axiomatization for a computation tree logic with past operators, PCTL*, is given. The logic extends the standard branching time logic CTL* of R-generable models via the use of past-time operators and semantics based on a finite linear past leading back from any point in any fullpath. Furthermore, the valid formulas of CTL* are also valid in PCTL*. The past operators allow us to avoid use of any unusual rules of inference such as the ugly automata-motivated AA rule which is part of the existing complete axiomatization for CTL*. (c) 2005 Elsevier Inc. All rights reserved.
    Original languageEnglish
    Pages (from-to)72-119
    JournalInformation and Computation
    Publication statusPublished - 2005


    Dive into the research topics of 'An axiomatization of PCTL'. Together they form a unique fingerprint.

    Cite this