ePrints

A complete proof system for propositional projection temporal logic

Lookup NU author(s): Professor Maciej KoutnyORCiD

Downloads

Full text for this publication is not currently held within this repository. Alternative links are provided below where available.

Abstract

The paper presents a proof system for Propositional Projection Temporal Logic (PPTL) with projection-plus. The syntax, semantics, and logical laws of PPTL are introduced together with an axiom system consisting of axioms and inference rules. To facilitate proofs, some of the frequently used theorems are proved. A normal form of PPTL formulas is presented, and the soundness and completeness of the proof system are demonstrated. To show how the axiom system works, a full omega regular property for the mutual exclusion problem is specified by a PPTL formula and then a deductive proof of the property is performed.

Publication metadata

Author(s): Duan Z, Zhang N, Koutny M

Publication type: Article

Publication status: Published

Journal: Theoretical Computer Science

Year: 2013

Volume: 497

Pages: 84-107

Print publication date: 29/07/2013

Online publication date: 24/01/2012

ISSN (print): 0304-3975

Publisher: Elsevier BV

URL: http://dx.doi.org/10.1016/j.tcs.2012.01.026

DOI: 10.1016/j.tcs.2012.01.026

Altmetrics

Share