The paper addresses the problem of the on-line identification of Petri Nets (PNs) modeling Discrete Event Systems (DESs) that exhibit unobservable events. The identifier monitors the DES events and the corresponding available place markings. Assuming that the observable transition set, the place set and the corresponding PN structure are known, at each event occurrence an identification algorithm defines and solves some integer linear programming problems. We prove that the complete PN system describing both the observable and unobservable DES behavior is recursively identified. An example shows an application of the proposed technique.
On-Line Identification of Petri Nets with Unobservable Transitions / Dotoli, M; Fanti, Mp; Mangini, Am; Ukovich, W. - STAMPA. - (2008), pp. 4605988.449-4605988.454. (Intervento presentato al convegno 9th International Workshop on Discrete Event Systems, WODES' 08 tenutosi a Göteborg, Sweden nel May 28-30, 2008) [10.1109/WODES.2008.4605988].
On-Line Identification of Petri Nets with Unobservable Transitions
Dotoli, M;Fanti, MP;Mangini, AM;
2008
Abstract
The paper addresses the problem of the on-line identification of Petri Nets (PNs) modeling Discrete Event Systems (DESs) that exhibit unobservable events. The identifier monitors the DES events and the corresponding available place markings. Assuming that the observable transition set, the place set and the corresponding PN structure are known, at each event occurrence an identification algorithm defines and solves some integer linear programming problems. We prove that the complete PN system describing both the observable and unobservable DES behavior is recursively identified. An example shows an application of the proposed technique.I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.
