State estimation of -free labeled Petri nets with contact-free nondeterministic transitions

DOI10.1007/S10626-005-5239-4MaRDI QIDQ1773100zbMATH OpenOpenAlexFDO

Authors Alessandro Giua, Daniele Corona, C. Seatzu

Publication date 25 April 2005

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

Full work available at URL https://doi.org/10.1007/s10626-005-5239-4

zbMATH Keywords

labeled netsmarking estimationobserverPetri nets

Mathematics Subject Classification ID

Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85) Observability (93B07) Discrete event control/observation systems (93C65) Estimation and detection in stochastic control theory (93E10)

Review text

The problem of estimating the markings of a labeled Petri net with nondeterministic transitions is considered. The nondeterminism is due to the presence of transitions that share the same label and that can be simultaneously enabled. It is assumed that i) the structure of the net is known; ii) the initial marking is known; iii) the transition labels can be observed; iv) the nondeterministic transitions are contact-free. Under these assumptions a technique for characterizing the set of markings that are consistent with the actual observation is given. This set of markings can be represented by a linear system with a fixed structure.

Recommendations

• Petri nets at modelling and control of discrete-event systems with nondeterminism. II
• Identification of Petri nets from knowledge of their language
• Decentralized state estimation and diagnosis of p-time labeled Petri nets systems
• Design of supervisors for linear marking specifications in labeled Petri nets
• Characterisation of the state spaces of marked graph Petri nets

Cites work

• scientific article; zbMATH DE number 3722109 (Why is no real title available?)
• Observability of discrete event dynamic systems
• Observability of place/transition nets
• Observer-Based State-Feedback Control of Timed Petri Nets With Deadlock Recovery
• Petri net languages and infinite subsets of \(\mathbb{N}^m\)
• Predicates and predicate transformers for supervisory control of discrete event dynamical systems
• State estimation of \(\lambda\)-free labeled Petri nets with contact-free nondeterministic transitions

Cited in

(14)

• Observer synthesis for linear hybrid systems with constrained discrete dynamics
• State estimation of \(\lambda\)-free labeled Petri nets with contact-free nondeterministic transitions
• Modeling, simulation, estimation and boundedness analysis of discrete event systems
• State estimation of max-plus automata with unobservable events
• Real time identification of discrete event systems using Petri nets
• Identification of Petri nets from knowledge of their language
• State Estimation and Fault Detection Using Petri Nets
• Hybrid state feedback stabilization withl₂performance for discrete-time switched linear systems
• Some Remarks on “State Estimation and Fault Diagnosis of Labeled Time Petri Net Systems With Unobservable Transitions”
• Least-cost transition sequence estimation in labelled time Petri net systems with unobservable transitions
• State estimation in labeled time Petri net systems using observed modified state class graph
• On-line monitoring of large Petri net models under partial observation
• Fault diagnosis in discrete event systems modeled by partially observed Petri nets
• Model approximation for batch flow shop scheduling with fixed batch sizes

This page was built for publication: State estimation of \(\lambda\)-free labeled Petri nets with contact-free nondeterministic transitions

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