Modular model checking

Orna Kupferman; Moshe Y. Vardi

doi:10.1007/3-540-49213-5_14

Modular model checking

Orna Kupferman, Moshe Y. Vardi

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

50 Scopus citations

Abstract

In modular verification the specification of a module consists of two parts. One part describes the guaranteed behavior of the module. The other part describes the assumed behavior of the system in which the module is interacting. This is called the assume-guarantee paradigm. In this paper we consider assume-guarantee specifications in which the guarantee is specified by branching temporal formulas. We distinguish between two approaches. In the first approach, the assumption is specified by branching temporal formulas. In the second approach, the assumption is specified by linear temporal logic. We consider guarantees in VCTL and VCTL*, the universal fragments of CTL and CTL*, and assumptions in LTL, VCTL, and VCTL*. We describe a reduction of modular model checking to standard model checking. Using the reduction, we show that modular model checking is PSPACE-complete for VCTL and is EXPSPACE-complete for VCTL*. We then show that the case of LTL assumption is a special case of the case of VCTL* assumption, but that the EXPSPACE-hardness result apply already to assumptions in LTL.

Original language	English
Title of host publication	Compositionality
Subtitle of host publication	The Significant Difference - International Symposium, COMPOS 1997, Revised Lectures
Editors	Willem-Paul de Roever, Langmaack Langmaack, Pnueli Pnueli
Publisher	Springer Verlag
Pages	381-401
Number of pages	21
ISBN (Print)	3540654933, 9783540654933
DOIs	https://doi.org/10.1007/3-540-49213-5_14
State	Published - 1998
Externally published	Yes
Event	International Symposium on Compositionality: The Significant Difference, COMPOS 1997 - Bad Malente, Germany Duration: 8 Sep 1997 → 12 Sep 1997

Publication series

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

Conference

Conference	International Symposium on Compositionality: The Significant Difference, COMPOS 1997
Country/Territory	Germany
City	Bad Malente
Period	8/09/97 → 12/09/97

Bibliographical note

Publisher Copyright:
© Springer-Verlag Berlin Heidelberg 1998.

Access to Document

10.1007/3-540-49213-5_14

Cite this

Kupferman, O., & Vardi, M. Y. (1998). Modular model checking. In W.-P. de Roever, L. Langmaack, & P. Pnueli (Eds.), Compositionality: The Significant Difference - International Symposium, COMPOS 1997, Revised Lectures (pp. 381-401). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 1536). Springer Verlag. https://doi.org/10.1007/3-540-49213-5_14

Kupferman, Orna ; Vardi, Moshe Y. / Modular model checking. Compositionality: The Significant Difference - International Symposium, COMPOS 1997, Revised Lectures. editor / Willem-Paul de Roever ; Langmaack Langmaack ; Pnueli Pnueli. Springer Verlag, 1998. pp. 381-401 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)).

@inproceedings{398bbcfc00874c59a5f61aae5d926b04,

title = "Modular model checking",

abstract = "In modular verification the specification of a module consists of two parts. One part describes the guaranteed behavior of the module. The other part describes the assumed behavior of the system in which the module is interacting. This is called the assume-guarantee paradigm. In this paper we consider assume-guarantee specifications in which the guarantee is specified by branching temporal formulas. We distinguish between two approaches. In the first approach, the assumption is specified by branching temporal formulas. In the second approach, the assumption is specified by linear temporal logic. We consider guarantees in VCTL and VCTL*, the universal fragments of CTL and CTL*, and assumptions in LTL, VCTL, and VCTL*. We describe a reduction of modular model checking to standard model checking. Using the reduction, we show that modular model checking is PSPACE-complete for VCTL and is EXPSPACE-complete for VCTL*. We then show that the case of LTL assumption is a special case of the case of VCTL* assumption, but that the EXPSPACE-hardness result apply already to assumptions in LTL.",

author = "Orna Kupferman and Vardi, {Moshe Y.}",

note = "Publisher Copyright: {\textcopyright} Springer-Verlag Berlin Heidelberg 1998.; International Symposium on Compositionality: The Significant Difference, COMPOS 1997 ; Conference date: 08-09-1997 Through 12-09-1997",

year = "1998",

doi = "10.1007/3-540-49213-5_14",

language = "אנגלית",

isbn = "3540654933",

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

publisher = "Springer Verlag",

pages = "381--401",

editor = "{de Roever}, Willem-Paul and Langmaack Langmaack and Pnueli Pnueli",

booktitle = "Compositionality",

address = "גרמניה",

}

