Fairness with EXPTIME bundled CTL tableau

John Mccabe-Dansted; Mark Reynolds

doi:10.1109/TIME.2014.22

Fairness with EXPTIME bundled CTL tableau

John Mccabe-Dansted, Mark Reynolds

Research output: Chapter in Book/Conference paper › Conference paper › peer-review

3 Citations (Scopus)

Abstract

© 2014 IEEE. The Computational Tree Logic (CTL) has difficulty expressing some fairness properties. One solution is to instead use the syntactic extension Full CTL (CTL) or the more limited CTL+ extension, but either way the satisfiability problem then becomes doubly exponential. We discuss how the limit closure axiom of CTL makes representing fairness difficult. Removing this restriction results in Bundled CTL (BCTL). We present a singly exponential tableau for BCTL and show how BCTL can represent fairness properties in a similar way to CTL. We further show how to combine the BCTL tableau with an existing BCTL tableau, to give the full expressivity of BCTL while retaining a singly exponential running time when the number of BCTL operators is limited.

Original language	English
Title of host publication	21st International Symposium on Temporal Representation and Reasoning
Place of Publication	United States
Publisher	IEEE, Institute of Electrical and Electronics Engineers
Pages	164-173
ISBN (Print)	9781479942275
DOIs	https://doi.org/10.1109/TIME.2014.22
Publication status	Published - 2014
Event	21st International Symposium on Temporal Representation and Reasoning, TIME 2014 - Italy, Verona, Italy Duration: 8 Sept 2014 → 10 Sept 2014 Conference number: 108964

Conference

Conference	21st International Symposium on Temporal Representation and Reasoning, TIME 2014
Abbreviated title	TIME 2014
Country/Territory	Italy
City	Verona
Period	8/09/14 → 10/09/14

Access to Document

10.1109/TIME.2014.22

Cite this

@inproceedings{d7bc40bf34954741a240e69c3c705150,

title = "Fairness with EXPTIME bundled CTL tableau",

abstract = "{\textcopyright} 2014 IEEE. The Computational Tree Logic (CTL) has difficulty expressing some fairness properties. One solution is to instead use the syntactic extension Full CTL (CTL) or the more limited CTL+ extension, but either way the satisfiability problem then becomes doubly exponential. We discuss how the limit closure axiom of CTL makes representing fairness difficult. Removing this restriction results in Bundled CTL (BCTL). We present a singly exponential tableau for BCTL and show how BCTL can represent fairness properties in a similar way to CTL. We further show how to combine the BCTL tableau with an existing BCTL tableau, to give the full expressivity of BCTL while retaining a singly exponential running time when the number of BCTL operators is limited.",

author = "John Mccabe-Dansted and Mark Reynolds",

year = "2014",

doi = "10.1109/TIME.2014.22",

language = "English",

isbn = "9781479942275",

pages = "164--173",

booktitle = "21st International Symposium on Temporal Representation and Reasoning",

publisher = "IEEE, Institute of Electrical and Electronics Engineers",

address = "United States",

note = "21st International Symposium on Temporal Representation and Reasoning, TIME 2014<br/>, TIME 2014 ; Conference date: 08-09-2014 Through 10-09-2014",

}

Mccabe-Dansted, J & Reynolds, M 2014, Fairness with EXPTIME bundled CTL tableau. in 21st International Symposium on Temporal Representation and Reasoning. IEEE, Institute of Electrical and Electronics Engineers, United States, pp. 164-173, 21st International Symposium on Temporal Representation and Reasoning, TIME 2014
, Verona, Italy, 8/09/14. https://doi.org/10.1109/TIME.2014.22

TY - GEN

T1 - Fairness with EXPTIME bundled CTL tableau

AU - Mccabe-Dansted, John

AU - Reynolds, Mark

N1 - Conference code: 108964

PY - 2014

Y1 - 2014

N2 - © 2014 IEEE. The Computational Tree Logic (CTL) has difficulty expressing some fairness properties. One solution is to instead use the syntactic extension Full CTL (CTL) or the more limited CTL+ extension, but either way the satisfiability problem then becomes doubly exponential. We discuss how the limit closure axiom of CTL makes representing fairness difficult. Removing this restriction results in Bundled CTL (BCTL). We present a singly exponential tableau for BCTL and show how BCTL can represent fairness properties in a similar way to CTL. We further show how to combine the BCTL tableau with an existing BCTL tableau, to give the full expressivity of BCTL while retaining a singly exponential running time when the number of BCTL operators is limited.

AB - © 2014 IEEE. The Computational Tree Logic (CTL) has difficulty expressing some fairness properties. One solution is to instead use the syntactic extension Full CTL (CTL) or the more limited CTL+ extension, but either way the satisfiability problem then becomes doubly exponential. We discuss how the limit closure axiom of CTL makes representing fairness difficult. Removing this restriction results in Bundled CTL (BCTL). We present a singly exponential tableau for BCTL and show how BCTL can represent fairness properties in a similar way to CTL. We further show how to combine the BCTL tableau with an existing BCTL tableau, to give the full expressivity of BCTL while retaining a singly exponential running time when the number of BCTL operators is limited.

U2 - 10.1109/TIME.2014.22

DO - 10.1109/TIME.2014.22

M3 - Conference paper

SN - 9781479942275

SP - 164

EP - 173

BT - 21st International Symposium on Temporal Representation and Reasoning

PB - IEEE, Institute of Electrical and Electronics Engineers

CY - United States

T2 - 21st International Symposium on Temporal Representation and Reasoning, TIME 2014<br/>

Y2 - 8 September 2014 through 10 September 2014

ER -

Fairness with EXPTIME bundled CTL tableau

Abstract

Conference

Access to Document

Fingerprint

Cite this