Controllability and observability of linear differential behaviors

Two central definitions in systems theory are controllability and observability. For state-space systems, controllability is defined as the possibility of transferring the state from any initial to any terminal value, while observability is defined as the possibility of deducing the state from an observed output. Recently (J.W. Polderman et al., 1998), a more general definition has been put forward that generalizes these notions to more general model classes. A number of conditions have been derived that allow one to deduce the controllability of a system described by the system of differential equations R/sub 0/w+R/sub 1/dw/dt+...+R/sub L/d/sup L/w/dt/sup L/=0, with R/sub i//spl isin/R/sup p/spl times/q/ and observability for R/sub 0/w/sub 1/+R/sub 1/dw/sub 1//dt+...+R/sub L/d/sup L/w/sub 1//dt/sup L/=M/sub 0/w/sub 2/+M/sub 1/dw/sub 2//dt+...+M/sub N/d/sup N/w/sub 2//dt/sup N/, with R/sub i//spl isin/R/sup p/spl times/q/ and M/sub i//spl isin/R/sup p/spl times/l/. However, the conditions of Polderman et al. are not explicit in the coefficient matrices (R/sub 0/, ...R/sub L/) or (M/sub 0/, ...M/sub N/). J. Hoffmann (1994) derived conditions of such an explicit nature but, in the controllability case for example, they involve checking the rank of a matrix of dimension Lpq/spl times/L(p+1)q. This paper derives conditions in terms of (R/sub 0/, ...R/sub L/) or (M/sub 0/, ...M/sub N/). The conditions involve explicit rank tests and are presented as a recursive algorithm in MATLAB-style pseudocode. The algorithm generalizes the familiar (B, AB, ..., A/sup n-1/B) or (C/sup T/, A/sup T/C/sup T/, ...(A/sup T/)/sup n-1/C/sup T/) rank test for state-space systems and the Euclidean algorithm for checking co-primeness of two polynomials.