Notes on strict system equivalence
Lars Pernebo
Abstract
Lars Pernebo
Abstract
It is shown that strict system equivalence in Rosenbrock's sense is equivalent to the existence of a certain bijective mapping between the sets of solutions to the differential equations describing the system. This leads to a simple proof of the fact that the equivalence classes under strict system equivalence are well defined, although the dimension of the system matrix is not uniquely defined. It is also shown that equivalence in Wolovich's sense is the same as strict system equivalence.
OpenAlex reports 55 citations for this work. Citation counts describe recorded attention and do not establish research quality.
A contribution statement is not available in the OpenAlex record.
Method details are not available in the OpenAlex metadata.
Findings are not separately available in the OpenAlex metadata.
Limitations are not available in the OpenAlex metadata.
Application details are not available in the OpenAlex metadata.
It is shown that strict system equivalence in Rosenbrock's sense is equivalent to the existence of a certain bijective mapping between the sets of solutions to the differential equations describing the system. This leads to a simple proof of the fact that the equivalence classes under strict system equivalence are well defined, although the dimension of the system matrix is not uniquely defined. It is also shown that equivalence in Wolovich's sense is the same as strict system equivalence.
Key concepts: Equivalence (formal languages), Matrix equivalence, Mathematics, Bijection, Logical equivalence, Pure mathematics, Algebra over a field, Discrete mathematics