Automated Static Analysis of Equation-Based Components
Authors:
- 1 July 2004
- journal article
- research article
- Published by SAGE Publications in SIMULATION
- Vol. 80 (7-8) , 321-345
Abstract
Mathematical modeling and the simulation of complex physical systems are emerging as key technologies in engineering. The availability of static analyzers and automatic debuggers for detecting structural and numerical inconsistencies in the simulation models is crucial. To address this need, the authors propose a methodology for detecting and repairing overconstrained and underconstrained situations based on graph-theoretical approaches. Components and equations that cause the irregularities are automatically isolated, and meaningful error messages for the user are elaborated. The authors have implemented the AMOEBA (Automatic Modelica Equation-Based Analyzer) environment to support the development and specification of correct equation-based simulation models by applying graph-theoretical approaches and semiautomatic debugging techniques. The implementation architecture and preliminary experiments with a prototype debugger integrated in the symbolic and numeric engine, ModSimPack, of the Modelica language compiler are presented and discussed.Keywords
This publication has 10 references indexed in Scilit:
- Scientific Computing with Ordinary Differential Equations2002
- Introduction to Physical Modeling with Modelica2001
- Detecting anomalies in constraint-based systemsEngineering Applications of Artificial Intelligence, 1997
- Finding all the perfect matchings in bipartite graphsApplied Mathematics Letters, 1994
- On Algorithms for Obtaining a Maximum TransversalACM Transactions on Mathematical Software, 1981
- Algorithm 575: Permutations for a Zero-Free Diagonal [F1]ACM Transactions on Mathematical Software, 1981
- An Implementation of Tarjan's Algorithm for the Block Triangularization of a MatrixACM Transactions on Mathematical Software, 1978
- Algorithm 529: Permutations To Block Triangular Form [F1]ACM Transactions on Mathematical Software, 1978
- An $n^{5/2} $ Algorithm for Maximum Matchings in Bipartite GraphsSIAM Journal on Computing, 1973
- Coverings of Bipartite GraphsCanadian Journal of Mathematics, 1958