Identification of place/transition nets

In this talk we examine the problem of identifying a Petri net system, given a finite language that it generates. First we consider the problem of identifying a free labeled Petri net system, namely all transition labels are distinct. The set of transitions and the number of places is assumed to be known, while the net structure and the initial marking are computed solving an integer programming problem. Then we show how this approach can be extended in several ways introducing additional information about the model (structural constraints, conservative components, stationary sequences) or about its initial marking. We briefly show how the approach can also be generalized to the case of labeled Petri nets, where two or more transitions may share the same label. In particular, in this case we impose that the resulting net system is deterministic. In both cases the identification problem can still be solved via an integer programming problem. The main drawback of this approach is its computational complexity. Finally, we show how to tackle the same problem using linear programming techniques, thus significantly reducing the complexity of solving an identification problem.
Maria Paola Cabasino received the Laurea degree in electronic engineering from the University of Cagliari, Cagliari, Italy, in 2005. She is a Ph.D. student on Automatic Control at the Department of Electrical and Electronic Engineering of the University of Cagliari under the supervision of Prof. Alessandro Giua and Prof. Carla Seatzu. Her research is based on the identification and diagnosis of discrete event and hybrid systems focusing on Petri nets. She has been a visiting researcher at the University of Illinois (Urbana-Champaign, IL, US) and at the University of Zaragoza, (Zaragoza, Spain). She is now visiting the University of Michigan, (Ann Arbor, MI, US) until December 8.