next up previous contents
Next: How to Get and Up: PdTRAV Politecnico di Torino Previous: Contents   Contents

Introduction

The Politecnico di Torino Reachability Analysis for Verification (PdTRAV) package provides functions to perform BDD based symbolic reachability analysis of Finite State Machines (FSMs). The functions are intended for use within the field of formal verification of sequential circuits.

The package can be used as:

The CMD sub-package provides a simple textual user interface for users who simply want to perform reachability and BDD operations.

The package includes the following sub-packages (directories):

Mutual interactions and references among sub-packages exist internally. Some of the sub-packages have been build up mainly as bottom layers for other sub-packages, but they could be used as stand-alone packages as well by any application. E.g. the DDI package is the only one required for an application which requires Boolean function manipulation only, without requiring the FSM, transition relation and traversal packages. In the following we assume that the reader is familiar with BDDs, basic operations using BDDs, and symbolic traversals. The reader should refer to [#!Bryant86!#,#!Bryant92!#] for a survey on these topics.


next up previous contents
Next: How to Get and Up: PdTRAV Politecnico di Torino Previous: Contents   Contents
Gianpiero Cabodi
2001-03-25