The source code and dockerfile for the GSW2024 AI Lab.
You can not select more than 25 topics
Topics must start with a letter or number, can include dashes ('-') and can be up to 35 characters long.
This repo is archived. You can view files and clone it, but cannot push or open issues/pull-requests.
|
|
$Id: README,v 1.8 1997/01/23 07:33:22 fabio Exp fabio $
WHAT IS NANOTRAV================
This directory contains nanotrav, a simple reachability analysis programbased on the CUDD package. Nanotrav uses a very naive approach and isonly included to provide a sanity check for the installation of theCUDD package.
Nanotrav reads a circuit written in a small subset of blif. Thisformat is described in the comments in bnet.c. Nanotrav then createsBDDs for the primary outputs and the next state functions (if any) ofthe circuit.
If, passed the -trav option, nanotrav builds a BDD for thecharacteristic function of the transition relation of the graph. It thenbuilds a BDD for the initial state(s), and performs reachabilityanalysis. Reachability analysys is performed with either the methodknown as "monolithic transition relation method," whose main virtue issimplicity, or with an unsophisticated partitioned transition relationmethod.
Once it has completed reachability analysis, nanotrav prints results andexits. The amount of information printed, as well as several otherfeatures are controlled by the options. For a complete list of theoptions, consult the man page. Here, we only mention that the options allowthe user of nanotrav to select among different reordering options.
TEST CIRCUITS=============
Twelve test circuits are contained in this directory. The results or runningnanotrav on them with various options are also included. These tests are runas part of "make check." Notice that rcn25 requires approximately 30 s. Allother tests take much less.
|
