liu.seSearch for publications in DiVA
Change search
ReferencesLink to record
Permanent link

Direct link
Flow Lambda Calculus for Declarative Physical Connection Semantics
Linköping University, Department of Computer and Information Science, PELAB - Programming Environment Laboratory. Linköping University, The Institute of Technology.
2007 (English)Report (Other academic)
Abstract [en]

One of the most fundamental language constructs of equation-based object-oriented languages is the possibility to state acausal connections, where both potential variables and flow variables exist. Several of the state-of-the art languages in this category are informally specified using natural language. This can make the languages hard to interpret, reason about, and disable the possibility to guarantee the absence of certain errors. In this work, we construct a formal operational small-step semantics based on the lambda-calculus. The calculus is then extended with more convenient modeling capabilities. Examples are given that demonstrate the expressiveness of the language, and some tests are made to verify the correctness of the semantics.

Place, publisher, year, edition, pages
Linköping: Linköping University Electronic Press , 2007. no 1, 18 p.1-18 p.
Technical reports in Computer and Information Science, ISSN 1654-7233 ; 1
Keyword [en]
Flow connection, Flow Lambda Calculus, Operational Semantics
National Category
Computer Science
URN: urn:nbn:se:liu:diva-12702OAI: diva2:16881
Available from: 2007-11-16 Created: 2007-11-16 Last updated: 2010-11-03Bibliographically approved
In thesis
1. Safety, Security, and Semantic Aspects of Equation-Based Object-Oriented Languages and Environments
Open this publication in new window or tab >>Safety, Security, and Semantic Aspects of Equation-Based Object-Oriented Languages and Environments
2007 (English)Licentiate thesis, comprehensive summary (Other academic)
Abstract [en]

During the last two decades, the interest for computer aided modeling and simulation of complex physical systems has witnessed a significant growth. The recent possibility to create acausal models, using components from different domains (e.g., electrical, mechanical, and hydraulic) enables new opportunities. Modelica is one of the most prominent equation-based object-oriented (EOO) languages that support such capabilities, including the ability to simulate both continuous- and discrete-time models, as well as mixed hybrid models. However, there are still many remaining challenges when it comes to language safety and simulation security. The problem area concerns detecting modeling errors at an early stage, so that faults can be isolated and resolved. Furthermore, to give guarantees for the absence of faults in models, the need for precise language specifications is vital, both regarding type systems and dynamic semantics.

This thesis includes five papers related to these topics. The first paper describes the informal concept of types in the Modelica language, and proposes a new concrete syntax for more precise type definitions. The second paper provides a new approach for detecting over- and under-constrained systems of equations in EOO languages, based on a concept called structural constraint delta. That approach makes use of type checking and a type inference algorithm. The third paper outlines a strategy for using abstract syntax as a middle-way between a formal and informal language specification. The fourth paper suggests and evaluates an approach for secure distributed co-simulation over wide area networks. The final paper outlines a new formal operational semantics for describing physical connections, which is based on the untyped lambda calculus. A kernel language is defined, in which real physical models are constructed and simulated.

Place, publisher, year, edition, pages
Institutionen för datavetenskap, 2007. 26 p.
Linköping Studies in Science and Technology. Thesis, ISSN 0280-7971 ; 1337
Modeling, Simulation, Equation-Based, Object-Oriented, Modelica, Type System, Semantics, Language Safety, Secure Simulation
National Category
Computer Science
urn:nbn:se:liu:diva-10134 (URN)978-91-85895-24-3 (ISBN)
2007-12-07, Visionen, B, Linköpings universistet, Linköping, 13:15 (English)
Report code: LIU-TEK-LIC-2007:46. On the day of the defence date the status of article IV was: In Progress; The status of article V was: Manuscript.Available from: 2007-11-16 Created: 2007-11-16 Last updated: 2014-10-08

Open Access in DiVA

Flow Lambda Calculus for Declarative Physical Connection Semantics(839 kB)390 downloads
File information
File name FULLTEXT01.pdfFile size 839 kBChecksum SHA-512
Type fulltextMimetype application/pdf

Search in DiVA

By author/editor
Broman, David
By organisation
PELAB - Programming Environment LaboratoryThe Institute of Technology
Computer Science

Search outside of DiVA

GoogleGoogle Scholar
Total: 390 downloads
The number of downloads is the sum of all downloads of full texts. It may include eg previous versions that are now no longer available

Total: 191 hits
ReferencesLink to record
Permanent link

Direct link