jimjim2k
Advanced Member level 3
fancy download
Hi
FANCY is a BDD-based tool for formal hardware verification.
It's a collection of new and known FSM equivalence and inclusion check
algorithms with a graphical user interface.
The finite state machines (FSMs) can be of Mealy type or Moore type
and must be given in the format of the ISCAS'89 benchmark or in the blif
format (Berkeley Logic Interchange Format).
Such a collection is useful because no equivalence/inclusion
checking algorithm works well for all examples. Every one has its favorite
examples and its bad examples.
FANCY runs under Unix with the X window system (X11)
and the Tcl/Tk interpreter `wish' (version Tcl/7.3, Tk/3.6, available
by anonymous f*p on harbor.ecn.purdue.edu) for the graphical user interface.
There are compiled versions of FANCY for SUN 4, HP 9000,
DEC 5000 (due Laurence Pierre), and a Linux version for PC 486 (for the
moment only version 1.0).
1. h**p://www.cs.utwente.nl/data/amast/links/v01/i03/full/FANCYt.txt
* -> t
tnx
Hi
FANCY is a BDD-based tool for formal hardware verification.
It's a collection of new and known FSM equivalence and inclusion check
algorithms with a graphical user interface.
The finite state machines (FSMs) can be of Mealy type or Moore type
and must be given in the format of the ISCAS'89 benchmark or in the blif
format (Berkeley Logic Interchange Format).
Such a collection is useful because no equivalence/inclusion
checking algorithm works well for all examples. Every one has its favorite
examples and its bad examples.
FANCY runs under Unix with the X window system (X11)
and the Tcl/Tk interpreter `wish' (version Tcl/7.3, Tk/3.6, available
by anonymous f*p on harbor.ecn.purdue.edu) for the graphical user interface.
There are compiled versions of FANCY for SUN 4, HP 9000,
DEC 5000 (due Laurence Pierre), and a Linux version for PC 486 (for the
moment only version 1.0).
1. h**p://www.cs.utwente.nl/data/amast/links/v01/i03/full/FANCYt.txt
* -> t
tnx
