O'Reilly logo

Handbook of Automated Reasoning by Andrei Voronkov, Alan J.A. Robinson

Stay ahead with the world's most comprehensive technology and business learning platform.

With Safari, you learn the way you learn best. Get unlimited access to videos, live online training, learning paths, books, tutorials, and more.

Start Free Trial

No credit card required

10.2 Symbolic Model Checking for CTL

In [Burch, Clarke, McMillan, Dill and Hwang 1992], the term symbolic model checking was introduced for algorithms which use a BDD representation of the Kripke model (cf. Page 1735).

Assume that the transition relation is given as a BDD over the variables ( υ 1 , , υ n , υ 1 , υ n ) si1454_e , and for each p P si1455_e a BDD over (υ 1,…,υ n) is given which represents the set I ( p ) . We will show how the naive CTL model checking algorithm in Fig. 17 on P. 1714 can be implemented ...

With Safari, you learn the way you learn best. Get unlimited access to videos, live online training, learning paths, books, interactive tutorials, and more.

Start Free Trial

No credit card required