On Switchable Languages of Discrete-Event Systems with Weighted Automata - Archive ouverte HAL Accéder directement au contenu
Communication Dans Un Congrès Année : 2018

On Switchable Languages of Discrete-Event Systems with Weighted Automata

Michael Canu

Résumé

The notion of switchable languages has been defined by Kumar, Takai, Fabian and Ushio in [11]. It deals with switching supervisory control, where switching means switching between two specifications. In this paper, we first extend the notion of switchable languages to n languages, (n ≥ 3). Then we consider a discrete-event system modeled with weighted automata. The use of weighted automata is justified by the fact that it allows us to synthesize a switching supervisory controller based on the cost associated to each event, like the energy for example. Finally the proposed methodology is applied to a simple example.
Fichier principal
Vignette du fichier
0212-canu-rakoto-mtns2018.pdf (123.02 Ko) Télécharger le fichier
Origine : Fichiers éditeurs autorisés sur une archive ouverte
Loading...

Dates et versions

hal-01980559 , version 1 (14-01-2019)

Identifiants

  • HAL Id : hal-01980559 , version 1

Citer

Michael Canu, Naly Rakoto-Ravalontsalama. On Switchable Languages of Discrete-Event Systems with Weighted Automata. 23rd International Symposium on Mathematical Theory of Networks and Systems, Jul 2018, Hong Kong, Hong Kong SAR China. ⟨hal-01980559⟩
53 Consultations
45 Téléchargements

Partager

Gmail Facebook X LinkedIn More