Max-Planck-Institut für Informatik
max planck institut
mpii logo Minerva of the Max Planck Society


Proving a conjecture of Andreka on temporal logic

Raskin, Jean-Francois and Schobbens, Pierre-Yves

MPI-I-1999-3-004. August 1999, 13 pages. | Status: available - back from printing | Next --> Entry | Previous <-- Entry

Abstract in LaTeX format:
In \cite{Andreka}, a large number of completeness results about variants
of discrete linear-time temporal logic are obtained. One of them is left
as an open problem:
the completeness of the logic of initially and next, for which a
deductive system is proposed. This simple logic is of practical
importance, since the proof of program invariants only require these
We show here that the conjectured {\em medium completeness} of this
system indeed holds;
further, we show that deciding this entailment is PSPACE-complete, while
deciding validity is only coNP-complete.
References to related material:

To download this research report, please select the type of document that fits best your needs.Attachement Size(s):
MPI-I-1999-3-004.ps235 KBytes
Please note: If you don't have a viewer for PostScript on your platform, try to install GhostScript and GhostView
URL to this document:
Hide details for BibTeXBibTeX
  AUTHOR = {Raskin, Jean-Francois and Schobbens, Pierre-Yves},
  TITLE = {Proving a conjecture of Andreka on temporal logic},
  TYPE = {Research Report},
  INSTITUTION = {Max-Planck-Institut f{\"u}r Informatik},
  ADDRESS = {Stuhlsatzenhausweg 85, 66123 Saarbr{\"u}cken, Germany},
  NUMBER = {MPI-I-1999-3-004},
  MONTH = {August},
  YEAR = {1999},
  ISSN = {0946-011X},