A deductive proof system for CTL

Amir Pnueli, Yonit Kesten

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

30 Scopus citations


The paper presents a sound and (relatively) complete deductive proof system for the verification of CTL* properties over possibly infinite-state reactive systems. The proof system is based on a set of proof rules for the verification of basic CTL* formulas, namely CTL* formulas with no embedded path quantifiers. We first show how to decompose the proof of a general (non-basic) CTL* formula into proofs of basic CTL* formulas. We then present proof rules for some of the most useful basic CTL* formulas, then present a methodology for transforming an arbitrary basic formula into one of these special cases.

Original languageEnglish
Title of host publicationCONCUR 2002, Concurrency Theory - 13th International Conference, Proceedings
EditorsLubos Brim, Mojmir Kretinsky, Antonin Kucera, Petr Jancar
PublisherSpringer Verlag
Number of pages17
ISBN (Print)3540440437, 9783540440437
StatePublished - 1 Jan 2002
Event13th International Conference on Concurrency Theory, CONCUR 2002 - Brno, Czech Republic
Duration: 20 Aug 200223 Aug 2002

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume2421 LNCS
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349


Conference13th International Conference on Concurrency Theory, CONCUR 2002
Country/TerritoryCzech Republic

ASJC Scopus subject areas

  • Theoretical Computer Science
  • Computer Science (all)


Dive into the research topics of 'A deductive proof system for CTL'. Together they form a unique fingerprint.

Cite this