Argonaute: Graphical description, semantics and verification of reactive systems by using a process algebra

Abstract

The Argonaute system is specifically designed to describe, specify and verify reactive systems such as communication protocols, real-time applications, man-machine interfaces, ... It is based upon the Argos graphical language, whose syntax relies on the Higraphs formalism by D. Harel [HAR88], and whose semantics is given by using a process algebra. Automata form the basic notion of the language, and hierarchical or parallel decompositions are given by using operators of the algebra. The complete formalization of the language inherits notions from both classical process algebras such as ccs [MIL80], and existing programming languages used in the same field such as Esterel [BG88] or the Statecharts formalism [HAR87]. Concerning complex system description, Argos allows to describe intrinsic states directly — with the basic automation notion — and only them: connections between components need no extra-state. The Argonaute system allows to describe reactive systems graphically, to specify properties by means of temporal logic formulas, to produce a model on which logic formulas can be evaluated and to simulate an execution of the system described, by using the external graphical form to show evolutions. We present the global structure and functionalities of the Argonaute system, and the theoretical basis of the Argos language.

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.