Module checking revisited

Orna Kupferman, Moshe Y. Vardi

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

62 Scopus citations

Abstract

When we verify the correctness of an open system with respect to a desired requirement, we should take into consideration the different environments with which the system may interact. Each environment induces a different behavior of the system, and we want all these behaviors to satisfy the requirement. Module checking is an algorithmic method that checks, given an open system (modeled as a finite structure) and a desired requirement (specified by a temporal-logic formula), whether the open system satisfies the requirement with respect to all environments. In this paper we extend the module-checking method with respect to two orthogonal issues. Both issues concern the fact that often we are not interested in satisfaction of the requirement with respect to all environments, but only with respect to these that meet some restriction. We consider the case where the environment has incomplete information about the system; i.e., when the system has internal variables, which are not readable by its environment, and the case where some assumptions are known about environment; i.e., when the system is guaranteed to satisfy the requirement only when its environment satisfies certain assumptions. We study the complexities of the extended module-checking problems. In particular, we show that for universal temporal logics (e.g., LTL, ∀CTL, and ∀CTL*), module checking with incomplete information coincides with module checking, which by itself coincides with model checking. On the other hand, for non-universal temporal logics (e.g., CTL and CTL*), module checking with incomplete information is harder than module checking, which is by itself harder than model checking.

Original languageAmerican English
Title of host publicationComputer Aided Verification - 9th International Conference, CAV 1997, Proceedings
EditorsOrna Grumberg
PublisherSpringer Verlag
Pages36-47
Number of pages12
ISBN (Print)3540631666, 9783540631668
DOIs
StatePublished - 1997
Externally publishedYes
Event9th International Conference on Computer-Aided Verification, CAV 1997 - Haifa, Israel
Duration: 22 Jun 199725 Jun 1997

Publication series

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

Conference

Conference9th International Conference on Computer-Aided Verification, CAV 1997
Country/TerritoryIsrael
CityHaifa
Period22/06/9725/06/97

Bibliographical note

Publisher Copyright:
© Springer-Verlag Berlin Heidelberg 1997.

Fingerprint

Dive into the research topics of 'Module checking revisited'. Together they form a unique fingerprint.

Cite this