Abstract
In most imperative synchronous languages (Esterel, Argos, Statecharts,...), the semantics of the control structures may be conveniently described as compositions of Mealy machines. This constitutes the usual formal semantics of Argos, for instance, where basic components are Mealy machines. On the other hand, the compilation process should not be based upon an explicit generation of the Mealy machine that represents the behaviour of the whole program, because this machine may have a very large number of states. Hence we try to perform a symbolic compilation into a Mealy machine implicitly represented by a set of Boolean equations.
We give here the direct semantics of Argos in terms of such equations, and show that this semantics coincides with the usual one. The current implementation of the Argos compiler produces DC code, which is the common equational format for synchronous languages. This will allow to merge imperative and declarative synchronous languages (Argos and Lustre, for instance), by merging DC files.
Verimag is a joint laboratory of CNRS, Institut National Polytechnique de Grenoble, Université J. Fourier and Verilog SA associated with IMAG
This is a preview of subscription content, log in via an institution.
Preview
Unable to display preview. Download preview PDF.
References
G. Berry. The constructive semantics of Esterel. in preparation.
G. Berry. A hardware implementation of pure esterel. In ACM Workshop on Formal Methods in VLSI Design, Miami, January 1991.
G. Berry and G. Gonthier. The Esterel synchronous programming language: Design, semantics, implementation. Science Of Computer Programming, 19(2):87–152, 1992.
C2A-SYNCHRON. The common format of synchronous languages — The declarative code DC version 1.0. Technical report, SYNCHRON project, October 1995.
N. Halbwachs. Synchronous programming of reactive systems. Kluwer Academic Pub., 1993.
D. Harel. Statecharts: A visual approach to complex systems. Science of Computer Programming, 8:231–275, 1987.
N. Halbwachs and F. Maraninchi. On the symbolic analysis of combinational loops in circuits and synchronous programs. In EUROMICRO, Como, Italy, September 1995.
Another look at real-time programming. Special Section of the Proceedings of the IEEE, 79(9), September 1991.
M. Jourdan, F. Lagnier, F. Maraninchi, and P. Raymond. A multiparadigm language for reactive systems. In In 5th IEEE International Conference on Computer Languages, Toulouse, May 1994. IEEE Computer Society Press.
M. Jourdan and F. Maraninchi. Studying synchronous communication mechanisms by abstractions. In IFIP Working Conference on Programming Concepts, Methods and Calculi, San Miniato, Italy, jun 1994. Elsevier Science Publishers.
F. Maraninchi. Operational and compositional semantics of synchronous automaton compositions. In CONCUR. LNCS 630, Springer Verlag, august 1992.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1996 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Maraninchi, F., Halbwachs, N. (1996). Compiling Argos into Boolean equations. In: Jonsson, B., Parrow, J. (eds) Formal Techniques in Real-Time and Fault-Tolerant Systems. FTRTFT 1996. Lecture Notes in Computer Science, vol 1135. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-61648-9_35
Download citation
DOI: https://doi.org/10.1007/3-540-61648-9_35
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-61648-1
Online ISBN: 978-3-540-70653-3
eBook Packages: Springer Book Archive