THEORY AND ALGORITHMS ON PERIOD ASSIGNMENT OF DISCRETE-EVENT DYNAMIC SYSTEMS
Wende Chen, Qi Xiang-Dong · Cybernetics & Systems · 1992
For a discrete-event dynamic system described by max algebra as X(£) −X(k − 1)A ⌖ V(k)B, all the eigenvalues λi 1 ≤ i ≤ ω in the right upper triangular standard form of A are called periods. It is proved in this paper that the periods can be assigned arbitrarily in [λI *plus; ∞) by state feedback U(k) = X(k)K if and only if A and B have matching standard forms. Algorithms on period assignment are also given.