The simulator will be constructed as an executable file called token.x.$ make -f $IF/examples/Makefile token.x
Or, you can also try the random mode:$ token.x -inter
$ token.x -random
the simulator will explore all the reachable states using a breadth-first search (bfs) or depth-first search (dfs) strategy. During the exploration it will print the number of the reached states and transitions. In dfs mode, the -po option enables partial order reduction.$ token.x [-bfs|-dfs] [-po]
it will create files token.aut (in Aldebaran format, see CADP web page for details) containing the system behavior as a flat labeled transition system, and token.states containing the description of the system states.$ token.x -bfs -t token.aut -q token.states
will generate a new specification token.live.if, equivalent with token.if up to the values of dead variables. The corresponding model is usually much smaller.$ dfa -live token.if > token.live.if