A partial order approach to branching time logic model checking

Rob Gerth; Ruurd Kuiper; Doron Peled; Wojciech Penczek

doi:10.1109/ISTCS.1995.377038

A partial order approach to branching time logic model checking

Rob Gerth, Ruurd Kuiper, Doron Peled, Wojciech Penczek

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

55 Scopus citations

Abstract

Partial order techniques enable reducing the size of the state graph used for model checking, thus alleviating the 'state space explosion' problem. These reductions are based on selecting a subset of the enabled operations from each program state. So far, these methods have been studied, implemented and demonstrated for assertional languages that model the executions of a program as computation sequences, in particular the logic LTL (linear temporal logic). The paper shows, for the first time, how this approach can be applied to languages that model the behavior of a program as a tree. We study here partial order reductions for branching temporal logics, e.g., the logics CTL and CTL∗ (all logics with the next-time operator removed) and process algebras such as CCS. Conditions on the subset of successors from each node to guarantee reduction that preserves CTL properties are given. Provided experimental results show that the reduction is substantial.

Original language	English
Title of host publication	Proceedings ISTCS 1995 - 3rd Israel Symposium on the Theory of Computing and Systems
Publisher	Institute of Electrical and Electronics Engineers Inc.
Pages	130-139
Number of pages	10
ISBN (Electronic)	0818669152, 9780818669156
DOIs	https://doi.org/10.1109/ISTCS.1995.377038
State	Published - 1995
Externally published	Yes
Event	3rd Israel Symposium on the Theory of Computing and Systems, ISTCS 1995 - Tel Aviv, Israel Duration: 4 Jan 1995 → 6 Jan 1995

Publication series

Name	Proceedings ISTCS 1995 - 3rd Israel Symposium on the Theory of Computing and Systems

Conference

Conference	3rd Israel Symposium on the Theory of Computing and Systems, ISTCS 1995
Country/Territory	Israel
City	Tel Aviv
Period	4/01/95 → 6/01/95

Bibliographical note

Publisher Copyright:
© 1995 IEEE.

Funding

*Partially supported by ESPRIT project P6021: Correct Reactive Systems (REACT)”.

Funders	Funder number
ESPRIT	P6021

Access to Document

10.1109/ISTCS.1995.377038

Cite this

Gerth, R., Kuiper, R., Peled, D., & Penczek, W. (1995). A partial order approach to branching time logic model checking. In Proceedings ISTCS 1995 - 3rd Israel Symposium on the Theory of Computing and Systems (pp. 130-139). Article 377038 (Proceedings ISTCS 1995 - 3rd Israel Symposium on the Theory of Computing and Systems). Institute of Electrical and Electronics Engineers Inc.. https://doi.org/10.1109/ISTCS.1995.377038

@inproceedings{3b1bcd8685324fb19bf4997e56b3ea04,

title = "A partial order approach to branching time logic model checking",

abstract = "Partial order techniques enable reducing the size of the state graph used for model checking, thus alleviating the 'state space explosion' problem. These reductions are based on selecting a subset of the enabled operations from each program state. So far, these methods have been studied, implemented and demonstrated for assertional languages that model the executions of a program as computation sequences, in particular the logic LTL (linear temporal logic). The paper shows, for the first time, how this approach can be applied to languages that model the behavior of a program as a tree. We study here partial order reductions for branching temporal logics, e.g., the logics CTL and CTL∗ (all logics with the next-time operator removed) and process algebras such as CCS. Conditions on the subset of successors from each node to guarantee reduction that preserves CTL properties are given. Provided experimental results show that the reduction is substantial.",

author = "Rob Gerth and Ruurd Kuiper and Doron Peled and Wojciech Penczek",

note = "Publisher Copyright: {\textcopyright} 1995 IEEE.; 3rd Israel Symposium on the Theory of Computing and Systems, ISTCS 1995 ; Conference date: 04-01-1995 Through 06-01-1995",

year = "1995",

doi = "10.1109/ISTCS.1995.377038",

language = "אנגלית",

series = "Proceedings ISTCS 1995 - 3rd Israel Symposium on the Theory of Computing and Systems",

publisher = "Institute of Electrical and Electronics Engineers Inc.",

pages = "130--139",

booktitle = "Proceedings ISTCS 1995 - 3rd Israel Symposium on the Theory of Computing and Systems",

address = "ארצות הברית",

}

