In: Rozenberg, G.: Lecture Notes in Computer Science, Vol. 674; Advances in Petri Nets 1993, pages 301-324. Springer-Verlag, 1993.
Abstract: Elaboration of reachability analysis in the context of Predicate/Transition nets is studied. For this purpose, parameters are introduced into the markings of Predicate/Transition nets. These parameters represent any fixed individual values potentially appearing in the marking. The formalism for dealing with parameterized markings is developed and the dynamics of Predicate/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 corresponding information: from one parameterized reachability tree several instances of ordinary reachability trees can be derived.