A new rule for LTL tableaux

Mark Reynolds

doi:10.4204/EPTCS.226.20

A new rule for LTL tableaux

Mark Reynolds

Computer Science and Software Engineering

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

16 Citations (Scopus)

Abstract

© M. Reynolds.
Propositional linear time temporal logic (LTL) is the standard temporal logic for computing applications and many reasoning techniques and tools have been developed for it. Tableaux for deciding satisfiability have existed since the 1980s. However, the tableaux for this logic do not look like traditional tree-shaped tableau systems and their processing is often quite complicated. In this paper, we introduce a novel style of tableau rule which supports a new simple traditional-style tree-shaped tableau for LTL. We prove that it is sound and complete. As well as being simple to understand, to introduce to students and to use, it is also simple to implement and is competitive against state of the art systems. It is particularly suitable for parallel implementations.

Original language	English
Title of host publication	Electronic Proceedings in Theoretical Computer Science, EPTCS
Editors	Rob van Glabbeek
Publisher	Open Publishing Association
Pages	287-301
Number of pages	15
Volume	226
ISBN (Print)	2075-2180
DOIs	https://doi.org/10.4204/EPTCS.226.20
Publication status	Published - 13 Sept 2016
Event	7th International Symposium on Games - Catania, Italy, Catania, Italy Duration: 14 Sept 2016 → 16 Sept 2016

Publication series

Name	Electronic Proceedings in Theoretical Computer Science, EPTCS
Publisher	Open Publishing Association
ISSN (Print)	2075-2180

Conference

Conference	7th International Symposium on Games
Country/Territory	Italy
City	Catania
Period	14/09/16 → 16/09/16

Access to Document

10.4204/EPTCS.226.20Licence: CC BY

Cite this

@inproceedings{fb46799e667c4c10aa9ad426732e2432,

title = "A new rule for LTL tableaux",

abstract = "{\textcopyright} M. Reynolds.Propositional linear time temporal logic (LTL) is the standard temporal logic for computing applications and many reasoning techniques and tools have been developed for it. Tableaux for deciding satisfiability have existed since the 1980s. However, the tableaux for this logic do not look like traditional tree-shaped tableau systems and their processing is often quite complicated. In this paper, we introduce a novel style of tableau rule which supports a new simple traditional-style tree-shaped tableau for LTL. We prove that it is sound and complete. As well as being simple to understand, to introduce to students and to use, it is also simple to implement and is competitive against state of the art systems. It is particularly suitable for parallel implementations.",

author = "Mark Reynolds",

year = "2016",

month = sep,

day = "13",

doi = "10.4204/EPTCS.226.20",

language = "English",

isbn = "2075-2180",

volume = "226",

series = "Electronic Proceedings in Theoretical Computer Science, EPTCS",

publisher = "Open Publishing Association",

pages = "287--301",

editor = "{van Glabbeek}, Rob",

booktitle = "Electronic Proceedings in Theoretical Computer Science, EPTCS",

address = "Australia",

note = "7th International Symposium on Games ; Conference date: 14-09-2016 Through 16-09-2016",

}

TY - GEN

T1 - A new rule for LTL tableaux

AU - Reynolds, Mark

PY - 2016/9/13

Y1 - 2016/9/13

N2 - © M. Reynolds.Propositional linear time temporal logic (LTL) is the standard temporal logic for computing applications and many reasoning techniques and tools have been developed for it. Tableaux for deciding satisfiability have existed since the 1980s. However, the tableaux for this logic do not look like traditional tree-shaped tableau systems and their processing is often quite complicated. In this paper, we introduce a novel style of tableau rule which supports a new simple traditional-style tree-shaped tableau for LTL. We prove that it is sound and complete. As well as being simple to understand, to introduce to students and to use, it is also simple to implement and is competitive against state of the art systems. It is particularly suitable for parallel implementations.

AB - © M. Reynolds.Propositional linear time temporal logic (LTL) is the standard temporal logic for computing applications and many reasoning techniques and tools have been developed for it. Tableaux for deciding satisfiability have existed since the 1980s. However, the tableaux for this logic do not look like traditional tree-shaped tableau systems and their processing is often quite complicated. In this paper, we introduce a novel style of tableau rule which supports a new simple traditional-style tree-shaped tableau for LTL. We prove that it is sound and complete. As well as being simple to understand, to introduce to students and to use, it is also simple to implement and is competitive against state of the art systems. It is particularly suitable for parallel implementations.

UR - http://gandalf2016.dmi.unict.it/

UR - http://about.eptcs.org/

U2 - 10.4204/EPTCS.226.20

DO - 10.4204/EPTCS.226.20

M3 - Conference paper

SN - 2075-2180

VL - 226

T3 - Electronic Proceedings in Theoretical Computer Science, EPTCS

SP - 287

EP - 301

BT - Electronic Proceedings in Theoretical Computer Science, EPTCS

A2 - van Glabbeek, Rob

PB - Open Publishing Association

T2 - 7th International Symposium on Games

Y2 - 14 September 2016 through 16 September 2016

ER -

A new rule for LTL tableaux

Abstract

Publication series

Conference

Access to Document

Other files and links

Fingerprint

Cite this