The paper presents an analysis method for Place/Transition nets with timing of arcs directing from places to transitions. Based on this class of timed nets, the corresponding state graph, called dynamic graph, and a method to compute the state graph are defined. By means of the dynamic graph, the complete dynamic behaviour of the modeled system can be studied, objective functions can be formulated, and optimal control strategies can be computed. The concept is applied to two different problems of supervisory control of batch plants in the chemical industry.
CITATION STYLE
Hanisch, H. M. (1993). Analysis of place/transition nets with timed arcs and its application to batch process control. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 691 LNCS, pp. 282–299). Springer Verlag. https://doi.org/10.1007/3-540-56863-8_52
Mendeley helps you to discover research relevant for your work.