An axiomatization of PCTL

Mark Reynolds

doi:10.1016/j.ic.2005.03.005

An axiomatization of PCTL

Mark Reynolds

Research output: Contribution to journal › Article › peer-review

26 Citations (Scopus)

Abstract

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 language	English
Pages (from-to)	72-119
Journal	Information and Computation
Volume	201
DOIs	https://doi.org/10.1016/j.ic.2005.03.005
Publication status	Published - 2005

Access to Document

10.1016/j.ic.2005.03.005

Cite this

@article{633c5f22d593449d8aa2086ee931aa6b,

title = "An axiomatization of PCTL",

abstract = "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.",

author = "Mark Reynolds",

year = "2005",

doi = "10.1016/j.ic.2005.03.005",

language = "English",

volume = "201",

pages = "72--119",

journal = "Information and Computation",

issn = "0890-5401",

publisher = "Elsevier",

}

TY - JOUR

T1 - An axiomatization of PCTL

AU - Reynolds, Mark

PY - 2005

Y1 - 2005

N2 - 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.

AB - 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.

U2 - 10.1016/j.ic.2005.03.005

DO - 10.1016/j.ic.2005.03.005

M3 - Article

VL - 201

SP - 72

EP - 119

JO - Information and Computation

JF - Information and Computation

SN - 0890-5401

ER -

An axiomatization of PCTL

Abstract

Access to Document

Fingerprint

Cite this