Petrinets and Systems Theory

Abstract

Petrinets are efficient and powerful formalism for simulation, analysis and control of discrete event systems. In the last two decades many researchers have devoted their efforts of study Petrinets as an automatic control model. There are four significant areas to be investigated in this automatics control systems (i) The Control Problem (ii) The Deadlock Situation (iii) Observability (iv) Identification (i) The use of Petrinets for the control of discrete event systems in finding a control law that constraints the controlled system behavior to satisfy a given specifications [29]. (ii) A deadlock represents an anomalous state from which no further evaluation is possible. This is an issue that appears in most practical applications and appropriate strategies should be adopted in order to prevent it [47]. (iii) The observability problem is that of determining efficient ways of reconstructing the state of a net based on observed events occurrence and/or on partial marking observation [47]. (iv) Identification problem consists in determining a Petrinet system starting from examples/counter examples of its language or from the structure of its reachability (or) coverability graph [30,31]. newline