Argos(ID:5550/arg002)
Graphical synchronous language for the description of reactive systems
Maraninchi, Grenoble, 1992
References:
Maraninchi, F. "The Argos language: Graphical representation of automata and description of reactive systems" view details
Abstract: We present the Argos graphical synchronous language for the description of reactive systems, and the Argonaute environment associated with it. Systems like communication protocols, real time process controllers or man/machine interfaces contain a reactive kernel. Its behaviour can be described in a convenient manner by an automaton , for formal validation purposes. But, in general, complex systems cannot be described directly as automata. The Statecharts and Argos are automata-based languages. The high level constructs of the language deal with states and transitions directly. A consequence of this choice is the graphical syntax, since the best representation of small automata is graphical. A consequence of this graphical syntax is the need for graphical constructs: the constructs of the language must allow the decomposition of a system into small parts that can be represented directly by automata, and they must be given a readable graphical syntax.
in Proc. of the 1991 IEEE Workshop on Visual Languages, Kobe, Japan, October 1991 view details
Maraninchi, Florence and Nicolas Halbwachs "Compiling ARGOS into Boolean Equations" FTRTFT 1996 pp72-89
view details
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.
in Proc. of the 1991 IEEE Workshop on Visual Languages, Kobe, Japan, October 1991 view details
|