Name
Abstract | ||
|---|---|---|
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. |
Year | DOI | Venue |
|---|---|---|
2009 | 10.1109/ACC.2009.5159893 | ACC'09 Proceedings of the 2009 conference on American Control Conference |
Keywords | DocType | ISSN |
discrete case,untimed continuous petri net,discrete event system,petri net,linear algebraic characterization,continuous petri net,observer design,certain transition,continuous system,computational complexity,model faulty behavior,empty word,linear algebra,observability,petri nets,copper,data mining,probability density function,filtering | Conference | 0743-1619 |
Citations | PageRank | References |
4 | 0.43 | 12 |
Authors | ||
5 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Cristian Mahulea | 1 | 161 | 19.50 |
| C. Seatzu | 2 | 109 | 8.29 |
| M. P. Cabasino | 3 | 4 | 0.43 |
| Laura Recalde | 4 | 37 | 3.34 |
| Manuel Silva | 5 | 405 | 37.39 |