Name
Abstract | ||
|---|---|---|
Continuous Petri nets can be viewed as an approximation of the classical discrete models introduced to cope with the state explosion problem typical of discrete event systems. In this paper we consider free-labeled Petri net systems, and assume that certain transitions, including all those modeling faulty behaviors, are unobservable, i.e., they are labeled with the empty word.Based on the notion and characterization of the set of justifications of a given observation (and the corresponding set off-vectors), we provide a diagnosis approach using the solution of a certain number of linear programming problems. |
Year | DOI | Venue |
|---|---|---|
2009 | 10.1109/CCA.2009.5281084 | 2009 IEEE CONTROL APPLICATIONS CCA & INTELLIGENT CONTROL (ISIC), VOLS 1-3 |
Keywords | Field | DocType |
automata,computational complexity,copper,computational modeling,linear programming problems,petri nets,intelligent control,petri net,linear program,data mining,context modeling,linear programming | Petri net,Computer science,Automaton,Stochastic Petri net,Context model,Theoretical computer science,Process architecture,Linear programming,Unobservable,Computational complexity theory | Conference |
ISSN | Citations | PageRank |
1085-1992 | 1 | 0.35 |
References | Authors | |
17 | 4 | |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Carla Seatzu | 1 | 700 | 67.51 |
| Cristian Mahulea | 2 | 161 | 19.50 |
| Maria Paola Cabasino | 3 | 318 | 23.10 |
| Silva, M. | 4 | 316 | 36.61 |