Predictability and control synthesis
Kybernetika, Tome 35 (1999) no. 1, p. [25].

Voir la notice de l'article dans Czech Digital Mathematics Library

Processes modeled by a timed event graph may be represented by a linear model in dioïd algebra. The aim of this paper is to make temporal control synthesis when state vector is unknown. This information loss is compensated by the use of a simple model, the “ARMA” equations, which enables to introduce the concept of predictability. The comparison of the predictable output trajectory with the desired output determines the reachability of the objective.
Classification : 93B25, 93B50, 93C30, 93C65, 93C83
Mots-clés : synthesis problems; predictability; ARMA model; Dioid algebra; reachability of the objective 
@article{KYB_1999__35_1_a3,
     author = {Declerck, Philippe},
     title = {Predictability and control synthesis},
     journal = {Kybernetika},
     pages = {[25]},
     publisher = {mathdoc},
     volume = {35},
     number = {1},
     year = {1999},
     mrnumber = {1705528},
     zbl = {1274.93188},
     language = {en},
     url = {https://geodesic-test.mathdoc.fr/item/KYB_1999__35_1_a3/}
}
TY  - JOUR
AU  - Declerck, Philippe
TI  - Predictability and control synthesis
JO  - Kybernetika
PY  - 1999
SP  - [25]
VL  - 35
IS  - 1
PB  - mathdoc
UR  - https://geodesic-test.mathdoc.fr/item/KYB_1999__35_1_a3/
LA  - en
ID  - KYB_1999__35_1_a3
ER  - 
%0 Journal Article
%A Declerck, Philippe
%T Predictability and control synthesis
%J Kybernetika
%D 1999
%P [25]
%V 35
%N 1
%I mathdoc
%U https://geodesic-test.mathdoc.fr/item/KYB_1999__35_1_a3/
%G en
%F KYB_1999__35_1_a3
Declerck, Philippe. Predictability and control synthesis. Kybernetika, Tome 35 (1999) no. 1, p. [25]. https://geodesic-test.mathdoc.fr/item/KYB_1999__35_1_a3/