In: Proceedings of the 11th International Conference on Application and Theory of Petri Nets, 1990, Paris, France, pages 295-314. 1990.
Also as: Technical Report No. 90-08. Hamilton, Ontario, Canada: McMaster University, Department of Computer Science and Systems, 1990.
Abstract: The optimal simulation provides a sufficient information to reason about a number of interesting system's properties (such as deadlock-freeness and liveness), and requires a minimal computational effort. The authors consider the implementation aspects of the optimal simulation. Their main contribution is an algorithm generating a reachability graph of the optimal simulation for the class of systems which can be adequately modelled by Petri nets composed of finite state machines. Such reachability graph is usally much smaller than the standard reachability graph, yet both graphs essentially convey the same information.
Keywords: optimal simulation; deadlock-freeness; liveness; reachability graph generation.