Previous |  Up |  Next

Article

Title: Predictability and control synthesis (English)
Author: Declerck, Philippe
Language: English
Journal: Kybernetika
ISSN: 0023-5954
Volume: 35
Issue: 1
Year: 1999
Pages: [25]-38
Summary lang: English
.
Category: math
.
Summary: 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. (English)
Keyword: synthesis problems
Keyword: predictability
Keyword: ARMA model
Keyword: Dioid algebra
Keyword: reachability of the objective
MSC: 93B25
MSC: 93B50
MSC: 93C30
MSC: 93C65
MSC: 93C83
idZBL: Zbl 1274.93188
idMR: MR1705528
.
Date available: 2009-09-24T19:23:01Z
Last updated: 2015-03-27
Stable URL: http://hdl.handle.net/10338.dmlcz/135265
.
Reference: [1] Baccelli F., Cohen G., Olsder G. J., Quadrat J. P.: Synchronization and Linearity.An Algebra for Discrete Event Systems. Wiley, New York 1992 Zbl 0824.93003, MR 1204266
Reference: [2] Bracker H.: Algorithms and Applications in Timed Discrete Event Systems.Ph.D thesis, Delft University of Technology, 1993
Reference: [3] Brat G. P., Garg V. K.: A max–plus algebra of signals for the supervisory control of real–time discrete event systems.In: 9th Symposium of the IFAC on Information Control in Manufacturing, Nancy–Metz 1998
Reference: [4] Cofer D. D., Garg V. K.: A timed model for the control of discrete event systems involving decisions in the max/plus algebra.In: Proc. 31st Conference on Decision and Control, Tucson 1992
Reference: [5] Cofer D. D.: Control and Analysis of Real–Time Discrete Event Systems.Ph.D. Thesis, University of Texas, Austin 1995
Reference: [6] Cofer D. D., Garg V. K.: Supervisory control of real–time discrete–event systems using lattice theory.IEEE Trans. Automat. Control 41 (1996), 2, 199–209 Zbl 0846.93005, MR 1375752, 10.1109/9.481519
Reference: [7] Cohen G., Gaubert S., Quadrat J.-P.: From first to second–order theory of linear discrete event systems.In: 1st IFAC World Congress, Sydney 1993
Reference: [8] Declerck, Ph.: “ARMA” model and admissible trajectories in timed event graphs.In: CESA’96, IMACS, IEEE–SMC, Lille 1996
Reference: [9] Declerck, Ph.: Control synthesis using the state equations and the “ARMA” model in timed event graphs.In: 5th IEEE Mediterranean Conference on Control and Systems, Paphos 1997
Reference: [10] Declerck, Ph., Mares M.: Temporal control synthesis and failure recovery.In: 9th Symposium of the IFAC on Information Control in Manufacturing, Nancy–Metz 1998
Reference: [11] Gaubert S.: Théorie des systèmes linéaires dans les dioïdes.Ph.D Thesis, Ecole des Mines de Paris 1992
Reference: [12] Gazarik M. J., Kamen E. W.: Reachability and observability of linear systems over max–plus.In: 5th IEEE Mediterranean Conference on Control and Systems, Paphos 1997, revised version: Kybernetika 35 (1999), 2–12 MR 1705526
Reference: [13] Gondran M., Minoux M.: Graphes et algorithmes.Edition Eyrolles 1995 Zbl 1172.05001
Reference: [14] Prou J.-M., Wagneur E.: Controllability in the max–algebra.In: 5th IEEE Mediterranean Conference on Control and Systems, Paphos 1997, revised version: Kybernetika 35 (1999), 13–24 MR 1705527
.

Files

Files Size Format View
Kybernetika_35-1999-1_4.pdf 1.729Mb application/pdf View/Open
Back to standard record
Partner of
EuDML logo