Predictability and control synthesis in Timed Event Graphs - Archive ouverte HAL Accéder directement au contenu
Article Dans Une Revue Kybernetika Année : 1999

Predictability and control synthesis in Timed Event Graphs

Résumé

Processes modeled by a timed event graph may be presented 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.
Fichier principal
Vignette du fichier
Kybernetika_35_1999_LISA.pdf (3.96 Mo) Télécharger le fichier
Origine : Fichiers produits par l'(les) auteur(s)

Dates et versions

hal-00844540 , version 1 (15-07-2013)

Identifiants

  • HAL Id : hal-00844540 , version 1

Citer

Philippe Declerck. Predictability and control synthesis in Timed Event Graphs. Kybernetika, 1999, 35 (1), pp.25-38. ⟨hal-00844540⟩

Collections

UNIV-ANGERS
56 Consultations
32 Téléchargements

Partager

Gmail Facebook X LinkedIn More