91: Hildesheimer Informatik-Berichte 7, pages 1-39 pp.. Universität Hildesheim (Germany), Institut für Informatik, June 1991.
Also in: Information and Computation, Vol. 114, No. 1, pages 50-87. 1994.
Abstract: The paper provides reduction rules that permit to reduce all and only live and bounded free choice net systems to systems whose underlying net contains exactly one place and one transition. The reduction algorithm is shown to require polynomial time in size of the system. The reduction rules can be transformed into synthesis rules, which can be used for stepwise construction of large systems.
Keywords: reduction (and) synthesis (of) live (and) bounded free choice net(s), (in) polynomial time; stepwise construction; complete reduction.
Back to the Petri Nets Bibliography