On the boolean minimal realization problem in the max-plus algebra
β Scribed by Bart De Schutter; Vincent Blondel; Remco de Vries; Bart De Moor
- Publisher
- Elsevier Science
- Year
- 1998
- Tongue
- English
- Weight
- 127 KB
- Volume
- 35
- Category
- Article
- ISSN
- 0167-6911
No coin nor oath required. For personal study only.
β¦ Synopsis
One of the open problems in the max-plus-algebraic system theory for discrete event systems is the minimal realization problem. In this paper we present some results in connection with the minimal realization problem in the max-plus algebra. First we characterize the minimal system order of a max-linear discrete event system. We also introduce a canonical representation of the impulse response of a max-linear discrete event system. Next we consider a simpliΓΏed version of the general minimal realization problem: the boolean minimal realization problem, i.e., we consider models in which the entries of the system matrices are either equal to the max-plus-algebraic zero element or to the max-plus-algebraic identity element. We give a lower bound for the minimal system order of a max-plus-algebraic boolean discrete event system. We show that the decision problem that corresponds to the boolean realization problem (i.e., deciding whether or not a boolean realization of a given order exists) is decidable, and that the boolean minimal realization problem can be solved in a number of elementary operations that is bounded from above by an exponential of the square of (any upper bound of) the minimal system order. We also point out some open problems, the most important of which is whether or not the boolean minimal realization problem can be solved in polynomial time.
π SIMILAR VOLUMES
We discuss the characteristic equation of a matrix in the max-plus algebra. In their Linear Algebra Appl. paper [101:87-108 (1988)] Olsder and Roos have used a transformation between the max-plus algebra and linear algebra to show that the Cayley-Hamilton theorem also holds in the maw-plus algebra.
## Abstract We consider the sets definable in the countable models of a weakly oβminimal theory __T__ of totally ordered structures. We investigate under which conditions their Boolean algebras are isomorphic (hence __T__ is pβ__Ο__βcategorical), in other words when each of these definable sets adm