Fairness with EXPTIME bundled CTL tableau

John Mccabe-Dansted, Mark Reynolds

    Research output: Chapter in Book/Conference paperConference paperpeer-review

    3 Citations (Scopus)


    © 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 languageEnglish
    Title of host publication21st International Symposium on Temporal Representation and Reasoning
    Place of PublicationUnited States
    PublisherIEEE, Institute of Electrical and Electronics Engineers
    ISBN (Print)9781479942275
    Publication statusPublished - 2014
    Event21st International Symposium on Temporal Representation and Reasoning, TIME 2014
    - Italy, Verona, Italy
    Duration: 8 Sep 201410 Sep 2014
    Conference number: 108964


    Conference21st International Symposium on Temporal Representation and Reasoning, TIME 2014
    Abbreviated titleTIME 2014


    Dive into the research topics of 'Fairness with EXPTIME bundled CTL tableau'. Together they form a unique fingerprint.

    Cite this