Real time identification of discrete event systems by Petri Nets

Abstract The paper defines the identification problem for discrete event systems as the problem of inferring a Petri Net (PN) model using the observation of the events and the available output vectors. The transition and place sets are assumed unknown and only an upper bound of the number of places is given. Hence, the identification problem is solved by an algorithm that stores in real-time the occurred events and the corresponding output vectors. An integer linear programming problem is defined and solved at each observation so that the PN system can be recursively identified. An example shows the flexibility and simplicity of the proposed technique.

[1]  James Lyle Peterson,et al.  Petri net theory and the modeling of systems , 1981 .

[2]  Philippe Darondeau,et al.  The Synthesis Problem for Elementary Net Systems is NP-Complete , 1997, Theor. Comput. Sci..

[3]  Alessandro Giua,et al.  Petri Net Languages and Infinite Subsets of m , 1999, J. Comput. Syst. Sci..

[4]  C. Seatzu,et al.  Identification of free-labeled Petri nets via integer programming , 2005, Proceedings of the 44th IEEE Conference on Decision and Control.

[5]  M. Dotoli,et al.  An Optimization Approach for Identification of Petri Nets , 2006, 2006 8th International Workshop on Discrete Event Systems.

[6]  C. Seatzu,et al.  Identification of deterministic Petri nets , 2006, 2006 8th International Workshop on Discrete Event Systems.

[7]  Ramavarapu S. Sreenivas On minimal representations of Petri net languages , 2006, IEEE Transactions on Automatic Control.