CONTRIBUTION A LA COMMANDE DES SYSTEMES A EVENEMENTS DISCRETS TEMPORISES (SEDTS)

International audienceRESUME: Ce papier présente une approche de synthèse de commande sûre de fonctionnement des Systèmes à Evéne-ments Discrets Temporisés (SEDTs), à base de propriétés temporelles. Pour établir cette synthèse, la démarche propo-sée s'appuie sur la modularité des systèmes manufacturiers retrouvée dans les travaux (Qamsane et al., 2014a,b). Un exemple de système automatisé de production vient illustrer nos propos. MOTS-CLES: Systèmes à événements discrets temporisés, théorie de la supervision, commande distribuée, systèmes manufacturiers, modélisation

State Estimation of Timed Discrete Event Systems and Its Applications

Many industrial control systems can be described as discrete event systems (DES), whose state space is a discrete set where event occurrences cause transitions from one state to another. Timing introduces an additional dimension to DES modeling and control. This dissertation provides two models of timed DES endowed with a single clock, namely timed finite automata (TFA) and generalized timed finite automata (GTFA). In addition, a timing function is defined to associate each transition with a time interval specifying at which clock values it may occur. While the clock of a TFA is reset to zero after each event occurs and the time semantics constrain the dwell time at each discrete state, there is an additional clock resetting function associated with a GTFA to denote whether the clock is reset to a value in a given closed time interval. We assume that the logical and time structure of a partially observable TFA/GTFA is known. The main results are summarized as follows. 1. The notion of a zone automaton is introduced as a finite automaton providing a purely discrete event description of the behaviour of a TFA/GTFA of interest. Each state of a zone automaton contains a discrete state of the timed DES and a zone that is a time interval denoting a range of possible clock values. We investigate the dynamics of a zone automaton and show that one can reduce the problem of investigating the reachability of a given timed DES to the reachability analysis of a zone automaton. 2. We present a formal approach that allows one to construct offline an observer for TFA/GTFA, i.e., a finite structure that describes the state estimation for all possible evolutions. During the online phase to estimate the current discrete state according to each measurement of an observable event, one can determine which is the state of the observer reached by the current observation and check to which interval (among a finite number of time intervals) the time elapsed since the last observed event occurrence belongs. We prove that the discrete states consistent with a timed observation and the range of clock values associated with each estimated discrete state can be inferred following a certain number of runs in the zone automaton. In particular, the state estimation of timed DES under multiple clocks can be investigated in the framework of GTFA. We model such a system as a GTFA with multiple clocks, which generalizes the timing function and the clock resetting function to multiple clocks. 3. As an application of the state estimation approach for TFA, we assume that a given TFA may be affected by a set of faults described using timed transitions and aim at diagnosing a fault behaviour based on a timed observation. The problem of fault diagnosis is solved by constructing a zone automaton of the TFA with faults and a fault recognizer as the parallel composition of the zone automaton and a fault monitor that recognizes the occurrence of faults. We conclude that the occurrence of faults can be analyzed by exploring runs in the fault recognizer that are consistent with a given timed observation. 4. We also study the problem of attack detection in the context of DESs, assuming that a system may be subject to multiple types of attacks, each described by its own attack dictionary. Furthermore, we distinguish between constant attacks, which corrupt observations using only one of the attack dictionaries, and switching attacks, which may use different attack dictionaries at different steps. The problem we address is detecting whether a system has been attacked and, if so, which attack dictionaries have been used. To solve it in the framework of untimed DES, we construct a new structure that describes the observations generated by a system under attack. We show that the attack detection problem can be transformed into a classical state estimation/diagnosis problem for these new structures

Uma abordagem local para o controle supervisório modular de sistemas a eventos discretos temporizados

Dissertação (mestrado) - Universidade Federal de Santa Catarina, Centro Tecnológico, Programa de Pós-Graduação em Engenharia de Automação e Sistemas, Florianópolis, 2014.Nesta dissertação, propomos uma abordagem para a síntese local de supervisores modulares no contexto de sistemas a eventos discretos temporizados. O objetivo é reduzir o custo computacional na aplicação da teoria de controle supervisório a essa classe de sistemas, haja vista a dificuldade imposta pela explosão no número de estados dos modelos em sistemas de grande porte. Em grande parte dos problemas complexos envolvendo sistemas temporizados, a planta a ser controlada é composta de subsistemas que operam de maneira assíncrona a menos do compartilhamento de um relógio global. Ademais, o comportamento desejado é normalmente colocado na forma de especificações de controle elementares, cada uma das quais visa sincronizar e restringir o comportamento de apenas alguns dos subsistemas da planta. A ideia da metodologia de controle aqui apresentada é explorar tanto a modularidade das especificações quanto a do próprio sistema. Nossos supervisores são calculados com base em modelos locais, construídos pela agregação dos subsistemas que são afetados por cada especificação. Isso leva a módulos de controle nos quais a ação dos supervisores é relativamente simples, baseada apenas em informações locais, o que facilita sua compreensão, implementação e modificação. Apresentamos condições necessárias e suficientes sob as quais a ação conjunta dos supervisores locais leva o sistema a um comportamento global não bloqueante e que cumpre as especificações de forma ótima (minimamente restritiva). Mostramos, ainda, que a abordagem proposta reduz o custo computacional quando comparada a outras existentes. Por fim, um exemplo de interesse prático e com rígidas restrições temporais é resolvido, ilustrando a aplicabilidade da metodologia proposta.Abstract : In this thesis, an approach is proposed for the local synthesis of modular supervisors in the context of timed discrete-event systems. The objective is to reduce computational costs for the application of timed supervisory control, in face of the hindrances imposed by state explosion in the models of large scale systems. In a wide variety of complex problems involving timing issues, the plant to be controlled is composed of subsystems that work asynchronously except for the sharing of a global clock. Moreover, the desired behavior for the plant is usually represented by a number of elementary control specifications, each of which attempts to restrict and synchronize the behavior of only some of the system's components. The idea of our control methodology is to explore the modularity of both the specifications and the system itself. Our supervisors are designed over local models, which are obtained by aggregating the subsystems affected by each specification. This results in control modules with relatively simple supervisory actions, based only on local information, which makes the supervisors easier to comprehend, implement, and modify. We present necessary and suficient conditions under which the concurrent action of the local supervisors leads the system to a nonblocking global behavior that complies with the specifications in an optimal (minimally restrictive) way. We also show that the proposed strategy reduces computational efforts in comparison with existing ones. Finally, a practical problem with critical time restrictions is solved to exemplify an application of the proposed control methodology