For the most recent entries see the Petri Nets Newsletter.

Verification of Recipe-Based control Procedures of Means of Predicate/Transition Nets.

Genrich, H.J.; Hanisch, H.-M.; Woellhaf, K.

In: Valette, R.: Lecture Notes in Computer Science, Vol. 815; Application and Theory of Petri Nets 1994, Proceedings 15th International Conference, Zaragoza, Spain, pages 278-297. Springer-Verlag, 1994.

Abstract: The paper presents a method for the verification of control procedures which are based on so-called recipes. The concept of recipes is widely used in the control of multipurpose chemical batch plants which are very similar to Flexible Manufacturing Systems. The recipes as well as the plant description are transformed into Predicate/Transition nets (abbr.: Pr/T nets). The Pr/T net can be tested either by simulation or by analysis based on the computation of the occurence graph. Several formal net properties (conflicts, deadlocks etc.) indicate desired or critical behavior of the controlled batch plant.

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

Back to the Petri Nets Bibliography