Parameter identifiability is a structural property of an ODE model for recovering the values of parameters from the data (i.e., from the input and output variables). This property is a prerequisite for meaningful parameter identification in practice. In the presence of nonidentifiability, it is important to find all functions of the parameters that are identifiable. The existing algorithms check whether a given function of parameters is identifiable or, under the solvability condition, find all identifiable functions.  Our first main result is an algorithm that computes all identifiable functions without any additional assumptions  . Our second main result concerns the identifiability from multiple experiments  . For this problem, we show that the set of functions identifiable from multiple experiments is what would actually be computed by input-output equation-based algorithms if the solvability condition is not fulfilled . We give an algorithm that not only finds these functions but also provides an upper bound for the number of experiments to be performed to identify these functions. We provide an implementation of the presented algorithms.
Parameter identifiability is a structural property of an ODE model for recovering the values of parameters from the data (i.e., from the input and output variables). This property is a prerequisite for meaningful parameter identification in practice. In the presence of nonidentifiability, it is important to find all functions of the parameters that are identifiable. The existing algorithms check whether a given function of parameters is identifiable or, under the solvability condition, find all identifiable functions. However, this solvability condition is not always satisfied, which presents a challenge. Our first main result is an algorithm that computes all identifiable functions without any additional assumptions , which is the first such algorithm as far as we know . Our second main result concerns the identifiability from multiple experiments (with generically different inputs and initial conditions among the experiments) . For this problem, we prove that the set of functions identifiable from multiple experiments is what would actually be computed by input-output equation-based algorithms (whether or not the solvability condition is fulfilled), which was not known before . We give an algorithm that not only finds these functions but also provides an upper bound for the number of experiments to be performed to identify these functions. We provide an implementation of the presented algorithms.
A
However, this solvability condition is not always satisfied, which presents a challenge.
A
, which is the first such algorithm as far as we know
A
(with generically different inputs and initial conditions among the experiments)
R
show
prove
R
if
(whether or not
R
not fulfilled
fulfilled), which was not known before