Sublogics of a branching time logic of robustness

John McCabe-Dansted, Clare Dixon, Tim French, Mark Reynolds

Research output: Contribution to journalArticle

Abstract

In this paper we study sublogics of RoCTL*, a recently proposed logic for specifying robustness. RoCTL* allows specifying robustness in terms of properties that are robust to a certain number of failures. RoCTL* is an extension of the branching time logic CTL* which in turn extends CTL by removing the requirement that temporal operators be paired with path quantifiers. In this paper we consider three sublogics of RoCTL*. We present a tableau for RoBCTL*, a bundled variant of RoCTL* that allows fairness constraints to be placed on allowable paths. We then examine two CTL-like restrictions of CTL*. Pair-RoCTL* requires a temporal operator to be paired with a path quantifier; we show that Pair-RoCTL* is as hard to reason about as the full CTL*. State-RoCTL* is restricted to State formulas, and we show that there is a linear truth preserving translation of State-RoCTL into CTL, allowing State-RoCTL to be reasoned about as efficiently as CTL.

Original languageEnglish
Pages (from-to)126-160
Number of pages35
JournalInformation and Computation
Volume266
DOIs
Publication statusPublished - 1 Jun 2019

Fingerprint

Branching
Logic
Quantifiers
Robustness
Path
Tableau
Operator
Fairness
Restriction
Requirements
Truth

Cite this

McCabe-Dansted, John ; Dixon, Clare ; French, Tim ; Reynolds, Mark. / Sublogics of a branching time logic of robustness. In: Information and Computation. 2019 ; Vol. 266. pp. 126-160.
@article{f0ad578020af4877aedab63f0669ef00,
title = "Sublogics of a branching time logic of robustness",
abstract = "In this paper we study sublogics of RoCTL*, a recently proposed logic for specifying robustness. RoCTL* allows specifying robustness in terms of properties that are robust to a certain number of failures. RoCTL* is an extension of the branching time logic CTL* which in turn extends CTL by removing the requirement that temporal operators be paired with path quantifiers. In this paper we consider three sublogics of RoCTL*. We present a tableau for RoBCTL*, a bundled variant of RoCTL* that allows fairness constraints to be placed on allowable paths. We then examine two CTL-like restrictions of CTL*. Pair-RoCTL* requires a temporal operator to be paired with a path quantifier; we show that Pair-RoCTL* is as hard to reason about as the full CTL*. State-RoCTL* is restricted to State formulas, and we show that there is a linear truth preserving translation of State-RoCTL into CTL, allowing State-RoCTL to be reasoned about as efficiently as CTL.",
keywords = "Bundles, CTL, RoCTL*, Tableau",
author = "John McCabe-Dansted and Clare Dixon and Tim French and Mark Reynolds",
year = "2019",
month = "6",
day = "1",
doi = "10.1016/j.ic.2019.02.003",
language = "English",
volume = "266",
pages = "126--160",
journal = "Information and Computation",
issn = "0890-5401",
publisher = "Elsevier",

}

Sublogics of a branching time logic of robustness. / McCabe-Dansted, John; Dixon, Clare; French, Tim; Reynolds, Mark.

In: Information and Computation, Vol. 266, 01.06.2019, p. 126-160.

Research output: Contribution to journalArticle

TY - JOUR

T1 - Sublogics of a branching time logic of robustness

AU - McCabe-Dansted, John

AU - Dixon, Clare

AU - French, Tim

AU - Reynolds, Mark

PY - 2019/6/1

Y1 - 2019/6/1

N2 - In this paper we study sublogics of RoCTL*, a recently proposed logic for specifying robustness. RoCTL* allows specifying robustness in terms of properties that are robust to a certain number of failures. RoCTL* is an extension of the branching time logic CTL* which in turn extends CTL by removing the requirement that temporal operators be paired with path quantifiers. In this paper we consider three sublogics of RoCTL*. We present a tableau for RoBCTL*, a bundled variant of RoCTL* that allows fairness constraints to be placed on allowable paths. We then examine two CTL-like restrictions of CTL*. Pair-RoCTL* requires a temporal operator to be paired with a path quantifier; we show that Pair-RoCTL* is as hard to reason about as the full CTL*. State-RoCTL* is restricted to State formulas, and we show that there is a linear truth preserving translation of State-RoCTL into CTL, allowing State-RoCTL to be reasoned about as efficiently as CTL.

AB - In this paper we study sublogics of RoCTL*, a recently proposed logic for specifying robustness. RoCTL* allows specifying robustness in terms of properties that are robust to a certain number of failures. RoCTL* is an extension of the branching time logic CTL* which in turn extends CTL by removing the requirement that temporal operators be paired with path quantifiers. In this paper we consider three sublogics of RoCTL*. We present a tableau for RoBCTL*, a bundled variant of RoCTL* that allows fairness constraints to be placed on allowable paths. We then examine two CTL-like restrictions of CTL*. Pair-RoCTL* requires a temporal operator to be paired with a path quantifier; we show that Pair-RoCTL* is as hard to reason about as the full CTL*. State-RoCTL* is restricted to State formulas, and we show that there is a linear truth preserving translation of State-RoCTL into CTL, allowing State-RoCTL to be reasoned about as efficiently as CTL.

KW - Bundles

KW - CTL

KW - RoCTL

KW - Tableau

UR - http://www.scopus.com/inward/record.url?scp=85063027506&partnerID=8YFLogxK

U2 - 10.1016/j.ic.2019.02.003

DO - 10.1016/j.ic.2019.02.003

M3 - Article

VL - 266

SP - 126

EP - 160

JO - Information and Computation

JF - Information and Computation

SN - 0890-5401

ER -