For the most recent entries see the Petri Nets Newsletter.

Parameterized Reachability Trees for Predicate/Transition Nets.

Lindqvist, M.

Acta Polytechnica Scandinavica, Mathematics and Computer Science, No. 54, 120 pp. pages, 1989.

Abstract: An approach to elaborate the reachability analysis method in order to make it more applicable also to larger systems is discussed in detail. The difficulties encountered in this approach are taken as a motivation for developing an approach based on introducing parameters into the marking of a net. The formalism to deal with parameterized markings is devleloped; parameterized reachability trees are defined 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.


Do you need a refined search? Try our search engine which allows complex field-based queries.

Back to the Petri Nets Bibliography