Real time identification of discrete event systems using Petri nets

DOI10.1016/j.automatica.2007.10.014zbMath1283.93187OpenAlexW1993618162MaRDI QIDQ2440714

Agostino Marcello Mangini, Maria Pia Fanti, Mariagrazia Dotoli

Publication date: 19 March 2014

Published in: Automatica (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.automatica.2007.10.014

zbMATH Keywords

integer programmingPetri netsdiscrete event systemsidentification algorithms

Mathematics Subject Classification ID

Integer programming (90C10) System identification (93B30) Discrete event control/observation systems (93C65)

Related Items (13)

Stochastic DES fault diagnosis with coloured interpreted Petri nets ⋮ A comparative analysis of recent identification approaches for discrete-event systems ⋮ Model-based fault identification of discrete event systems using partially observed Petri nets ⋮ Identification of stochastic timed discrete event systems with st-IPN ⋮ State Estimation and Fault Detection Using Petri Nets ⋮ Model identification of unobservable behavior of discrete event systems using Petri nets ⋮ Input–output identification of controlled discrete manufacturing systems ⋮ Fault detection for discrete event systems using Petri nets with unobservable transitions ⋮ Discrete event system identification with the aim of fault detection ⋮ Diagnosis of Petri Nets ⋮ On-line fault detection in discrete event systems by Petri nets and integer linear programming ⋮ Fault model identification and synthesis in Petri nets ⋮ Modelling and feedback control for a class of Petri Nets with shared resources subject to strict time constraints using Max-plus algebra

Uses Software

• GLPK
• UMDES

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Suboptimal supervisory control of Petri nets in presence of uncontrollable transitions via monitor places
• Learning regular sets from queries and counterexamples
• The synthesis problem for elementary net systems is NP-complete
• State estimation of \(\lambda\)-free labeled Petri nets with contact-free nondeterministic transitions
• Petri net languages and infinite subsets of \(\mathbb{N}^m\)
• Identification of Petri nets from knowledge of their language
• Inductive inference of formal languages from positive data
• Deriving Petri nets from finite transition systems
• On Minimal Representations of Petri Net Languages
• Language identification in the limit

This page was built for publication: Real time identification of discrete event systems using Petri nets