On the Complexity of Branching Modular Model Checking (Extended Abstract).

Orna Kupferman; Moshe Y. Vardi

doi:10.1007/3-540-60218-6_31

On the Complexity of Branching Modular Model Checking (Extended Abstract).

Orna Kupferman, Moshe Y. Vardi

The Rachel and Selim Benin School of Engineering and Computer Science

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

27 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 assumptions and the guarantees ate specified by universal branching temporal formulas (i.e., all path quantifiers ate universal). Verifying modules with respect to such specifications is called the branching modular model-checking problem. We consider both ∀CTL and ∀CTL*, the universal fragments of CTL and CTL'. We develop two fundamental techniques: building maximal models for ∀CTL and ∀CTL* formulas and using alternating automata to obtain space-efficient algorithms for fair model chocking. Using these techniques we classify the complexity of satisfiability, validity, implication, and modular model checking for both ∀CTL and ∀CTL*. In particular, branching modular model checking is PSPACE-complete for ∀CTL and EXPSPACE-complete for ∀CTL*.

Original language	English
Title of host publication	CONCUR '95 Concurrency Theory
Subtitle of host publication	6th International Conference, Philadelphia, PA, USA, August 21 - 24, 1995. Proceedings
Editors	Insup Lee, Scott A. Smolka
Publisher	Springer Verlag
Pages	408-422
Number of pages	15
ISBN (Print)	3-540-60218-6
DOIs	https://doi.org/10.1007/3-540-60218-6_31
State	Published - 1995
Event	6th International Conference on Concurrency Theory, CONCUR 1995 - Philadelphia, United States Duration: 21 Aug 1995 → 24 Aug 1995

Publication series

Name	Lecture Notes in Computer Science
Volume	962
ISSN (Print)	0302-9743
ISSN (Electronic)	1611-3349

Conference

Conference	6th International Conference on Concurrency Theory, CONCUR 1995
Country/Territory	United States
City	Philadelphia
Period	21/08/95 → 24/08/95

Bibliographical note

Publisher Copyright:
© 1995, Springer Verlag. All rights reserved.

Access to Document

10.1007/3-540-60218-6_31License: Unspecified

https://dblp.org/rec/conf/concur/KupfermanV95.htmlLicense: Unspecified

Cite this

Kupferman, O., & Vardi, M. Y. (1995). On the Complexity of Branching Modular Model Checking (Extended Abstract). In I. Lee, & S. A. Smolka (Eds.), CONCUR '95 Concurrency Theory: 6th International Conference, Philadelphia, PA, USA, August 21 - 24, 1995. Proceedings (pp. 408-422). (Lecture Notes in Computer Science; Vol. 962). Springer Verlag. https://doi.org/10.1007/3-540-60218-6_31

@inproceedings{5bfda719a51444b9ba24f9c75d5a0ecd,

title = "On the Complexity of Branching Modular Model Checking (Extended Abstract).",

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 assumptions and the guarantees ate specified by universal branching temporal formulas (i.e., all path quantifiers ate universal). Verifying modules with respect to such specifications is called the branching modular model-checking problem. We consider both ∀CTL and ∀CTL*, the universal fragments of CTL and CTL'. We develop two fundamental techniques: building maximal models for ∀CTL and ∀CTL* formulas and using alternating automata to obtain space-efficient algorithms for fair model chocking. Using these techniques we classify the complexity of satisfiability, validity, implication, and modular model checking for both ∀CTL and ∀CTL*. In particular, branching modular model checking is PSPACE-complete for ∀CTL and EXPSPACE-complete for ∀CTL*.",

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

note = "Publisher Copyright: {\textcopyright} 1995, Springer Verlag. All rights reserved.; 6th International Conference on Concurrency Theory, CONCUR 1995 ; Conference date: 21-08-1995 Through 24-08-1995",

year = "1995",

doi = "10.1007/3-540-60218-6_31",

language = "אנגלית",

isbn = "3-540-60218-6",

series = "Lecture Notes in Computer Science",

publisher = "Springer Verlag",

pages = "408--422",

editor = "Insup Lee and Smolka, {Scott A.}",

booktitle = "CONCUR '95 Concurrency Theory",

address = "גרמניה",

}

Kupferman, O & Vardi, MY 1995, On the Complexity of Branching Modular Model Checking (Extended Abstract). in I Lee & SA Smolka (eds), CONCUR '95 Concurrency Theory: 6th International Conference, Philadelphia, PA, USA, August 21 - 24, 1995. Proceedings. Lecture Notes in Computer Science, vol. 962, Springer Verlag, pp. 408-422, 6th International Conference on Concurrency Theory, CONCUR 1995, Philadelphia, United States, 21/08/95. https://doi.org/10.1007/3-540-60218-6_31

On the Complexity of Branching Modular Model Checking (Extended Abstract). / Kupferman, Orna; Vardi, Moshe Y.
CONCUR '95 Concurrency Theory: 6th International Conference, Philadelphia, PA, USA, August 21 - 24, 1995. Proceedings. ed. / Insup Lee; Scott A. Smolka. Springer Verlag, 1995. p. 408-422 (Lecture Notes in Computer Science; Vol. 962).

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

TY - GEN

T1 - On the Complexity of Branching Modular Model Checking (Extended Abstract).

AU - Kupferman, Orna

AU - Vardi, Moshe Y.

PY - 1995

Y1 - 1995

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 assumptions and the guarantees ate specified by universal branching temporal formulas (i.e., all path quantifiers ate universal). Verifying modules with respect to such specifications is called the branching modular model-checking problem. We consider both ∀CTL and ∀CTL*, the universal fragments of CTL and CTL'. We develop two fundamental techniques: building maximal models for ∀CTL and ∀CTL* formulas and using alternating automata to obtain space-efficient algorithms for fair model chocking. Using these techniques we classify the complexity of satisfiability, validity, implication, and modular model checking for both ∀CTL and ∀CTL*. In particular, branching modular model checking is PSPACE-complete for ∀CTL and EXPSPACE-complete for ∀CTL*.

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 assumptions and the guarantees ate specified by universal branching temporal formulas (i.e., all path quantifiers ate universal). Verifying modules with respect to such specifications is called the branching modular model-checking problem. We consider both ∀CTL and ∀CTL*, the universal fragments of CTL and CTL'. We develop two fundamental techniques: building maximal models for ∀CTL and ∀CTL* formulas and using alternating automata to obtain space-efficient algorithms for fair model chocking. Using these techniques we classify the complexity of satisfiability, validity, implication, and modular model checking for both ∀CTL and ∀CTL*. In particular, branching modular model checking is PSPACE-complete for ∀CTL and EXPSPACE-complete for ∀CTL*.

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

U2 - 10.1007/3-540-60218-6_31

DO - 10.1007/3-540-60218-6_31

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

SN - 3-540-60218-6

T3 - Lecture Notes in Computer Science

SP - 408

EP - 422

BT - CONCUR '95 Concurrency Theory

A2 - Lee, Insup

A2 - Smolka, Scott A.

PB - Springer Verlag

T2 - 6th International Conference on Concurrency Theory, CONCUR 1995

Y2 - 21 August 1995 through 24 August 1995

ER -

On the Complexity of Branching Modular Model Checking (Extended Abstract).

Abstract

Publication series

Conference

Bibliographical note

Access to Document

Other files and links

Fingerprint

Cite this