Identification of Petri Nets from Knowledge of Their Language

Authors:
Maria Paola Cabasino;Alessandro Giua;Carla Seatzu
Affiliations:
Department of Electrical and Electronic Engineering, University of Cagliari, Cagliari, Italy 09123;Department of Electrical and Electronic Engineering, University of Cagliari, Cagliari, Italy 09123;Department of Electrical and Electronic Engineering, University of Cagliari, Cagliari, Italy 09123
Venue:
Discrete Event Dynamic Systems
Year:
2007

Citing 0
Cited 2

Brief paper: On-line fault detection in discrete event systems by Petri nets and integer linear programming

Automatica (Journal of IFAC)
Improving real-time identification of Petri nets using timing information

ETFA'09 Proceedings of the 14th IEEE international conference on Emerging technologies & factory automation

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this paper we deal with the problem of identifying a Petri net system, given a finite language generated by it. First we consider the problem of identifying a free labeled Petri net system, i.e., 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 extend this approach in several ways introducing additional information about the model (structural constraints, conservative components, stationary sequences) or about its initial marking. We also treat the problem of synthesizing a bounded net system starting from an automaton that generates its language. Finally, we 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.