Abstract
Mode-Automata have been proposed in [11]. They introduce, in the domain-specific data-flow language Lustre for reactive systems, a new construct devoted to the expression of running modes. The idea is to associate data-flow programs with the states of an automaton, representing modes. We define flat automata first, and then several composition operators, such as parallel composition and hierarchic composition, which give the language a state structure reminiscent from Statecharts. The semantics of this extension may be defined by describing the translation of Mode-automata into pure Lustre. However, the translation scheme is complex and it gives poor code; we study here the translation of mode-automata into the declarative format dc, used as an intermediate form in the compilers of several synchronous languages (Lustre, Esterel, ...). dc can be compiled into C, Java or Ada code. This allows to take advantage of the imperative mode-structure of a mode-automaton in order to improve the final sequential code.
This work has been partially supported by Esprit LTR Project SYRF 22703
Chapter PDF
Similar content being viewed by others
Keywords
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
References
R. Alur, C. Courcoubetis, T. A. Henzinger, and Pei-Hsin Ho. Hybrid automata: an algorithmic approach to the specification and analysis of hybrid systems. In Workshop on Theory of Hybrid Systems, Lyngby, Denmark, October 1993. LNCS 736, Springer Verlag. 250
G. Berry and G. Gonthier. The Esterel synchronous programming language: Design, semantics, implementation. Science Of Computer Programming, 19(2):87–152, 1992. 249
C2A-SYNCHRON. The common format of synchronous languages — The declarative code DC version 1.0. Technical report, SYNCHRON project, October 1995. 251, 253
P. Caspi. Clocks in dataflow languages. Theoretical Computer Science, 94:125–140, 1992. 251
Erich Gamma, Richard Helm, Ralph Johnson, and John Vlissides. Design Patterns. Addison Wesley, Reading, MA, 1995. 250
N. Halbwachs. Synchronous programming of reactive systems. Kluwer Academic Pub., 1993. 249
N. Halbwachs, P. Caspi, P. Raymond, and D. Pilaud. The synchronous dataflow programming language lustre. Proceedings of the IEEE, 79(9):1305–1320, September 1991. 249
P. LeGuernic, T. Gautier, M. LeBorgne, and C. LeMaire. Programming real time applications with signal. Proceedings of the IEEE, 79(9):1321–1336, September 1991. 249
Claus Lewerentz and Thomas Lindner. Formal Development of Reactive Systems: Case Study Production Cell. Number 891 in Lecture Notes in Computer Science. Springer Verlag, January 1995. 262
F. Maraninchi. Operational and compositional semantics of synchronous automaton compositions. In CONCUR. LNCS 630, Springer Verlag, August 1992. 249
F. Maraninchi and Y. Rémond. Mode-automata: About modes and states for reactive systems. In European Symposium On Programming, Lisbon (Portugal), March 1998. Springer Verlag, LNCS 1381. 249, 250
SYRF. Esprit ltr 22703, “synchronous reactive formalisms”. Technical report, 1996–1999. http://www-verimag.imag.fr/SYNCHRONE/SYRF/syrf.html. 262
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2000 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Maraninchi, F., Rémond, Y., Raoul, Y. (2000). MATOU: An Implementation of Mode-Automata. In: Watt, D.A. (eds) Compiler Construction. CC 2000. Lecture Notes in Computer Science, vol 1781. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-46423-9_17
Download citation
DOI: https://doi.org/10.1007/3-540-46423-9_17
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-67263-0
Online ISBN: 978-3-540-46423-5
eBook Packages: Springer Book Archive