Efficient connection processing in equation–based object–oriented models

Highlights：

• A novel methodology for transforming a large set of connections into the corresponding set of equations is presented.

• The proposed methodology uses a compact representation of the connections in the form of a Set-Based Graph, in which different sets of vertices and different sets of edges are formed exploiting the presence of regular structures.

• Using this compact representation, a novel algorithm is proposed to find the connected components of the Set-Based Graph. This algorithm, under certain restrictions, achieves constant computational costs with respect to the number of vertices and edges contained in each set.

• The work describes the algorithm, its implementation in a Modelica compiler and shows its application in different examples.

摘要

•A novel methodology for transforming a large set of connections into the corresponding set of equations is presented.•The proposed methodology uses a compact representation of the connections in the form of a Set-Based Graph, in which different sets of vertices and different sets of edges are formed exploiting the presence of regular structures.•Using this compact representation, a novel algorithm is proposed to find the connected components of the Set-Based Graph. This algorithm, under certain restrictions, achieves constant computational costs with respect to the number of vertices and edges contained in each set.•The work describes the algorithm, its implementation in a Modelica compiler and shows its application in different examples.

论文评审过程：Received 23 August 2021, Revised 18 November 2021, Accepted 26 November 2021, Available online 15 December 2021, Version of Record 15 December 2021.