In: Proceedings of the 11th International Conference on Application and Theory of Petri Nets, 1990, Paris, France, pages 22-42. 1990.
Abstract: The reachability of Predicate/Transition nets is elaborated. For this purpose, parameters are introduced into the markings of these nets. The parameters represent any fixed individual values potentially appearing in the marking. The formalism for dealing with parameterized markings is developed and the dynamics of Predicat/Transition nets are augmented to cope with parameters. These are used to define parameterized reachability trees and an algorithm for generating them is presented. They are shown to be significantly smaller than ordinary reachability trees and to contain the same information.
Keywords: parameterized reachability tree; augmented predicate/transition nets.