It is known that the Berlekamp-Massey algorithm from information theor
y can be used to compute scalar minimal partial realizations. Recently
, it has been interpreted in terms of exact modeling of behaviors. In
this paper, we extend these results to the multivariable case. We put
the behavioral theory of exact modeling to work in deriving an extensi
on of the Berlekamp-Massey algorithm for computing multivariable minim
al partial realizations. (C) 1997 Elsevier Science B.V.