On the Complexity of Branching Modular Model Checking (Extended Abstract) (1995)
| Citations: | 18 - 9 self |
BibTeX
@MISC{Kupferman95onthe,
author = {Orna Kupferman and Moshe Y. Vardi},
title = {On the Complexity of Branching Modular Model Checking (Extended Abstract)},
year = {1995}
}
Years of Citing Articles
Bookmark
 |
 |
 |
 |
 |
 |
OpenURL
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 are specified by universal branching temporal formulas (i.e., all path quantifiers are universal). Verifying modules with respect to such specifications is called the branching modular model-checking problem. We consider both ACTL and ACTL*, the universal fragments of CTL and CTL*. We develop two fundamental techniques: building max...
