A deductive proof system for CTL

Amir Pnueli; Yonit Kesten

doi:10.1007/3-540-45694-5_2

A deductive proof system for CTL

Amir Pnueli, Yonit Kesten

Department of Management

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

30 Scopus citations

Abstract

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 language	English
Title of host publication	CONCUR 2002, Concurrency Theory - 13th International Conference, Proceedings
Editors	Lubos Brim, Mojmir Kretinsky, Antonin Kucera, Petr Jancar
Publisher	Springer Verlag
Pages	24-40
Number of pages	17
ISBN (Print)	3540440437, 9783540440437
DOIs	https://doi.org/10.1007/3-540-45694-5_2
State	Published - 1 Jan 2002
Event	13th International Conference on Concurrency Theory, CONCUR 2002 - Brno, Czech Republic Duration: 20 Aug 2002 → 23 Aug 2002

Publication series

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

Conference

Conference	13th International Conference on Concurrency Theory, CONCUR 2002
Country/Territory	Czech Republic
City	Brno
Period	20/08/02 → 23/08/02

ASJC Scopus subject areas

Theoretical Computer Science
Computer Science (all)

Access to Document

10.1007/3-540-45694-5_2

Cite this

Pnueli, A., & Kesten, Y. (2002). A deductive proof system for CTL. In L. Brim, M. Kretinsky, A. Kucera, & P. Jancar (Eds.), CONCUR 2002, Concurrency Theory - 13th International Conference, Proceedings (pp. 24-40). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 2421 LNCS). Springer Verlag. https://doi.org/10.1007/3-540-45694-5_2

Pnueli, Amir ; Kesten, Yonit. / A deductive proof system for CTL. CONCUR 2002, Concurrency Theory - 13th International Conference, Proceedings. editor / Lubos Brim ; Mojmir Kretinsky ; Antonin Kucera ; Petr Jancar. Springer Verlag, 2002. pp. 24-40 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)).

@inproceedings{5bfaa2a0ea1943ce9d2ab7f3a41ba5f8,

title = "A deductive proof system for CTL",

abstract = "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.",

author = "Amir Pnueli and Yonit Kesten",

year = "2002",

month = jan,

day = "1",

doi = "10.1007/3-540-45694-5_2",

language = "English",

isbn = "3540440437",

series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",

publisher = "Springer Verlag",

pages = "24--40",

editor = "Lubos Brim and Mojmir Kretinsky and Antonin Kucera and Petr Jancar",

booktitle = "CONCUR 2002, Concurrency Theory - 13th International Conference, Proceedings",

address = "Germany",

note = "13th International Conference on Concurrency Theory, CONCUR 2002 ; Conference date: 20-08-2002 Through 23-08-2002",

}

Pnueli, A & Kesten, Y 2002, A deductive proof system for CTL. in L Brim, M Kretinsky, A Kucera & P Jancar (eds), CONCUR 2002, Concurrency Theory - 13th International Conference, Proceedings. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 2421 LNCS, Springer Verlag, pp. 24-40, 13th International Conference on Concurrency Theory, CONCUR 2002, Brno, Czech Republic, 20/08/02. https://doi.org/10.1007/3-540-45694-5_2

A deductive proof system for CTL. / Pnueli, Amir; Kesten, Yonit.
CONCUR 2002, Concurrency Theory - 13th International Conference, Proceedings. ed. / Lubos Brim; Mojmir Kretinsky; Antonin Kucera; Petr Jancar. Springer Verlag, 2002. p. 24-40 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 2421 LNCS).

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

TY - GEN

T1 - A deductive proof system for CTL

AU - Pnueli, Amir

AU - Kesten, Yonit

PY - 2002/1/1

Y1 - 2002/1/1

N2 - 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.

AB - 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.

UR - http://www.scopus.com/inward/record.url?scp=84864014519&partnerID=8YFLogxK

U2 - 10.1007/3-540-45694-5_2

DO - 10.1007/3-540-45694-5_2

M3 - Conference contribution

AN - SCOPUS:84864014519

SN - 3540440437

SN - 9783540440437

T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

SP - 24

EP - 40

BT - CONCUR 2002, Concurrency Theory - 13th International Conference, Proceedings

A2 - Brim, Lubos

A2 - Kretinsky, Mojmir

A2 - Kucera, Antonin

A2 - Jancar, Petr

PB - Springer Verlag

T2 - 13th International Conference on Concurrency Theory, CONCUR 2002

Y2 - 20 August 2002 through 23 August 2002

ER -

Pnueli A, Kesten Y. A deductive proof system for CTL. In Brim L, Kretinsky M, Kucera A, Jancar P, editors, CONCUR 2002, Concurrency Theory - 13th International Conference, Proceedings. Springer Verlag. 2002. p. 24-40. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)). doi: 10.1007/3-540-45694-5_2

A deductive proof system for CTL

Abstract

Publication series

Conference

ASJC Scopus subject areas

Access to Document

Other files and links

Fingerprint

Cite this