The computation of the set of reachable states is the key problem of many applications in sequential verification. Binary Decision Diagrams (BDDs) are extensively used in this domain, but tend to blow up for larger instances. To increase the computational power of BDDs, linearly transformed BDDs (LTBDDs) have been proposed. In this paper we show how this concept can be incorporated into the sequential verification domain by restricting dynamic reordering in such a way that the relational product can still be carried out efficiently. Experimental results are given to show the efficiency of our approach.
['Wolfgang Günther', 'Andreas Hett', 'Bernd Becker']
Application of linearly transformed BDDs in sequential verification