A One-Pass Tree-Shaped Tableau for LTL+Past

18 pages•Published: May 4, 2017

Nicola Gigante, Angelo Montanari and Mark Reynolds

Abstract

Linear Temporal Logic (LTL) is a de-facto standard formalism for expressing properties of systems and temporal constraints in formal verification, artificial intelligence, and other areas of computer science. The problem of LTL satisfiability is thus prominently important to check the consistency of these temporal specifications. Although adding past operators to LTL does not increase its expressive power, recently the interest for explicitly handling the past in temporal logics has increased because of the clarity and succinctness that those operators provide. In this work, a recently proposed one-pass tree-shaped tableau system for LTL is extended to support past operators. The modularity of the required changes provides evidence for the claimed ease of extensibility of this tableau system.

Keyphrases: linear temporal logic, past operators, tableaux

In: Thomas Eiter and David Sands (editors). LPAR-21. 21st International Conference on Logic for Programming, Artificial Intelligence and Reasoning, vol 46, pages 456-473.

Links:	https://easychair.org/publications/paper/kllw
	https://doi.org/10.29007/3hb9

BibTeX entry

@inproceedings{LPAR-21:One_Pass_Tree_Shaped,
  author    = {Nicola Gigante and Angelo Montanari and Mark Reynolds},
  title     = {A One-Pass Tree-Shaped Tableau for LTL+Past},
  booktitle = {LPAR-21. 21st International Conference on Logic for Programming, Artificial Intelligence and Reasoning},
  editor    = {Thomas Eiter and David Sands},
  series    = {EPiC Series in Computing},
  volume    = {46},
  publisher = {EasyChair},
  bibsource = {EasyChair, https://easychair.org},
  issn      = {2398-7340},
  url       = {/publications/paper/kllw},
  doi       = {10.29007/3hb9},
  pages     = {456-473},
  year      = {2017}}

Download PDF Open PDF in browser