Graphic formalisms: the language Argos

  • Nicolas Halbwachs
Part of the The Springer International Series in Engineering and Computer Science book series (SECS, volume 215)


This chapter is devoted to graphical formalisms based on parallel and hierarchic automata. The best known of such formalisms is probably Statecharts [Har87], which have been defined by D. Harel and A. Pnueli. However, we prefer to describe another formalism, apparently very close to Statecharts: the language Argos [Mar89, Mar90], under development at IMAG (Grenoble). This choice is motivated by the following reasons:
  • The Statecharts semantics seems to still be under discussion [HPSS86, HGd88]. On the other hand, the given semantics is not completely synchronous, since parallel composition may give rise to nondeterministic behaviors.

  • Argos solves some problems existing in Statecharts, in particular those concerning modularity and causality loops. It is a simpler language, whose semantics is completely formalized and thoroughly compatible with the synchronous point of view adopted in Esterel.


Parallel Composition Internal Signal Output Part Hierarchical Decomposition Causality Loop 
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.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer Science+Business Media Dordrecht 1993

Authors and Affiliations

  • Nicolas Halbwachs
    • 1
  1. 1.IMAG InstituteGrenobleFrance

Personalised recommendations