Kupferman, O & Vardi, MY 1998, Modular model checking. in W-P de Roever, L Langmaack & P Pnueli (eds), Compositionality: The Significant Difference - International Symposium, COMPOS 1997, Revised Lectures. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 1536, Springer Verlag, pp. 381-401, International Symposium on Compositionality: The Significant Difference, COMPOS 1997, Bad Malente, Germany, 8/09/97. https://doi.org/10.1007/3-540-49213-5_14

Modular model checking. / Kupferman, Orna; Vardi, Moshe Y.
Compositionality: The Significant Difference - International Symposium, COMPOS 1997, Revised Lectures. ed. / Willem-Paul de Roever; Langmaack Langmaack; Pnueli Pnueli. Springer Verlag, 1998. p. 381-401 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 1536).

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

TY - GEN

T1 - Modular model checking

AU - Kupferman, Orna

AU - Vardi, Moshe Y.

N1 - Publisher Copyright: © Springer-Verlag Berlin Heidelberg 1998.

PY - 1998

Y1 - 1998

N2 - In modular verification the specification of a module consists of two parts. One part describes the guaranteed behavior of the module. The other part describes the assumed behavior of the system in which the module is interacting. This is called the assume-guarantee paradigm. In this paper we consider assume-guarantee specifications in which the guarantee is specified by branching temporal formulas. We distinguish between two approaches. In the first approach, the assumption is specified by branching temporal formulas. In the second approach, the assumption is specified by linear temporal logic. We consider guarantees in VCTL and VCTL*, the universal fragments of CTL and CTL*, and assumptions in LTL, VCTL, and VCTL*. We describe a reduction of modular model checking to standard model checking. Using the reduction, we show that modular model checking is PSPACE-complete for VCTL and is EXPSPACE-complete for VCTL*. We then show that the case of LTL assumption is a special case of the case of VCTL* assumption, but that the EXPSPACE-hardness result apply already to assumptions in LTL.

AB - In modular verification the specification of a module consists of two parts. One part describes the guaranteed behavior of the module. The other part describes the assumed behavior of the system in which the module is interacting. This is called the assume-guarantee paradigm. In this paper we consider assume-guarantee specifications in which the guarantee is specified by branching temporal formulas. We distinguish between two approaches. In the first approach, the assumption is specified by branching temporal formulas. In the second approach, the assumption is specified by linear temporal logic. We consider guarantees in VCTL and VCTL*, the universal fragments of CTL and CTL*, and assumptions in LTL, VCTL, and VCTL*. We describe a reduction of modular model checking to standard model checking. Using the reduction, we show that modular model checking is PSPACE-complete for VCTL and is EXPSPACE-complete for VCTL*. We then show that the case of LTL assumption is a special case of the case of VCTL* assumption, but that the EXPSPACE-hardness result apply already to assumptions in LTL.

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

U2 - 10.1007/3-540-49213-5_14

DO - 10.1007/3-540-49213-5_14

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

AN - SCOPUS:84949229557

SN - 3540654933

SN - 9783540654933

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

SP - 381

EP - 401

BT - Compositionality

A2 - de Roever, Willem-Paul

A2 - Langmaack, Langmaack

A2 - Pnueli, Pnueli

PB - Springer Verlag

T2 - International Symposium on Compositionality: The Significant Difference, COMPOS 1997

Y2 - 8 September 1997 through 12 September 1997

ER -

Kupferman O, Vardi MY. Modular model checking. In de Roever WP, Langmaack L, Pnueli P, editors, Compositionality: The Significant Difference - International Symposium, COMPOS 1997, Revised Lectures. Springer Verlag. 1998. p. 381-401. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)). doi: 10.1007/3-540-49213-5_14

Modular model checking

Abstract

Publication series

Conference

Bibliographical note

Access to Document

Other files and links

Fingerprint

Cite this