In: Proceedings of the Fifth International Conference on Data Engineering, 1989, Los Angeles, CA, USA, pages 366-373. Washington: IEEE Comput. Soc. Press, 1989.
Abstract: A direct extension to the counting method is presented which can deal efficiently with both acyclic and cyclic relations. The extension to cycle cases, called the synchronized counting method, is simulated and studied using a Petri net model. The algorithm is shown to be sound and complete.
Back to the Petri Nets Bibliography