Polychronous Automata - CNRS - Centre national de la recherche scientifique Accéder directement au contenu
Communication Dans Un Congrès Année : 2015

Polychronous Automata

Thierry Gautier
  • Fonction : Auteur
  • PersonId : 830655
Jean-Pierre Talpin
Loïc Besnard
  • Fonction : Auteur
  • PersonId : 831485

Résumé

This paper investigates the way state diagrams can be best represented in the polychronous model of computation. In this relational model, the basic objects are signals, which are related through data-flow equations. Signals are associated with logical clocks, which provide the capability to describe systems in which components obey to multiple clock rates. We propose a model of finite-state automata, called polychronous automata, which is based on clock relations. A specificity of this model is that an automaton is submitted to clock constraints. This allows one to specify a wide range of control-related configurations, either reactive, or restrictive with respect to their control environment. A semantic model is defined for these polychronous automata, that relies on a Boolean algebra of clocks.
Fichier principal
Vignette du fichier
tase15.pdf (312.49 Ko) Télécharger le fichier
Origine : Fichiers produits par l'(les) auteur(s)
Loading...

Dates et versions

hal-01240440 , version 1 (09-12-2015)

Identifiants

Citer

Paul Le Guernic, Thierry Gautier, Jean-Pierre Talpin, Loïc Besnard. Polychronous Automata. TASE 2015, 9th International Symposium on Theoretical Aspects of Software Engineering, Sep 2015, Nanjing, China. pp.95-102, ⟨10.1109/TASE.2015.21⟩. ⟨hal-01240440⟩
299 Consultations
149 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More