A new rule for LTL tableaux

Research output: Chapter in Book/Conference paperConference paper

7 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 languageEnglish
Title of host publicationElectronic Proceedings in Theoretical Computer Science, EPTCS
EditorsRob van Glabbeek
PublisherOpen Publishing Association
Pages287-301
Number of pages15
Volume226
ISBN (Print)2075-2180
DOIs
Publication statusPublished - Sep 2016
Event7th International Symposium on Games - Catania, Italy, Catania, Italy
Duration: 14 Sep 201616 Sep 2016

Conference

Conference7th International Symposium on Games
CountryItaly
CityCatania
Period14/09/1616/09/16

Fingerprint Dive into the research topics of 'A new rule for LTL tableaux'. Together they form a unique fingerprint.

Cite this