org.ginsim.service.tool.reg2dyn.htg

Class TarjanSimulation

java.lang.Object

org.ginsim.service.tool.reg2dyn.htg.TarjanSimulation

public class TarjanSimulation
extends Object

Run a simulation to construct a HierarchicalTransitionGraph

Field Summary

Fields

Modifier and Type	Field and Description
protected int	depth The current depth in the dfs.
protected int	index The index of the next state found during the dfs.
protected Map<org.ginsim.service.tool.reg2dyn.htg.SimpleState,HTGSimulationQueueState>	inQueue
protected long	lastDraw
protected int	max_depth_reached The current maximal depth of the dfs of the current initial state.
protected int	nbinitialstates
protected LinkedList<HTGSimulationQueueState>	queue
protected int	step

Constructor Summary

Constructors

Constructor and Description
TarjanSimulation(HTGSimulation htgSimulation, ProgressListener<Graph> frame)

Method Summary

Modifier and Type	Method and Description
protected void	runSimulationOnInitialStates() The main entrance for the algorithm.

Methods inherited from class java.lang.Object

clone, equals, finalize, getClass, hashCode, notify, notifyAll, toString, wait, wait, wait

Field Detail

queue

protected LinkedList<HTGSimulationQueueState> queue

index

protected int index

The index of the next state found during the dfs.

depth

protected int depth

The current depth in the dfs. Used mainly for the simulation limit's.

max_depth_reached

protected int max_depth_reached

The current maximal depth of the dfs of the current initial state.

lastDraw

protected long lastDraw

nbinitialstates

protected int nbinitialstates

step

protected int step

inQueue

protected Map<org.ginsim.service.tool.reg2dyn.htg.SimpleState,HTGSimulationQueueState> inQueue

Constructor Detail

TarjanSimulation

public TarjanSimulation(HTGSimulation htgSimulation,
                        ProgressListener<Graph> frame)

Method Detail

runSimulationOnInitialStates

protected void runSimulationOnInitialStates()
                                     throws Exception

The main entrance for the algorithm. Basically, initialize the main variables, and run the recursive explore function on every initial states

 index = 0
 For each initial state __state__
     If __state__ is not in __nodeSet__, that is is not already processed
         If __state__ has no successors
             It is a stable state; continue
         Else
             Explore({__state__, index, index})
 

Throws:

Exception