Theory of linear and integer programming
Theory of linear and integer programming
State Estimation of λ-free Labeled Petri Nets with Contact-Free Nondeterministic Transitions*
Discrete Event Dynamic Systems
Automatica (Journal of IFAC)
On fluidization of discrete event models: observation and control of continuous Petri nets
Discrete Event Dynamic Systems
Hi-index | 0.00 |
Continuous Petri nets (conPNs) are an approximation of (discrete) Petri nets (PNs) introduced to cope with the state explosion problem typical of discrete event systems. We consider a free-labeled Petri net model and assume that certain transitions, including all that model faulty behaviors are unobservable, i.e., they are labeled with the empty word. We show how to design a marking observer that consists in a linear algebraic characterization of the set of markings that is consistent with a given observation. For some subclasses of nets the results can be extended to the discrete case where the computational complexity is much bigger than the one of continuous systems.