Compositional model checking. (English) Zbl 0716.68035

Logic in computer science, Proc. 4th Annual Symp., Pacific Grove/CA (USA) 1989, 353-362 (1989).
Summary: [For the entire collection see Zbl 0713.00018.]
We describe a method for reducing the complexity of temporal logic model checking in systems composed of many parallel processes. The goal is to check properties of the components of a system and then deduce global properties from these local properties. The main difficulty with this type of approach is that local properties are often not preserved at the global level. We present a general framework for using additional interface processes to model the environment for a component. These interface processes are typically much simpler than the full environment of the component. By composing a component with its interface processes and then checking properties of this composition, we can guarantee that these properties will be preserved at the global level. We give two example compositional systems based on the logic \(CTL^*\).


68Q10 Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.)
03B70 Logic in computer science
68Q05 Models of computation (Turing machines, etc.) (MSC2010)


Zbl 0713.00018