|Title:|| INCREMENTAL MODEL CHECKING FOR DECOMPOSABLE
|Authors:|| J.A. Makowsky and E.V. Ravve
|Abstract:||Assume we are given a transition system which is composed of several well identified components. We propose a method which allowed us to reduce the model checking of formulas in the complex system to model checking of derived formulas in Monadic Second Order Logic in the components. Our method applies to all practically used hardware specification languages, although at a certain cost. The basic idea goes back to a method proposed first by Feferman and Vaught in 1959, which we adapt and generalize to the specific context of model checking of transition systems. Our method allows for a precise definition of incremental model checking. We give also estimates on when our incremental method starts to be better than traditional methods.|
|Copyright||The above paper is copyright by the Technion, Author(s), or others. Please contact the author(s) for more information|
Remark: Any link to this technical report should be to this page (http://www.cs.technion.ac.il/users/wwwb/cgi-bin/tr-info.cgi/1995/CS/CS0848), rather than to the URL of the PDF files directly. The latter URLs may change without notice.
To the list of the CS technical reports of 1995
To the main CS technical reports page
Computer science department, Technion