skip to main content
10.1145/2666202.2666207acmotherconferencesArticle/Chapter ViewAbstractPublication PageseooltConference Proceedingsconference-collections
research-article

Towards utilizing repeating structures for constant time compilation of large Modelica models

Published: 10 October 2014 Publication History

Abstract

Modelica is a language for modeling and simulating complex physical systems. A Modelica compiler generates a differential-algebraic equation (DAE) system from Modelica source code. The physical system is simulated by solving the DAE numerically. Before this can be done, the Pantelides algorithm is often applied to reduce the index of the DAE.
Modelica's ability of structured programming makes it easy to describe physical systems with a repeating structure, like a roller chain, a battery pack or a solar panel. Such Modelica models generate DAE systems with many repeated sections. The Pantelides algorithm is not capable of using and preserving these repeating structures. As a consequence Modelica compilers need to unroll such structures. Huge memory consumption and the generation of bulky source code for the numerical solver is often a consequence.
This article discusses techniques, which make it possible to preserve and use repeating structures during Pantelides index reduction. It is shown how the search for augmenting paths and the calculation of minimal structural singular subsets can be shortened. The method is restricted to repetitions, which are described by non-nested for-loops.

References

[1]
J. Frenkel, C. Schubert, G. Kunze, P. Fritzson, M. Sjölund, and A. Pop. Towards a benchmark suite for Modelica compilers: Large models. In Modelica'2011: The 8th International Modelica Conference, 2011.
[2]
P. Fritzson. Principles of Object-Oriented Modeling and Simulation with Modelica 2.1. Wiley, 2010.
[3]
C. Höger. Separate compilation of causalized equations-work in progress. EOOLT, 56:113--120, 2011.
[4]
C. Höger. Operational semantics for a modular equation language. AVICPS, page 5, 2013.
[5]
S. E. Mattsson and G. Söderlind. Index reduction in differential-algebraic equations using dummy derivatives. SIAM J. Sci. Comput., 14(3):677--692, May 1993.
[6]
C. Pantelides. The consistent initialization of differential-algebraic systems. SIAM Journal on Scientific and Statistical Computing, 9(2):213--231, 1988.
[7]
M. D. Plummer and L. Lovász. Matching theory. Elsevier, 1986.
[8]
J. Pryce. A simple structural analysis method for DAEs. BIT Numerical Mathematics, 41(2):364--394, 2001.
[9]
D. Zimmer. Module-preserving compilation of Modelica models. In Proc. of the 7th International Modelica Conference, Como, Italy, 2009.

Cited By

View all
  • (2019)Set-based graph methods for fast equation sorting in large DAE systemsProceedings of the 9th International Workshop on Equation-based Object-oriented Modeling Languages and Tools10.1145/3365984.3365991(45-54)Online publication date: 5-Nov-2019

Index Terms

  1. Towards utilizing repeating structures for constant time compilation of large Modelica models

    Recommendations

    Comments

    Information & Contributors

    Information

    Published In

    cover image ACM Other conferences
    EOOLT '14: Proceedings of the 6th International Workshop on Equation-Based Object-Oriented Modeling Languages and Tools
    October 2014
    87 pages
    ISBN:9781450329538
    DOI:10.1145/2666202
    • General Chair:
    • Peter Pepper,
    • Program Chair:
    • David Broman
    Permission to make digital or hard copies of part or all of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for third-party components of this work must be honored. For all other uses, contact the Owner/Author.

    Publisher

    Association for Computing Machinery

    New York, NY, United States

    Publication History

    Published: 10 October 2014

    Check for updates

    Author Tags

    1. Modelica
    2. differential-algebraic equations
    3. index reduction
    4. matching theory
    5. pantelides algorithm

    Qualifiers

    • Research-article

    Conference

    EOOLT 2014

    Acceptance Rates

    Overall Acceptance Rate 10 of 11 submissions, 91%

    Contributors

    Other Metrics

    Bibliometrics & Citations

    Bibliometrics

    Article Metrics

    • Downloads (Last 12 months)6
    • Downloads (Last 6 weeks)0
    Reflects downloads up to 05 Mar 2025

    Other Metrics

    Citations

    Cited By

    View all
    • (2019)Set-based graph methods for fast equation sorting in large DAE systemsProceedings of the 9th International Workshop on Equation-based Object-oriented Modeling Languages and Tools10.1145/3365984.3365991(45-54)Online publication date: 5-Nov-2019

    View Options

    Login options

    View options

    PDF

    View or Download as a PDF file.

    PDF

    eReader

    View online with eReader.

    eReader

    Figures

    Tables

    Media

    Share

    Share

    Share this Publication link

    Share on social media