Two algorithms arising in analysis of polynomial models
Dragan Nešić · 1998
Algorithms for testing observability and forward accessibility of discrete-time polynomial systems are presented. The algorithms are based on symbolic computation packages-the Grobner basis method and QEP-CAD. The observability test checks observability of general polynomial systems in finite time. Forward accessibility test is applicable to a large class of polynomial systems and also stops in finite time.