Implicit control systems: Properties, algorithmic tests and their computer algebra implementation

Abstract

This contribution discusses symbolic algorithms for tests on properties of implicit control systems (DAEs), like observability, accessibility or identifiability. The algorithms related to observability and accessibility have already been published. The focus lies on those operations performed in a computer algebra system which are common for all these tests. I particular operations based on Groebner bases are applied to carry out the necessary elimination in the case of polynomial nonlinearities. Furthermore some features of the implemented package DA Egeom in the computer algebra system MAPLE are discussed and finally the package is applied to the mathematical model of the VTOL aircraft. It is available via the institutes homepage.