Identification of Petri nets from knowledge of their language

DOI10.1007/s10626-007-0025-0zbMath1125.93332OpenAlexW2108629956MaRDI QIDQ2465425

Maria Paola Cabasino, Carla Seatzu, Alessandro Giua

Publication date: 4 January 2008

Published in: Discrete Event Dynamic Systems (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10626-007-0025-0

zbMATH Keywords

Petri netsIdentificationInteger programming problem

Mathematics Subject Classification ID

Integer programming (90C10) System identification (93B30) Discrete-time control/observation systems (93C55) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)

Related Items (11)

Diagnosability enforcement in labeled Petri nets using supervisory control ⋮ Discovering Petri nets including silent transitions. A repairing approach based on structural patterns ⋮ Real time identification of discrete event systems using 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 ⋮ Model identification of unobservable behavior of discrete event systems using Petri nets ⋮ Input–output identification of controlled discrete manufacturing systems ⋮ Discrete event system identification with the aim of fault detection ⋮ Petri Net Synthesis for Restricted Classes of Nets ⋮ On-line fault detection in discrete event systems by Petri nets and integer linear programming ⋮ Fault model identification and synthesis in Petri nets

Cites Work

• Unnamed Item
• Lexicographic bottleneck problems
• Control of systems integrating logic, dynamics, and constraints
• System theory for system identification.
• State estimation of \(\lambda\)-free labeled Petri nets with contact-free nondeterministic transitions
• The synthesis of Petri nets from path-automatic specifications
• Trace nets and process automata
• Towards Synthesis of Petri Nets from Scenarios
• Designing Reversibility-Enforcing Supervisors of Polynomial Complexity for Bounded Petri Nets Through the Theory of Regions
• Inference of Reversible Languages
• Complexity of automaton identification from given data

This page was built for publication: Identification of Petri nets from knowledge of their language