A Hybrid Synchronous Language with Hierarchical Automata

Albert Benveniste1

Description

A Hybrid Synchronous Language with Hierarchical Automata Static Typing and Translation to Synchronous Code Albert Benveniste1 Benoît Caillaud1 Timothy Bourke1,2 Marc Pouzet2,1 1. INRIA 2. ENS, Paris 18th Workshop SYNCHRON, Nov. 28 – Dec. 2, 2011, Damarie-les-Lys

• flow well


• programming languages perspective


• well understood


• discrete systems


• hybrid modelers


• purely discrete

Informations

• Publié par: pefav
• Nombre de lectures: 7
• Langue: English

Extrait

A Hybrid Synchronous Language with Hierarchical
Automata
Static Typing and Translation to Synchronous Code
1 1Albert Benveniste Benoît Caillaud
1,2 2,1Timothy Bourke Marc Pouzet
1. INRIA
2. ENS, Paris
18th Workshop SYNCHRON, Nov. 28 – Dec. 2, 2011, Damarie-les-LysAim
Programming languages perspective:
purely discrete data-flow well understood (Lustre, SCADE 6) continuous wellod (Numerical solvers, Simulink)
hier. automata (disc.) well understood (Statecharts, Esterel)
data-flow + hier. auto. wellod (SCADE 6, Esterel v7)
Better understand the combination of discrete and continuous components
The usual questions (and techniques):
I Which programs make sense? (typing)
Benveniste et al. The Fundamentals
I How to reason about programs? (semantics, )of Hybrid Modelers. JCSS 2011.
I Efficient and faithful execution? (compilation)
Ourinterest: a language for programming discrete systems and their
physical environmentsAim
Programming languages perspective:
purely discrete data-flow well understood (Lustre, SCADE 6) continuous wellod (Numerical solvers, Simulink)
hier. automata (disc.) well understood (Statecharts, Esterel)
data-flow + hier. auto. wellod (SCADE 6, Esterel v7)
Better understand the combination of discrete and continuous components
The usual questions (and techniques):
I Which programs make sense? (typing)
Benveniste et al. The Fundamentals
I How to reason about programs? (semantics, )of Hybrid Modelers. JCSS 2011.
I Efficient and faithful execution? (compilation)
Ourinterest: a language for programming discrete systems and their
physical environmentsAim
Programming languages perspective:
purely discrete data-flow well understood (Lustre, SCADE 6) continuous wellod (Numerical solvers, Simulink)
hier. automata (disc.) well understood (Statecharts, Esterel)
data-flow + hier. auto. wellod (SCADE 6, Esterel v7)
Better understand the combination of discrete and continuous components
The usual questions (and techniques):
I Which programs make sense? (typing)
Benveniste et al. The Fundamentals
I How to reason about programs? (semantics, )of Hybrid Modelers. JCSS 2011.
I Efficient and faithful execution? (compilation)
Ourinterest: a language for programming discrete systems and their
physical environmentsAim
Programming languages perspective:
purely discrete data-flow well understood (Lustre, SCADE 6) continuous wellod (Numerical solvers, Simulink)
hier. automata (disc.) well understood (Statecharts, Esterel)
data-flow + hier. auto. wellod (SCADE 6, Esterel v7)
Better understand the combination of discrete and continuous components
The usual questions (and techniques):
I Which programs make sense? (typing)
Benveniste et al. The Fundamentals
I How to reason about programs? (semantics, )of Hybrid Modelers. JCSS 2011.
I Efficient and faithful execution? (compilation)
Ourinterest: a language for programming discrete systems and their
physical environmentsApproach
I Add Ordinary Differential Equations to an existing synchronous
language
I Two concrete reasons:
I Increase modeling power (hybrid programming)
I Exploit existing compiler (target for code generation)
I Simulate with an external off-the-shelf numerical solver
Hindmarsh et al. SUNDIALS: Suite of nonlinear and differential/algebraic equation(Sundials CVODE, )solvers. ACM Trans. Mathematical Software, 31(3):363–396, 2005.
I Conservative extension: synchronous functions are compiled,
optimized, and executed as per usual.
I Extends previous work: add hierarchical automata to LCTES 2011
Understand (continuous) automata and their parallel composition
from a synchronous language viewpoint
(causality relations, activations (clocks), semantics)Approach
I Add Ordinary Differential Equations to an existing synchronous
language
I Two concrete reasons:
I Increase modeling power (hybrid programming)
I Exploit existing compiler (target for code generation)
I Simulate with an external off-the-shelf numerical solver
Hindmarsh et al. SUNDIALS: Suite of nonlinear and differential/algebraic equation(Sundials CVODE, )solvers. ACM Trans. Mathematical Software, 31(3):363–396, 2005.
I Conservative extension: synchronous functions are compiled,
optimized, and executed as per usual.
I Extends previous work: add hierarchical automata to LCTES 2011
Understand (continuous) automata and their parallel composition
from a synchronous language viewpoint
(causality relations, activations (clocks), semantics)Approach
I Add Ordinary Differential Equations to an existing synchronous
language
I Two concrete reasons:
I Increase modeling power (hybrid programming)
I Exploit existing compiler (target for code generation)
I Simulate with an external off-the-shelf numerical solver
Hindmarsh et al. SUNDIALS: Suite of nonlinear and differential/algebraic equation(Sundials CVODE, )solvers. ACM Trans. Mathematical Software, 31(3):363–396, 2005.
I Conservative extension: synchronous functions are compiled,
optimized, and executed as per usual.
I Extends previous work: add hierarchical automata to LCTES 2011
Understand (continuous) automata and their parallel composition
from a synchronous language viewpoint
(causality relations, activations (clocks), semantics)Approach
I Add Ordinary Differential Equations to an existing synchronous
language
I Two concrete reasons:
I Increase modeling power (hybrid programming)
I Exploit existing compiler (target for code generation)
I Simulate with an external off-the-shelf numerical solver
Hindmarsh et al. SUNDIALS: Suite of nonlinear and differential/algebraic equation(Sundials CVODE, )solvers. ACM Trans. Mathematical Software, 31(3):363–396, 2005.
I Conservative extension: synchronous functions are compiled,
optimized, and executed as per usual.
I Extends previous work: add hierarchical automata to LCTES 2011
Understand (continuous) automata and their parallel composition
from a synchronous language viewpoint
(causality relations, activations (clocks), semantics)®Simulink 7
User’s Guide
Lee and Zheng. Operational semantics of hybrid
systems. HSCC 2005.
Lee and Zheng. Leveraging synchronous language
principles for heterogeneous modeling and design
of embedded systems. EMSOFT’07.