Name
Abstract | ||
|---|---|---|
Based on the (min,+)-linear system theory, the work developed here takes the set membership approach as a starting point in order to obtain a container for ultimately pseudo-periodic functions representative of Discrete Event Dynamic Systems. Such a container, by approximating the exact system, ensures to entirely include it in a guaranteed way. To reach that point, the container introduced in this paper is given as an interval, the bounds of which are a convex function for the upper approximation and a concave function for the lower approximation. Thanks to the characteristics of the bounds, the aim is both to reduce data storage (that can be very high when exact functions are handled) and to reduce the algorithm complexity of the operations of sum, inf-convolution and subadditive closure. These operations are integrated into inclusion functions, the algorithms of which are of linear or quasi-linear complexity. |
Year | DOI | Venue |
|---|---|---|
2014 | 10.1007/s10626-012-0148-9 | Discrete Event Dynamic Systems |
Keywords | DocType | Volume |
(Max,+) algebra,Discrete Event Dynamic Systems,Set membership approach,Algorithms,Computational complexity | Journal | 24 |
Issue | ISSN | Citations |
1 | 0924-6703 | 0 |
PageRank | References | Authors |
0.34 | 17 | 3 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Euriell Corronc | 1 | 3 | 2.16 |
| Bertrand Cottenceau | 2 | 120 | 15.81 |
| Laurent Hardouin | 3 | 171 | 28.97 |