GBDD — A package for representing relations with BDDs. Regular Model Checking is a framework for unified verification of infinite-state systems based on automata theory. It represents states using words over a finite alphabet and sets of states using finite automata. Recently, these techniques have also been applied to finite trees and we hope to generalize these techniques to other kinds of structures such as graphs. For an introduction to Regular Model Checking, you can look at the Licentiate Thesis of Marcus Nilsson. In the Software section you will find the following packages, licensed under GPL: Meta package for BDDs. The package gbdd implements an abstraction layer on top of BDDs. This allows several BDD implementation to be used under one API.