 Efficient connection processing in equation–based object–oriented modelsDenise Marzorati, Joaquin Fernández and Ernesto Kofman Applied Mathematics and Computation, 2022, vol. 418, issue C Abstract: This work introduces a novel methodology for transforming a large set of connections into the corresponding set of equations as required by the flattening stage of the compilation process of object oriented models. 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, has the remarkable property of achieving constant computational costs with respect to the number of vertices and edges contained in each set. That way, under the mentioned restrictions, the proposed methodology can transform a large set of connections into the corresponding set of equations within a time that is independent on the size of the arrays contained in the model. Keywords: Large scale models; Connected components; Set–Based graphs; Modelica (search for similar items in EconPapers) Downloads: (external link) Related works: Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text Persistent link: https://EconPapers.repec.org/RePEc:eee:apmaco:v:418:y:2022:i:c:s0096300321009255 DOI: 10.1016/j.amc.2021.126842 Access Statistics for this article Applied Mathematics and Computation is currently edited by Theodore Simos More articles in Applied Mathematics and Computation from Elsevier |
Is your work missing from RePEc? Here is how to contribute.
Questions or problems? Check the EconPapers FAQ or send mail to .
EconPapers is hosted by the
School of Business at Örebro University.