A type-based analysis of causality loops in hybrid systems modelers

Explicit hybrid systems modelers like Simulink/Stateflow allow for programming both discrete- and continuous-time behaviors with complex interactions between them. An important step in their compilation is the static detection of algebraic or causality loops. Such loops can cause simulations to dead...

Celý popis

Uloženo v:
Podrobná bibliografie
Vydáno v:Nonlinear analysis. Hybrid systems Ročník 26; s. 168 - 189
Hlavní autoři: Benveniste, Albert, Bourke, Timothy, Caillaud, Benoit, Pagano, Bruno, Pouzet, Marc
Médium: Journal Article
Jazyk:angličtina
Vydáno: Elsevier Ltd 01.11.2017
Elsevier
Témata:
Automatic Control Engineering
Computer Science
Embedded Systems
Hybrid systems
Mathematical Software
Modeling and Simulation
Other
Synchronous programming languages
Type systems
Type systems
Hybrid systems
Synchronous programming languages
Numerical solver
HybridLang
Mathematical modelling language
ISSN:1751-570X
On-line přístup:Získat plný text
Tagy: Přidat tag
Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!
Popis
Shrnutí:Explicit hybrid systems modelers like Simulink/Stateflow allow for programming both discrete- and continuous-time behaviors with complex interactions between them. An important step in their compilation is the static detection of algebraic or causality loops. Such loops can cause simulations to deadlock and prevent the generation of statically scheduled code. This paper addresses this issue for a hybrid modeling language that combines synchronous data-flow equations with Ordinary Differential Equations (ODEs). We introduce the operator lastx for the left-limit of a signal x. The lastx operator is used to break causality loops and permits a uniform treatment of discrete and continuous state variables. The semantics of the language relies on non-standard analysis, defining an execution as a sequence of infinitesimally small steps. A signal is deemed causally correct when it can be computed sequentially and only changes infinitesimally outside of announced discrete events like zero-crossings. The causality analysis takes the form of a type system that expresses dependencies between signals. In well-typed programs, (i) signals are provably continuous during integration provided that imported external functions are also continuous, and (ii) sequential code can be generated. The effectiveness of the system is illustrated with several examples written in Zélus, a Lustre-like synchronous language extended with ODEs.
ISSN:1751-570X
DOI:10.1016/j.nahs.2017.04.004