Identification of free-labeled Petri nets via integer programming

In this paper we deal with the problem of identifying a Petri net system, given a finite language that it generates. In particular, we consider the problem of identifying a free-labeled Petri net system, i.e., a net system where each transition is assigned a unique label. We show that the identification problem can be solved via an integer programming problem. We also discuss how additional structural constraints can be easily imposed to the net.

[1]  Tadao Murata,et al.  Petri nets: Properties, analysis and applications , 1989, Proc. IEEE.

[2]  Manuel Silva Suárez,et al.  Petri nets and integrality relaxations: A view of continuous Petri net models , 2002, IEEE Trans. Syst. Man Cybern. Part C.

[3]  Manuel Silva Suárez,et al.  Steady-state performance evaluation of continuous mono-T-semiflow Petri nets , 2005, Autom..

[4]  Philippe Darondeau,et al.  Theory of Regions , 1996, Petri Nets.

[5]  Alberto Bemporad,et al.  Control of systems integrating logic, dynamics, and constraints , 1999, Autom..

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

[7]  E. Lopez-Mellado,et al.  Required event sequences for identification of Discrete Event Systems , 2003, 42nd IEEE International Conference on Decision and Control (IEEE Cat. No.03CH37475).

[8]  Manuel Silva Suárez,et al.  Autonomous Continuous P/T Systems , 1999, ICATPN.

[9]  Manuel Silva Suárez,et al.  Relaxed continuous views of discrete event systems: considerations on Forrester diagrams and Petri nets , 2004, 2004 IEEE International Conference on Systems, Man and Cybernetics (IEEE Cat. No.04CH37583).

[10]  E. Lopez-Mellado,et al.  Incremental synthesis of Petri net models for identification of discrete event systems , 2002, Proceedings of the 41st IEEE Conference on Decision and Control, 2002..

[11]  Manuel Silva,et al.  On Fluidification of Petri Nets: From Discrete to Hybrid and Continuous Models , 2003, ADHS.

[12]  Manuel Silva Suárez,et al.  Design of observers for timed continuous Petri net systems , 2004, 2004 IEEE International Conference on Systems, Man and Cybernetics (IEEE Cat. No.04CH37583).

[13]  E. Mark Gold,et al.  Complexity of Automaton Identification from Given Data , 1978, Inf. Control..

[14]  T. Murata.  State equation, controllability, and maximal matchings of petri nets , 1977 .

[15]  Dana Angluin,et al.  Inference of Reversible Languages , 1982, JACM.

[16]  Manuel Silva,et al.  Introducing Petri nets , 1993 .

[17]  Wolfgang Reisig,et al.  Lectures on Petri Nets I: Basic Models , 1996, Lecture Notes in Computer Science.

[18]  J. H. Schuppen.  System theory for system identification , 2004 .

[19]  Kunihiko Hiraishi.  Construction of a Class of Safe Petri Nets by Presenting Firing Sequences , 1992, Application and Theory of Petri Nets.

[20]  Manuel Silva Suárez,et al.  Choice-free Petri nets: a model for deterministic concurrent systems with bulk services and arrivals , 1997, IEEE Trans. Syst. Man Cybern. Part A.