Towards a CTL*Tableau

Mark Reynolds

Towards a CTL*Tableau

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

Abstract

We present a sound, complete and relatively straightforward tableau method for deciding valid formulas in the propositional version of the bundled (or suffix and fusion closed) computation tree logic BCTL*. This proves that BCTL* is decidable. It is also moderately useful to have a tableau available for a reasonably expressive branching time temporal logic. However, the main interest in this should be that it leads us closer to being able to devise a tableau-based technique for theorem-proving in the important full computational tree logic CTL*.

Original language	English
Title of host publication	Not available
Place of Publication	Berlin
Publisher	Springer
Pages	384-395
Volume	3821
ISBN (Print)	9783540304951
Publication status	Published - 2005
Event	Towards a CTL*Tableau - Hyderabad, India Duration: 1 Jan 2005 → …

Conference

Conference	Towards a CTL*Tableau
Period	1/01/05 → …

Cite this

@inproceedings{5acf48efb4024c54a946870f95dcfd1a,

title = "Towards a CTL*Tableau",

abstract = "We present a sound, complete and relatively straightforward tableau method for deciding valid formulas in the propositional version of the bundled (or suffix and fusion closed) computation tree logic BCTL*. This proves that BCTL* is decidable. It is also moderately useful to have a tableau available for a reasonably expressive branching time temporal logic. However, the main interest in this should be that it leads us closer to being able to devise a tableau-based technique for theorem-proving in the important full computational tree logic CTL*.",

author = "Mark Reynolds",

year = "2005",

language = "English",

isbn = "9783540304951",

volume = "3821",

pages = "384--395",

booktitle = "Not available",

publisher = "Springer",

address = "Netherlands",

note = "Towards a CTL*Tableau ; Conference date: 01-01-2005",

}

TY - GEN

T1 - Towards a CTL*Tableau

AU - Reynolds, Mark

PY - 2005

Y1 - 2005

N2 - We present a sound, complete and relatively straightforward tableau method for deciding valid formulas in the propositional version of the bundled (or suffix and fusion closed) computation tree logic BCTL*. This proves that BCTL* is decidable. It is also moderately useful to have a tableau available for a reasonably expressive branching time temporal logic. However, the main interest in this should be that it leads us closer to being able to devise a tableau-based technique for theorem-proving in the important full computational tree logic CTL*.

AB - We present a sound, complete and relatively straightforward tableau method for deciding valid formulas in the propositional version of the bundled (or suffix and fusion closed) computation tree logic BCTL*. This proves that BCTL* is decidable. It is also moderately useful to have a tableau available for a reasonably expressive branching time temporal logic. However, the main interest in this should be that it leads us closer to being able to devise a tableau-based technique for theorem-proving in the important full computational tree logic CTL*.

M3 - Conference paper

SN - 9783540304951

VL - 3821

SP - 384

EP - 395

BT - Not available

PB - Springer

CY - Berlin

T2 - Towards a CTL*Tableau

Y2 - 1 January 2005

ER -

Towards a CTL*Tableau

Abstract

Conference

Fingerprint

Cite this