Argos: an Automaton-Based Synchronous Language - Archive ouverte HAL Accéder directement au contenu
Article Dans Une Revue Computer Languages -Oxford- Année : 2001

Argos: an Automaton-Based Synchronous Language

Florence Maraninchi
Yann Rémond
  • Fonction : Auteur
  • PersonId : 848455

Résumé

Argos belongs to the family of synchronous languages, designed for programming reactive systems (Lustre, Esterel, Signal, ...). Argos is a set of operators that allow to combine Boolean Mealy machines, in a compositional way. It takes its origin in Statecharts, but with the Argos operators, one can build only a subset of Statecharts, roughly those that do not make use of multi-level arrows. We explain the main motivations for the definition of Argos, and the main differences with Statecharts and their numerous semantics. We define the set of operators, give them a perfectly synchronous semantics in the sense of Esterel, and prove that it is compositional, with respect to the trace equivalence of Boolean Mealy machines. We give an overview of the work related to the definition and implementation of Argos (code generation, connection to verification tools, introduction of non-determinism, etc.). This paper also gives a set of guidelines for building an automaton-based, Statechart-like, yet perfectly synchronous, language.
Fichier principal
Vignette du fichier
ARGOS-CL-perso.pdf (407.21 Ko) Télécharger le fichier
Origine : Fichiers produits par l'(les) auteur(s)

Dates et versions

hal-00273055 , version 1 (15-04-2008)

Identifiants

Citer

Florence Maraninchi, Yann Rémond. Argos: an Automaton-Based Synchronous Language. Computer Languages -Oxford-, 2001, 27 (1-3), pp.61-92. ⟨10.1016/S0096-0551(01)00016-9⟩. ⟨hal-00273055⟩
790 Consultations
399 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More