riscv
/
alliance
mirror of https://gitlab.lip6.fr/vlsi-eda/alliance.git
1
0
Fork 0
Code Issues Projects Releases Wiki Activity

idem++

This commit is contained in:
Ludovic Jacomme 2002-08-07 13:24:08 +00:00
parent 019a8d3616
commit 951d818f0d
1 changed files with 49 additions and 5 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

54
alliance/src/mocha/man1/moka.1
View File

@ -11,13 +11,56 @@ MOKA \- Model checker ancestor
.br .br
.SH DESCRIPTION .SH DESCRIPTION
.br .br
\fBmoka\fp is a CTL model checker. \fBmoka\fP is a CTL model checker.
.br .br
Made to run on FSM or RTL descriptions, \fBmoka\fP supports the same VHDL subset Made to run on FSM or RTL descriptions, \fBmoka\fP supports the same VHDL subset
as syf or boom (for further informations about this subset see SYF(1), FSM(5), VBE(5) ). as syf or boom (for further informations about this subset see SYF(1), BOOM(1), FSM(5), VBE(5) ).
\fBmoka\fP uses a Reduced Ordered Binary Decision Diagrams representation and Nevertheless \fBmoka\fP imposes that each register of the behavioral description have
verifies CTL formulae (see CTL(5) for CTL file format details). the same clock condition and that there are no tristate or multiplexed buses.
In particular VHDL type MUX_BIT and WOR_BIT aren't not supported.
.br
First of all \fBmoka\fP build the fonction transition of the FSM using
a Reduced Ordered Binary Decision Diagrams representation.
.br
It then applies the initial condition to find the first state (keyword INITIAL
in the CTL(5) file format).
.br
After it computes a symbolic simulation of the FSM in order
to find all reachable states. This computation takes into account the
assumptions conditions (ASSUME keyword in the CTL(5) file format).
.br
\fBmoka\fP finally verifies one by one each CTL formulae.
(see CTL(5) for CTL file format details).
.SH CTL OPERATORS
.PP
For each CTL sub-expression \fBmoka\fP will return the set of states that verifies
the formula. For example EX(p) will return the set of reachable states that verifies
EX(p).
.br
CTL operators :
.RS
.br
EX(p) : returns all states which have almost one primary state successor that
verifies \fBp\fP.
.br
EU(p,q) : returns all states that are the root of almost one path, such that \fBp\fP is true
until \fBq\fP is always true.
.br
EG(p) : returns all states that are the root of almost one path, such that \fBp\fP is always true.
.br
AX(p) : returns all states which have all their primary state successor that
verifies \fBp\fP.
.br
AU(p,q) : returns all states that are the root of only pathes from which \fBp\fP is true
until \fBq\fP is always true.
.br
AG(p) : returns all states that are the root of only pathes, such that \fBp\fP is always true.
.RE
.br
.SH ENVIRONMENT VARIABLES .SH ENVIRONMENT VARIABLES
.br .br
@ -40,7 +83,8 @@ standard output.
.br .br
\-D \-D
Sets debug mode on. Each step of the model checking is detailed on the Sets debug mode on. Each step of the model checking is detailed on the
standard output. standard output. In particular all states set are displayed for each
CTL sub-expression.
.br .br
\-B \-B