On Switchable Languages of Discrete-Event Systems with Weighted Automata

Abstract : 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.
Type de document :
Communication dans un congrès
23rd International Symposium on Mathematical Theory of Networks and Systems, Jul 2018, Hong Kong, Hong Kong SAR China. 23rd International Symposium on Mathematical Theory of Networks and Systems Hong Kong University of Science and Technology, Hong Kong, July 16-20, 2018
Liste complète des métadonnées

https://hal.archives-ouvertes.fr/hal-01980559
Contributeur : Naly Rakoto <>
Soumis le : lundi 14 janvier 2019 - 15:08:30
Dernière modification le : jeudi 7 février 2019 - 15:30:29

Fichier

0212-canu-rakoto-mtns2018.pdf
Fichiers éditeurs autorisés sur une archive ouverte

Identifiants

  • HAL Id : hal-01980559, version 1

Citation

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. 23rd International Symposium on Mathematical Theory of Networks and Systems Hong Kong University of Science and Technology, Hong Kong, July 16-20, 2018. 〈hal-01980559〉

Partager

Métriques

Consultations de la notice

22

Téléchargements de fichiers

5