Complete proof systems for QPTL

Yonit Kesten, Amir Pnueli

Research output: Contribution to journalConference articlepeer-review

26 Scopus citations

Abstract

The paper presents an axiomatic system for quantified propositional temporal logic (QPTL), which is propositional temporal logic equipped with quantification over propositions (boolean variables). The advantages of this extended temporal logic is that its expressive power is strictly higher than that of the unquantified version (PTL) and is equal to that of SIS, as well as that of ω-automata. Another important application of QPTL is its use for formulating and verifying refinement relations between reactive systems. In fact, the completeness proof is based on the reduction of a QPTL formula into a Buchi automation, and performing equivalence transformations on this automata, formally justifying these transformations.

Original languageEnglish
Pages (from-to)2-12
Number of pages11
JournalProceedings - Symposium on Logic in Computer Science
StatePublished - 1 Jan 1995
Externally publishedYes
EventProceedings of the 10th Annual IEEE Symposium on Logic in Computer Science - San Diego, CA, USA
Duration: 26 Jun 199529 Jun 1995

ASJC Scopus subject areas

  • Software
  • Mathematics (all)

Fingerprint

Dive into the research topics of 'Complete proof systems for QPTL'. Together they form a unique fingerprint.

Cite this