Skip to Main content Skip to Navigation
Journal articles

Argos: an Automaton-Based Synchronous Language

Abstract : 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.
Document type :
Journal articles
Complete list of metadata
Contributor : Florence Maraninchi <>
Submitted on : Tuesday, April 15, 2008 - 9:04:15 AM
Last modification on : Thursday, November 19, 2020 - 3:58:01 PM
Long-term archiving on: : Friday, May 21, 2010 - 1:42:26 AM


Files produced by the author(s)




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



Record views


Files downloads