Translating discrete-time simulink to lustre
- 1 November 2005
- journal article
- Published by Association for Computing Machinery (ACM) in ACM Transactions on Embedded Computing Systems
- Vol. 4 (4), 779-818
- https://doi.org/10.1145/1113830.1113834
Abstract
We present a method of translating discrete-time Simulink models to Lustre programs. Our method consists of three steps: type inference, clock inference, and hierarchical bottom-up translation. In the process, we explain and formalize the typing and timing mechanisms of Simulink. The method has been implemented in a prototype tool called S2L, which has been used in the context of a European research project to translate two automotive controller models provided by Audi.Keywords
This publication has 18 references indexed in Scilit:
- From simulink to SCADE/lustre to TTAPublished by Association for Computing Machinery (ACM) ,2003
- The MAGICA Type Inference Engine for MATLAB ®Lecture Notes in Computer Science, 2003
- Computational techniques for hybrid system verificationIEEE Transactions on Automatic Control, 2003
- TTP-a protocol for fault-tolerant real-time systemsComputer, 1994
- Report on the programming language HaskellACM SIGPLAN Notices, 1992
- Clocks in dataflow languagesTheoretical Computer Science, 1992
- The synchronous data flow programming language LUSTREProceedings of the IEEE, 1991
- An Efficient Unification AlgorithmACM Transactions on Programming Languages and Systems, 1982
- A theory of type polymorphism in programmingJournal of Computer and System Sciences, 1978
- A Machine-Oriented Logic Based on the Resolution PrincipleJournal of the ACM, 1965