Global identifiability analysis using algorithms for detecting connected semi-algebraic components

The global identifiability problem of linear systems from a tuple of invariants of the system is separated into two different problems. Once we fix a nominal point of interest θˆ, we can check the local identifiability at that point. In addition we provide two algorithms for checking the existence of other remote points θ in the parameter domain, indistinguishable from θˆ. The approach is based on the assumptions that there exists a finite complete set of invariants and that both the invariants and feasible parameter domain are given by polynomials