Advanced

Symbolic Simplification Framework in a Modelica Compiler

Calvén, Johan LU and Kuhs, Zimon LU (2016) In LU-CS-EX 2016-25 EDA920 20161
Department of Computer Science
Abstract
The aim of the study is to develop a framework for symbolic simplification algorithms in the JModelica.org compiler. It should make the procedure of adding new algorithms to the compiler easier. Instead of the fixed order currently used in the compiler, algorithms will perform their simplifications to the model equations iteratively. This opens up the possibility for more simplifications being made, when all algorithms have access to the constantly updated, reduced and simplified model equations. We have implemented such a framework in the JModelica.org compiler
for the algorithms Alias Elimination and Variability Propagation. Also, we have designed a canonical form for equations to alleviate the implementation of new algorithms to the... (More)
The aim of the study is to develop a framework for symbolic simplification algorithms in the JModelica.org compiler. It should make the procedure of adding new algorithms to the compiler easier. Instead of the fixed order currently used in the compiler, algorithms will perform their simplifications to the model equations iteratively. This opens up the possibility for more simplifications being made, when all algorithms have access to the constantly updated, reduced and simplified model equations. We have implemented such a framework in the JModelica.org compiler
for the algorithms Alias Elimination and Variability Propagation. Also, we have designed a canonical form for equations to alleviate the implementation of new algorithms to the framework. The framework improves simulation time at the cost of increased compile time, whereas the effects of the canonical form remain to be evaluated. (Less)
Please use this url to cite or link to this publication:
author
Calvén, Johan LU and Kuhs, Zimon LU
supervisor
organization
course
EDA920 20161
year
type
H3 - Professional qualifications (4 Years - )
subject
keywords
algorithm, compiler, expression, framework, JModelica.org, Modelica, symbolic simplification, systems of equations, canonical form, normal form
publication/series
LU-CS-EX 2016-25
report number
LU-CS-EX 2016-25
ISSN
1650-2884
language
English
id
8886267
date added to LUP
2016-07-01 16:39:23
date last changed
2016-07-01 16:39:23
@misc{8886267,
  abstract     = {The aim of the study is to develop a framework for symbolic simplification algorithms in the JModelica.org compiler. It should make the procedure of adding new algorithms to the compiler easier. Instead of the fixed order currently used in the compiler, algorithms will perform their simplifications to the model equations iteratively. This opens up the possibility for more simplifications being made, when all algorithms have access to the constantly updated, reduced and simplified model equations. We have implemented such a framework in the JModelica.org compiler
for the algorithms Alias Elimination and Variability Propagation. Also, we have designed a canonical form for equations to alleviate the implementation of new algorithms to the framework. The framework improves simulation time at the cost of increased compile time, whereas the effects of the canonical form remain to be evaluated.},
  author       = {Calvén, Johan and Kuhs, Zimon},
  issn         = {1650-2884},
  keyword      = {algorithm,compiler,expression,framework,JModelica.org,Modelica,symbolic simplification,systems of equations,canonical form,normal form},
  language     = {eng},
  note         = {Student Paper},
  series       = {LU-CS-EX 2016-25},
  title        = {Symbolic Simplification Framework in a Modelica Compiler},
  year         = {2016},
}