next up previous contents index
Next: 6.5.1 Reductions of the Up: 6. Analysis Previous: 6.4.2 Fast non-reachability test


6.5 Reachability analysis

The computation of the state graph of a net is one of the most powerful analysis methods, limited only by the fact that even a small bounded net can have very many states. INA 's methodology promises very efficient memory usage whilst allowing fast access.



next up previous contents index
Next: 6.5.1 Reductions of the Up: 6. Analysis Previous: 6.4.2 Fast non-reachability test

© 1996-99 Prof. Peter H. Starke (starke@informatik.hu-berlin.de) und Stephan Roch (roch@...)

INA Manual Version 2.2 (last changed 1999-04-19)