Gerth, R, Kuiper, R, Peled, D & Penczek, W 1995, A partial order approach to branching time logic model checking. in Proceedings ISTCS 1995 - 3rd Israel Symposium on the Theory of Computing and Systems., 377038, Proceedings ISTCS 1995 - 3rd Israel Symposium on the Theory of Computing and Systems, Institute of Electrical and Electronics Engineers Inc., pp. 130-139, 3rd Israel Symposium on the Theory of Computing and Systems, ISTCS 1995, Tel Aviv, Israel, 4/01/95. https://doi.org/10.1109/ISTCS.1995.377038

A partial order approach to branching time logic model checking. / Gerth, Rob; Kuiper, Ruurd; Peled, Doron et al.
Proceedings ISTCS 1995 - 3rd Israel Symposium on the Theory of Computing and Systems. Institute of Electrical and Electronics Engineers Inc., 1995. p. 130-139 377038 (Proceedings ISTCS 1995 - 3rd Israel Symposium on the Theory of Computing and Systems).

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

TY - GEN

T1 - A partial order approach to branching time logic model checking

AU - Gerth, Rob

AU - Kuiper, Ruurd

AU - Peled, Doron

AU - Penczek, Wojciech

PY - 1995

Y1 - 1995

N2 - Partial order techniques enable reducing the size of the state graph used for model checking, thus alleviating the 'state space explosion' problem. These reductions are based on selecting a subset of the enabled operations from each program state. So far, these methods have been studied, implemented and demonstrated for assertional languages that model the executions of a program as computation sequences, in particular the logic LTL (linear temporal logic). The paper shows, for the first time, how this approach can be applied to languages that model the behavior of a program as a tree. We study here partial order reductions for branching temporal logics, e.g., the logics CTL and CTL∗ (all logics with the next-time operator removed) and process algebras such as CCS. Conditions on the subset of successors from each node to guarantee reduction that preserves CTL properties are given. Provided experimental results show that the reduction is substantial.

AB - Partial order techniques enable reducing the size of the state graph used for model checking, thus alleviating the 'state space explosion' problem. These reductions are based on selecting a subset of the enabled operations from each program state. So far, these methods have been studied, implemented and demonstrated for assertional languages that model the executions of a program as computation sequences, in particular the logic LTL (linear temporal logic). The paper shows, for the first time, how this approach can be applied to languages that model the behavior of a program as a tree. We study here partial order reductions for branching temporal logics, e.g., the logics CTL and CTL∗ (all logics with the next-time operator removed) and process algebras such as CCS. Conditions on the subset of successors from each node to guarantee reduction that preserves CTL properties are given. Provided experimental results show that the reduction is substantial.

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

U2 - 10.1109/ISTCS.1995.377038

DO - 10.1109/ISTCS.1995.377038

M3 - ???researchoutput.researchoutputtypes.contributiontobookanthology.conference???

AN - SCOPUS:84995331101

T3 - Proceedings ISTCS 1995 - 3rd Israel Symposium on the Theory of Computing and Systems

SP - 130

EP - 139

BT - Proceedings ISTCS 1995 - 3rd Israel Symposium on the Theory of Computing and Systems

PB - Institute of Electrical and Electronics Engineers Inc.

T2 - 3rd Israel Symposium on the Theory of Computing and Systems, ISTCS 1995

Y2 - 4 January 1995 through 6 January 1995

ER -

Gerth R, Kuiper R, Peled D, Penczek W. A partial order approach to branching time logic model checking. In Proceedings ISTCS 1995 - 3rd Israel Symposium on the Theory of Computing and Systems. Institute of Electrical and Electronics Engineers Inc. 1995. p. 130-139. 377038. (Proceedings ISTCS 1995 - 3rd Israel Symposium on the Theory of Computing and Systems). doi: 10.1109/ISTCS.1995.377038

A partial order approach to branching time logic model checking

Abstract

Publication series

Conference

Bibliographical note

Funding

Access to Document

Other files and links

Fingerprint

Cite this