Identification of Petri nets from knowledge of their language

DOI10.1007/S10626-007-0025-0MaRDI QIDQ2465425zbMATH OpenOpenAlexFDO

Authors Maria Paola Cabasino, Alessandro Giua, C. Seatzu

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

IdentificationInteger programming problemPetri nets

Mathematics Subject Classification ID

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

Recommendations

• Real time identification of discrete event systems using Petri nets
• scientific article; zbMATH DE number 512821
• Model identification of unobservable behavior of discrete event systems using Petri nets
• scientific article; zbMATH DE number 3991345
• Synthesis of Petri nets from finite partial languages

Cites work

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

Cited in

(18)

• On-line fault detection in discrete event systems by Petri nets and integer linear programming
• 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 of \(\lambda\)-free labeled Petri nets with contact-free nondeterministic transitions
• A comparative analysis of recent identification approaches for discrete-event systems
• Model identification of unobservable behavior of discrete event systems using Petri nets
• Discrete event system identification with the aim of fault detection
• Fault model identification and synthesis in Petri nets
• Real time identification of discrete event systems using Petri nets
• Diagnosability enforcement in labeled Petri nets using supervisory control
• Discovering Petri nets including silent transitions. A repairing approach based on structural patterns
• Petri Net Synthesis for Restricted Classes of Nets
• Learning of finite coded Petri net languages
• scientific article; zbMATH DE number 3991345 (Why is no real title available?)
• Realization of Petrinets: a system theoretic approach
• Input-output identification of controlled discrete manufacturing systems
• Identification of labeled Petri nets from finite automata
• Enhancement of Petri nets identified from discrete-event processes by scheduling t-components

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2465425)