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.
Liste complète des métadonnées

Contributor : Naly Rakoto <>
Submitted on : Monday, January 14, 2019 - 3:08:30 PM
Last modification on : Tuesday, March 26, 2019 - 9:25:22 AM


Publisher files allowed on an open archive


  • HAL Id : hal-01980559, version 1


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⟩



Record views


Files downloads