Towards Qualifiable Code Generation from a Clocked Synchronous Subset of Modelica

Abstract

So far no qualifiable automatic code generators (ACGs) are available for Modelica. Hence, digital control applications can be modeled and simulated in Modelica, but require tedious additional efforts (e.g., manual reprogramming) to produce qualifiable target system production code. In order to more fully leverage the potential of a model-based development (MBD) process in Modelica, a qualifiable automatic code generator is needed.Typical Modelica code generation is a fairly complex process which imposes a huge development burden to any efforts of tool qualification. This work aims at mapping a Modelica subset for digital control function development to a well-understood synchronous data-flow kernel language. This kernel language allows to resort to established compilation techniques for data-flow languages which are understood enough to be accepted by certification authorities.The mapping is established by providing a translational semantics from the Modelica subset to the synchronous data-flow kernel language. However, this translation turned out to be more intricate than initially expected and has given rise to several interesting issues that require suitable design decisions regarding the mapping and the language subset.

Equation-Based Modeling with Modelica – Principles and Future Challenges

“…This will only be realistically possible with a well-defined subset of the Modelica language. First definitions in these directions have been undertaken by [9] and [11]. Nevertheless, the vision to automatically generate certified code for embedded systems out of Modelica models is still a far reaching goal but definitely worth pursuing.…”

Towards a UTP Semantics for Modelica

“…Most of the approaches describe the instantiation and flattening of Modelica models (i.e., the static semantics, corresponding to the first stage in Fig. 1) [20,1,28] while others are restricted to discrete-time language subsets [29].…”