SwePub
Sök i LIBRIS databas

  Extended search

WFRF:(Lisper Björn)
 

Search: WFRF:(Lisper Björn) > Meta-Languages and ...

Meta-Languages and Semantics for Equation-Based Modeling and Simulation

Broman, David, 1977- (author)
Linköpings universitet,PELAB - Laboratoriet för programmeringsomgivningar,Tekniska högskolan,PELAB
Fritzson, Peter, Professor (thesis advisor)
Linköpings universitet,PELAB - Laboratoriet för programmeringsomgivningar,Tekniska högskolan
Siek, Jeremy, Assistant Professor (thesis advisor)
Department of Electrical, Computer, and Energy Engineering, University of Colorado at Boulder, USA
show more...
Schön, Thomas, Associate Professor (thesis advisor)
Linköpings universitet,Reglerteknik
Lisper, Björn, Professor (thesis advisor)
Computer Engineering at School of Innovation, Design, and Technology, Mälardalen University, Sweden
Taha, Walid, Professor (opponent)
Halmstad University, Halmstad, Sweden
show less...
 (creator_code:org_t)
ISBN 9789173933353
Linköping : Linköping University Electronic Press, 2010
English 263 s.
Series: Linköping Studies in Science and Technology. Dissertations, 0345-7524 ; 1333
  • Doctoral thesis (other academic/artistic)
Abstract Subject headings
Close  
  • Performing computational experiments on mathematical models instead of building and testing physical prototypes can drastically reduce the develop cost for complex systems such as automobiles, aircraft, and powerplants. In the past three decades, a new category of equation-based modeling languages has appeared that is based on acausal and object-oriented modeling principles, enabling good reuse of models.  However, the modeling languages within this category have grown to be large and complex, where the specifications of the language's semantics are informally defined, typically described in natural languages. The lack of a formal semantics makes these languages hard to interpret unambiguously and to reason about. This thesis concerns the problem of designing the semantics of such equation-based modeling languages in a way that allows formal reasoning and increased correctness. The work is presented in two parts.In the first part we study the state-of-the-art modeling language Modelica.  We analyze the concepts of types in Modelica and conclude that there are two kinds of type concepts: class types and object types. Moreover, a concept called structural constraint delta is proposed, which is used for isolating the faults of an over- or under-determined model.In the second part, we introduce a new research language called the Modeling Kernel Language (MKL). By introducing the concept of higher-order acausal models (HOAMs), we show that it is possible to create expressive modeling libraries in a manner analogous to Modelica, but using a small and simple language concept. In contrast to the current state-of-the-art modeling languages, the semantics of how to use the models, including meta operations on models, are also specified in MKL libraries. This enables extensible formal executable specifications where important language features are expressed through libraries rather than by adding completely new language constructs. MKL is a statically typed language based on a typed lambda calculus. We define the core of the language formally using operational semantics and prove type safety.  An MKL interpreter is implemented and verified in comparison with a Modelica environment.

Subject headings

NATURVETENSKAP  -- Data- och informationsvetenskap -- Datavetenskap (hsv//swe)
NATURAL SCIENCES  -- Computer and Information Sciences -- Computer Sciences (hsv//eng)

Keyword

Meta-language
semantics
EOO
Modelica
equations
modeling
simulation
MKL
Computer science
Datalogi

Publication and Content Type

vet (subject category)
dok (subject category)

Find in a library

To the university's database

Kungliga biblioteket hanterar dina personuppgifter i enlighet med EU:s dataskyddsförordning (2018), GDPR. Läs mer om hur det funkar här.
Så här hanterar KB dina uppgifter vid användning av denna tjänst.

 
pil uppåt Close

Copy and save the link in order to return to this view