Le développement de systèmes logiciels implique l'intégration de différents langages pour modéliser l'organisation et le comportement des composants d'une application. De plus, s'il existe des modèles de processus décrivant les différentes activités pour passer d'une spécification à une réalisation, il n'existe pas de processus général expliquant comment relier de façon rationnelle langages et activités. Par ailleurs, l'Ingénierie Dirigée par les Modèles propose des concepts et des outils pour spécifier et combiner différents langages; ceci en introduisant les concepts de méta­modèles comme moyen pour spécifier des langages, et de transformation de modèles pour les mettre en relation. Un exemple de métamodèle est donné par le standard SPEM (Software Process Engineering Metamodel) dédié à la modélisation de processus de développement logiciel.Dans ce contexte, la thèse propose de tirer profit des éléments précédents pour élaborer des processus de développements spécifiques et orientés modèles conformes à un schéma conceptuel dérivé du schéma de SPEM dans lequel des activités d'un processus peuvent exploiter des métamodèles et des transformations. Un guide méthodologique pour aborder l'ingénierie de processus spécifiques complète le schéma proposé. Les intérêts de la proposition résident alors dans une meilleure capitalisation des connaissances pour un domaine ainsi qu'une réduction des efforts de développement. Finalement, la thèse propose d'élaborer de tels processus spécifiques pour des applications logicielles relevant du domaine des Systèmes à Évènements Discrets. / Software development usually requires the usage and integration of different modeling languages for modeling the behavior and the organization of the application's components. There are many process models describing the different activities of software development but there is no generic process that explains how to relate these languages to the activities. In this context, Model Driven Engineering offers concepts and tools to specify and to combine different languages with meta­ models for specifying languages and model transformations to put together various meta-models. An example of such a meta-model is given by SPEM (Software Process Engineering Metamodel) which serves as a modeling language for describing software development processes.The thesis proposes to take advantage of the preceding concepts to define specific model-drivendevelopment processes; this by defining a conceptual scheme, derived from SPEM, in which the activities of a process use meta-models and transformations. From this scheme, the components of a specific process are identified what leads to a methodological approach for the engineering of domain specific processes. Thus, the major benefits of the approach are: knowledge capitalization and a reduction of development efforts. Finally, the thesis applies this proposition to derive aspecific software engineering process dedicated to the design of Discrete Event Systems.

En la darrera dècada, el disseny de sistemes de supervisió per a processos industrials ha rebut força atenció. Aquest fet s'explica per l'augment de la demanda en prestacions, flexibilitat i seguretat causada per la creixent conscienciació en qüestions de qualitat , legislació ambiental, i productivitat. L'interès principal d'aquesta Tesi es centra en el disseny d'un Sistema de Supervisió Intel·ligent (SIS). La tasca encomanada al SIS és la vigilància del procés, que consisteix en identificar i notificar a l'operador el seu estat de funcionament. Així per exemple, si el SIS detecta un estat de fallada, l'operador podrà emprendre les accions correctores adequades.La originalitat d'aquest treball es basa en la proposta d'una metodologia de disseny basada en la interpretació d'esdeveniments significatius, detectats en els senyals mesurats. En aquesta metodologia, l'expert té un paper rellevant, proporcionant el seu coneixement heurístic del procés. Es proposa una arquitectura de supervisió estructurada en dos nivells: la interfície i el supervisor.La interfície és l'encarregada d'abstraure informació significativa del procés, a partir de l'anàlisi dels senyals mesurats. Per aquest nivell, s'ha formalitzat una metodologia de disseny fonamentada en el paradigma de les finestres lliscants. Una finestra és un conjunt de dades consecutives d'un senyal, caracteritzada per una amplada i un desplaçament. Aplicant un càlcul determinat sobre aquestes dades és possible obtenir una nova dada. Així, l'anàlisi de diverses finestres consecutives proporciona un nou senyal sobre el que es pot aplicar un procediment similar. Continuant aquest procés iteratiu, es pot arribar a abstraure un senyal amb un contingut prou significatiu per a l'expert. Aquesta informació és transmesa al supervisor en forma d'esdeveniments.El supervisor s'encarrega d'interpretar els diversos encadenaments d'esdeveniments observats, i notifica l'estat de funcionament del procés a l'operador. Per aquest nivell, s'ha desenvolupat una metodologia per a l'obtenció d'un model comportamental de la planta, com a màquina d'estats finits. El procediment de modelatge proposat considera la definició de models associats a diversos components del procés i a les interaccions que s'estableixen entre ells. L'autòmat final s'obté per composició de tots aquests models.Ambdós nivells es nodreixen del coneixement heurístic de l'operador: definint els esdeveniments significatius a detectar mitjançant l'anàlisi dels senyals, i associant els encadenaments esperats a estats de funcionament.La metodologia de disseny del SIS ha estat validada satisfactòriament mitjançant l'aplicació a un procés biotecnològic i a una estació de mecanitzat.Diversos resultats d'aquest treball han estat presentats a congressos nacionals i internacionals. / OF THE THESISOver the last decade, the design of supervisory systems for industrial processes has received a great deal of attention. One reason for this is the increased demands on performance, flexibility, and safety caused by increased awareness, environmental regulations, and customer-driven productivity.The main purpose of this Thesis is the design of a Supervisory Intelligent System (SIS). The proposed SIS is concerned with process monitoring, consisting in process functional state identification and its notification to the operator. For example, on faulty state detection, the operator could apply the appropriate corrective action.The originality of this work consists in proposing a design methodology based on the interpretation of significative events, detected from measured signals. In this methodology, heuristic knowledge supplied by operators and experts is very important. A two level supervision architecture is proposed: the interface and the supervisor.The interface deals with abstracting significative process information by means of measured signals data analysis. For this level, a design methodology based on the sliding window paradigm has been formalised. A window is a signal data set, characterised by a duration and a sliding time. Running a specific computation on this data set produces new data. So, the analysis of different consecutive windows leads to a new signal on which a similar procedure can then be applied. Following this iterative process, a signal can be derived which carries enough significative information according to the operator. This information is transmitted to the supervisor as events. The supervisor translates observed event sequences into process states, which later are notified to the operator. For this level, we propose a design methodology that supplies a behavioural plant model by means of a finite state machine description. This procedure is based on modelling process components and interactions between them. The final automaton is obtained by the composition of all these models.Both SIS levels depend on the available operator heuristic knowledge: defining significative events which are to be detected using data analysis, and linking expected event sequences to functional states.The SIS design methodology has been successfully validated through its application to a biotechnological process and a milling machine.Several results in this dissertation have been presented at national and international conferences.

Made available in DSpace on 2016-06-02T19:06:27Z (GMT). No. of bitstreams: 1 DissARS.pdf: 1479466 bytes, checksum: b0e4db694de6cc642354b502d3f9187f (MD5) Previous issue date: 2005-05-31 / Universidade Federal de Sao Carlos / Production planning in automated manufacturing environments is a complex task which comprehends, among other activities, the production sequencing. One of the techniques used to determine the best production sequencing is the simulation. All possible sequences can be simulated and, right after that, the sequences with the best performance are verified, according to some criteria. However, due to the combinatory nature of the sequencing, the simulation of all possible combinations takes long time, becoming quite impracticable in many cases. Besides, events that were not programmed occur frequently in automated manufacturing environments and the decision maker must be fast choosing alternatives. Aiming to contour this problem, this work proposes a fuzzy analyser of sceneries for the production sequencing (ANCSP). The goal is to reduce the quantity of sequences to be simulated by the decision maker when non programmed events occur in the productive system, according to a defined performance criteria. The maximum quantity of generated sequences is calculated based on the time avaliable to realize the simulation. The proposed model intends to support the usage of the simulation technique by the decision makers. The ANCSP was implemented and various tests were performed. A specific model of flexible manufacturing system was considered to perform the tests. The performance of the ANCSP was analyzed comparing its results with those presented by a simulation software, for the same test sets and in accordance to the performance measures established. / O planejamento da produção em ambientes automatizados de manufatura é uma tarefa complexa que compreende, dentre outras atividades, o sequenciamento da produção. Uma das técnicas usadas para determinar qual a melhor sequência de produção é a simulação. Todas as sequências possíveis são simuladas e, logo após, verifica-se qual a sequência que obteve o melhor desempenho, de acordo com algum critério. Entretanto, devido à natureza combinatória do sequenciamento, a simulação de todas as sequências possíveis consome muito tempo, tornando-se inviável em muitos casos. Além disso, eventos não programados ocorrem com frequência nos ambientes automatizados de manufatura e o tomador de decisão precisa ter escolhas rápidas. Visando contornar esses problemas, esse trabalho propõe um analisador nebuloso de cen´arios para o sequenciamento da produção (ANCSP). O objetivo é reduzir a quantidade de sequências a serem simuladas pelo tomador de decis ao no momento da ocorrência de eventos não programados no sistema produtivo, de acordo com alguma medida de desempenho. A quantidade máxima de sequências geradas é calculada com base no tempo que o tomador de decisão possui para realizar a simulação. Dessa maneira, o modelo proposto pretende apoiar o uso da técnica de simulação pelos tomadores de decisão. O ANCSP foi implementado e diversos testes foram realizados. Para a realização dos testes, considerou-se um modelo específico de sistema flexível de manufatura. O desempenho do ANCSP foi analisado mediante comparação dos seus resultados com aqueles apresentados por um software de simulação, para o mesmo conjunto de testes e de acordo com as medidas de desempenho estabelecidas.

Made available in DSpace on 2016-12-12T17:38:37Z (GMT). No. of bitstreams: 1 Moacyr Carlos Possan Junior.pdf: 1940795 bytes, checksum: 58824c0ca3ed2180f9e245d34118e117 (MD5) Previous issue date: 2009-12-15 / Coordenação de Aperfeiçoamento de Pessoal de Nível Superior / This work presents a new methodology for the modeling of supervisory control systems based on state machines with outputs, obtained from the automata which represent the supervisors found with the usage of the Supervisory Control Theory (SCT) of Discrete Event Systems (DES). Procedures like that are useful to create the documentation which represents the control logic for large scale systems and for the code generation, as well as allows that the documentation and program code updates be easier when new requirements to change the control logic in flexible systems appear. Besides, it makes way for the generation of more reliable solutions and also for the possibility of automatic code generation. The proposed technique consists on the obtaining of finite state machines with outputs using as input information the automata of the supervisors obtained by the SCT and the control actions of the system, where the control logic redundancies existing in the model of the automata are eliminated. Methodologies based on either monolithic or local modular approach are proposed, where the obtained machines are further simplified in order to have simpler models which are used as templates for the implementation in Programmable Logic Controller (PLC) using Ladder language. The methodology is shown using a simple manufacturing system as example to help on its understanding. Besides, this work deals with the difficulties found in the migration from the event based theory in the TCS to the signal based practice for the CLPs. After the presentation of this methodology, it is performed the modeling and implementation for a larger system, a manufacturing cell where a comparison with another existing methodology which also has the SCT as base is performed in order to verify the advantages and disadvantages of such methodology. / Este trabalho apresenta uma nova metodologia para a modelagem de sistemas de controle supervisório baseados em máquinas de estados com saídas, obtidas a partir dos autômatos que representam os supervisores encontrados com o uso da Teoria de Controle Supervisório (TCS) de Sistemas a Eventos Discretos (SEDs). Procedimentos como este são úteis para criar a documentação relativa à especificações de sistemas de grande porte e à geração de código, assim como permitem que a atualização da documentação e do código seja facilitada quando surgem novos requisitos para variação da lógica de controle em sistemas flexíveis. Além disso, isso abre espaço para a geração de soluções mais confiáveis e também para a possibilidade de geração automática de código. A técnica proposta consiste em obter máquinas de estados finitos com saídas usando como informação os autômatos dos supervisores obtidos por intermédio da TCS e as ações de controle do sistema, onde redundâncias da lógica de controle presentes no modelo do autômato são eliminadas. São propostas abordagens tanto no contexto monolítico quanto no contexto modular local, onde as máquinas obtidas são reduzidas posteriormente com o intuito de obter modelos mais simples, que servem como referência para a implementação em Controlador Lógico Programável (CLP) usando linguagem Ladder. A metodologia é demonstrada usando um sistema de manufatura simples como exemplo a fim de facilitar sua compreensão. Além disso, este trabalho trata das dificuldades encontradas na migração da teoria baseada em eventos da TCS na prática baseada em sinais dos CLPs. Após a apresentação da metodologia, é feita a modelagem e implementação para um sistema de maior porte, uma célula de manufatura onde é efetuada uma comparação com uma metodologia já existente que também têm como base a TCS, com o intuito de verificar as vantagens e desvantagens dessa metodologia

Coordenação de Aperfeiçoamento de Pessoal de Nível Superior - CAPES / A very important aspect in robotics is the decision making and execution the system uses to achieve its goals. In literature, many different approaches can be found about how the robot must behave in different situations in order to have a more robust system. Subsumption architecture is one of the most used and referenced in the area. In this architecture, the global task is divided into subtasks which are performed by behaviors organized in hierarchical layers. However, little research has been done regarding the stability analysis of this architecture. Behavioral changes imply in controller switching, which can lead the system to instability even in cases where all controllers are stable. In this work, a subsumption architecture with guaranteed stability is presented based on the theory of switched systems with main control objective. In addition, a formalism capable of allowing behaviors modeling in a simple and fast way is proposed based on the theory of discrete events systems. Tests in real environments were performed with the Pioneer P3-DX robot and obtained results demonstrate the proposed approach effectiveness. / Um aspecto muito importante na robótica é a tomada de decisão e execução que o sistema utiliza para alcançar seus objetivos. Na literatura, existem vários trabalhos diferentes para abordar como o robô deve se comportar diante de várias situações diferentes a fim de trazer uma maior robustez ao sistema, sendo a arquitetura de subsunção uma das mais utilizadas e referenciadas na área. Nesta arquitetura, a tarefa global é dividida em subtarefas que são executadas por comportamentos organizados em camadas de forma hierárquica. No entanto, pouco se pesquisa no que diz respeito a análise de estabilidade desta arquitetura, sendo que as mudanças de comportamento implicam em chaveamento de controladores, que por sua vez podem levar o sistema a instabilidade mesmo em casos em que todos os controladores sejam estáveis. Desta forma, neste trabalho é apresentada uma arquitetura de subsunção com prova de estabilidade garantida com base na teoria de controle chaveado com objetivo de controle principal. Além disso, um formalismo capaz de permitir a modelagem dos comportamentos de forma simples e rápida é proposto com base na teoria de sistemas a eventos discretos. Testes em ambientes reais foram realizados com o robô Pioneer P3-DX e os resultados obtidos comprovam a eficácia da abordagem proposta.

La complexification des systèmes et la réduction du nombre de capteurs nécessitent l’élaboration de méthodes de surveillance de plus en plus efficaces. Le travail de cette thèse s’inscrit dans ce contexte et porte sur le diagnostic et le pronostic des Systèmes à Événements Discrets (SED) temporisés. Les réseaux de Petri stochastiques partiellement mesurés sont utilisés pour modéliser le système. Le modèle représente à la fois le comportement nominal et le comportement dysfonctionnel du système. Il permet aussi de représenter ses capteurs à travers une mesure partielle des transitions et des places. Notre contribution porte sur l’exploitation de l’information temporelle pour le diagnostic et le pronostic des SED. À partir d’une suite de mesures datées, les comportements du système qui expliqueraient ces mesures sont d’abord déterminés. La probabilité de ces comportements est ensuite évaluée pour fournir un diagnostic du système en termes de probabilité d’occurrence d’un défaut. Dans le cas où une faute est diagnostiquée, une approche permettant d’estimer la distribution de sa date d’occurrence est proposée. L’objectif est de donner plus de détails sur cette faute afin de mieux la caractériser. Par ailleurs, la probabilité des comportements compatibles est exploitée pour estimer l’état actuel du système. Il s’agit de déterminer les marquages compatibles avec les mesures ainsi que leurs probabilités associées. À partir de cette estimation d’état, la prise en considération des évolutions possibles du système permet d’envisager la prédiction de la faute avant son occurrence. Une estimation de la probabilité d’occurrence de la faute sur un horizon de temps futur est ainsi obtenue. Celle-ci est ensuite étendue à l’évaluation de la durée de vie résiduelle du système. Enfin, une application des différentes approches développées sur un cas d’un système de tri est proposée. / Due to the increasing complexity of systems and to the limitation of sensors number, developing monitoring methods is a main issue. This PhD thesis deals with the fault diagnosis and prognosis of timed Discrete Event Systems (DES). For that purpose, partially observed stochastic Petri nets are used to model the system. The model represents both the nominal and faulty behaviors of the system and characterizes the uncertainty on the occurrence of events as random variables with exponential distributions. It also considers partial measurements of both markings and events to represent the sensors of the system. Our main contribution is to exploit the timed information, namely the dates of the measurements for the fault diagnosis and prognosis of DES. From the proposed model and collected measurements, the behaviors of the system that are consistent with those measurements are obtained. Based on the event dates, our approach consists in evaluating the probabilities of the consistent behaviors. The probability of faults occurrences is obtained as a consequence. When a fault is detected, a method to estimate its occurrence date is proposed. From the probability of the consistent trajectories, a state estimation is deduced. The future possible behaviors of the system, from the current state, are considered in order to achieve fault prediction. This prognosis result is extended to estimate the remaining useful life as a time interval. Finally, a case study representing a sorting system is proposed to show the applicability of the developed methods.

L'usage excessif des routes peut entraîner de nombreux inconvénients dont la pollution, les accidents et la congestion. Une solution accessible à court terme consiste à mettre en œuvre des systèmes de gestion de trafic. Dans ce cadre, nous proposons un formalisme, appelé Réseaux de Petri Lots Triangulaire, qui permet la modélisation et la simulation du trafic routier au niveau mésoscopique comme un système à événements discrets. Le RdPLots Triangulaire permet ainsi de décrire les caractéristiques globales du trafic routier: flux, densité et vitesse à travers la proposition d'une relation flux-densité triangulaire. Cette relation implique une modification de la dynamique des lots. Cette dynamique permet maintenant de représenter les deux états du trafic routier à savoir fluide et congestionné ainsi que les trois régimes dédiés au comportement libre, congestion et décongestion. Le calcul des flux instantanés des transitions est à présent réalisé par une méthode basée sur la technique de programmation linéaire en ajoutant une contrainte qui prend en compte l'état et le régime des lots. Pour modéliser des stratégies de contrôle telles que la variation de la vitesse limite (VSL), nous avons intégré au RdPLots Triangulaire des événements contrôlés qui permettent le changement de la vitesse maximale d'une place lot et le flux maximal d'une transition continue ou lot. Tous ces apports théoriques sont implémentés dans un logiciel que nous avons appelé SimuleauTri, sous lequel nous avons étudié des portions d'autoroute à partir des données réelles. Les résultats de simulation sont proches des mesures effectuées sur le terrain, et montrent la pertinence de RdPLots Triangulaire. / The excessive use of roads can cause many adverse effects including pollution, insecurity and congestion. The available short-term solution is the implementation of traffic management systems which optimize the flow and reduce congestion without needing additional infrastructures. In this context, we proposed a new formalism, called Triangular Batches Petri Nets (Triangular BPN), which combines modeling and simulation of traffic in mesoscopic level as a discrete event system. The Triangular BPN describing the overall characteristics of the road traffic such as flow, density, speed by representing a new triangular relation flow-density. This relation implies the modification of batches dynamic, which is now used to represent the two road traffic states : fluid and congested, as well as the three behaviors :free, congestion and decongestion. The calculation of the instantaneous firing flows is achieved by adding a constraint that takes into account the state and behavior of batches. A set of controlled events integrated to the Triangular BPN, that allow the variation of the maximum speed of batch place and the maximum flow of batch and continuous transition. These controlled events used to model the control strategies, such as variable speed limit (VSL). All these theoretical contributions implemented in a software that is called SimuleauTri and used to study a motorway portions from real data. The simulation results are close to the measurements on the ground and show the pertinence of Triangular BPN.

因應物聯網、機器人和雲端計算等系統快速的科技創新，我們需要更有效之方法來模型化由上述系統所架構出來愈趨複雜的動態資源配置系統，以解決類似瓶頸、死結等潛藏的系統控制相關問題。為了解決以派翠網路模型化大型系統一直存在的指數倍數成長之複雜性問題，一個即使運用MIP（混合整數規劃）方法於可達性分析也是完全NP（非確定性多項式時間）的問題，趙玉教授率先以開發k階和k網系統的控制相關狀態(CRSs)數量之封閉形式解決方案(簡稱封閉解)，來突破此一指數倍數成長複雜性的障礙。然而，對稱網路結構的屬性，限縮了此兩系統在模型化系統中可應用的範圍;同時由於不可避免的死結的狀況，也阻礙了兩個系統的並行處理能力。為了延伸派翠網路封閉解的研究領域至非對稱系統，及強化對大型即時動態資源分配非對稱系統的模型化能力，本論文擴展派翠網路封閉解的研究領域至所謂的「左邊一般化k階系統」、「左邊一般化k網系統」和「A網系統」等三種不同類型的基本非對稱系統。「左邊一般化k階（相對於k網）系統」是在k階（相對於k網）之控製行程的任意位置，使用一非共享資源的網路模型，為模型化具有客製化製程系統之基本網路架構; 「A網系統」是在一k階系統中，連接一頂層非共享圈子網（TNCS）的網路模型，在實際應用中，為模型化具共享相同製程系統的基本網路架構。本論文透過非共用資源在等價網路(k階（相對於k網）)的影響性分析，及其等價網路之封閉解為基礎，建構「左邊一般化k階（相對於k網）系統」之封閉解;在「A網系統」中，由於TNCS和連接的缺陷 k階系統兩個子系統的獨立性，首先我們可以從其相關之k階系統的封閉解中，排除不可能狀態的數量，推導出缺陷k階系統的封閉解，然後以累計加總缺陷k階系統及TNCS兩個子系統在各種TNCS中存在不同權杖個數狀況下的封閉解乘積，構建出「A網系統」的封閉解。在實際應用中，我們可透過由封閉解所產生之即時CRS信息，強化對大型動態即時資源分配系統的模型化能力。例如，採用本論文所提出的避免死結演算法，可以在不用附加控制器之狀況下，實現k階和k網系統之並行處理的功能;並且可以在k-網系統中，在不用暫停所有系統的工作流程狀況下，實現動態行程配置的功能。除了應用虹吸計算方法構建非對稱系統的基礎封閉解外，本論文還提出了依據其反向網路被驗證的有效信息為基準，新的由模型驗證之以知識基礎的理論分析方法，加速派翠網路封閉解的建構。在此，本論文開啟了以變型k階系統為啟端，建構派翠網路封閉解新的研究時代。 / In the light of the rapid innovation of the Internet of Things (IoT), robot systems, and cloud computing systems, we need an efficient methodology to model gradually more and more complicated, real-time resource allocation systems (RAS), constructed using the systems mentioned above, for solving issues such as bottlenecks, deadlocks, and other embedded system-control-related problems. To solve the exponentially increasing complexity in the persistent problem of modeling large systems using Petri nets, which is an NP (nondeterministic polynomial time)-complete problem even when MIP (mixed integer programming) is employed for reachability analysis, Chao broke this barrier by developing the first closed-form solution (CFS) for the number of Control Related States (CRSs) for k-th order and k-net systems. However, the properties of symmetric net structures limit their application range in modeling systems; the inevitable deadlock obstructs the capability of concurrent processing in both systems. To enhance the capability of modeling large dynamic, real-time resource allocation in asymmetric systems, this dissertation extends the research on the CFS of PNs to the so-called Gen-Left k-th order system, the Gen-Left k-net system, and the A-net system, which comprise the three different types of fundamental asymmetric systems. A Gen-Left k-th order (resp. k-net) system is a k-th order (resp. k-net) system containing a non-sharing resource (NSR) at arbitrary locations in the control process, which is the fundamental net structure for modeling contained customized manufacturing processes inside a system. An A-net system is a k-th order system connected to a Top Non-sharing Circle Subnet (TNCS), which is the fundamental net structure to model a shared common manufacturing processing system in real applications. Based upon analyzing the effects of one NSR in the equivalent, the corresponding k-th order (resp. k-net) system, and an equivalent CFS, this dissertation derives the CFS for the Gen-Left k-th order (resp. k-net) system. Due to the independence of the TNCS and the connected Deficient k-th order system, we can first derive the CFS for a Deficient k-th order system just by excluding the number of impossible states from the CFS for its corresponding k-th order system. Then, the CFS of an A-net is constructed by summing the products of the CFS for the two sub-systems in each different case under the condition of the number of tokens inside TNCS. Based on real-time CRS information derived, we can enhance the capability for modeling a large dynamic, real-time resource allocation system in real applications. Employing the proposed deadlock-avoidance algorithm, for instance, we can realize concurrent processing in both k-th order and k-net systems without additional controllers being implemented; and the function of dynamic process allocation in a k-net system without suspending the system’s working flows. In addition to applying siphon computation to construct the fundamental CFS for asymmetric systems, this dissertation pioneers and proposes a new knowledge-based, analysis methodology, called proof by model, to accelerate the construction of the CFS for a PN based upon the validation information from its reverse net. This dissertation opens a new research era for constructing the CFS for PNs beginning from the Variant k-th order system.

Les rapports d’activité de l’Établissement Français du Sang (EFS) font état d’une demande croissante de produits sanguins labiles (PSL) tels les concentrés globules rouges (CGR), les plaquettes, et le plasma. Afin d’assurer la demande vitale en PSL, il est primordial d’optimiser la logistique liée aux activités de collecte du sang et de ses composants. Pour faire face à cette situation, l’EFS Auvergne-Loire mène une réflexion dans le but d’utiliser de manière plus efficiente les dispositifs de collecte en sites fixes et mobiles pour améliorer (i) la qualité de service rendue au donneur, et (ii) l’efficience de l’utilisation des ressources humaines. Dans ce contexte nous avons développé dans cette thèse des outils opérationnels pour (i) la modélisation des dispositifs de collecte, (ii) la régulation des flux de donneurs, et (iii) la planification de collectes mobiles.La méthode d'analyse des dispositifs de collecte est basée sur des techniques de simulation à événements discrets. Une modélisation préalable des flux de donneurs dans les systèmes de collecte en sites fixes et mobiles à l’aide de réseaux de Petri a été proposée. Pour la régulation de flux de donneurs, notamment pour la planification optimale des rendez-vous des donneurs et la planification de la capacité dans les systèmes de collecte au site fixe, deux approches ont été abordées: (a) Construction d'un algorithme basée sur techniques d'optimisation stochastique via simulation ; (b) Programmation mathématique: Modèle de programmation en nombres entiers non-linéaire (MINLP) basée sur réseaux de files d'attente et représentation et évaluation des systèmes à événements discrets à travers de programmation mathématique. Pour la planification de collectes mobiles. Deux types de modèles ont été développés : (a) Au niveau tactique : Modèles de programmation en nombres entiers linéaire (MIP) pour planifier les semaines de collectes pour chaque ensemble disponible sur un horizon de temps pour garantir l'autosuffisance à niveau régional des CGR. (b) Au niveau opérationnel : Modèle de programmation en nombres entiers linéaire (MIP) pour l’organisation du travail des équipes en charge de la collecte. / Activity reports of the French Blood Establishment (EFS) indicate a growing demand for Labile Blood Products (LBP) as red blood cells (RBC), platelets and plasma. To ensure the vital demand of labile blood products (LBP), it’s essential to optimize the logistics related with the collection of blood components. To deal with this situation, the EFS Auvergne-Loire carry out a reflection in order to use more efficiently the collection devices in fixed and mobile sites, to improve the quality of service offered to the donor and the efficiency of human resources. In this context we have developed in this thesis operational tools for (i) modeling of blood collection devices (ii) The regulation of flows donors (iii) Planning of bloodmobile collections.The method analysis of collection devices is based on techniques of discrete event simulation. A preliminary modeling of donors’ flow in fixed and mobile collection systems using Petri nets was conducted. For the regulation of flow of donors, i.e. the optimal capacity planning and appointment scheduling of blood collections, two approaches were considered: (a) Simulation based-optimization.(b) Mathematical Programming: Mixed integer nonlinear programming (MINLP) based on queuing networks and mathematical programming representation of discrete event systems. For planning of bloodmobile collections. Two models have been developed: (a) At the tactical level: Mixed integer linear programming (MIP) to determine the weeks in which the mobile collection must be organized in order to ensure the regional self-sufficiency of RBC. (b) At the operational level: Mixed integer linear programming (MIP) for the planning of human resources in charge of blood collections.

Made available in DSpace on 2016-12-12T17:38:32Z (GMT). No. of bitstreams: 1 Alexandre Pinotti.pdf: 2613359 bytes, checksum: 2102dc273398a9bfa8e51bb28b5fded1 (MD5) Previous issue date: 2012-12-11 / Coordenação de Aperfeiçoamento de Pessoal de Nível Superior / This work presents a method for embedded systems design based on the Supervisory Control Theory for Discrete-Event Systems. The method is composed of steps comprising the specification phase until the approval of the control system. The conception phase is based on the local modular approach for the synthesis of minimally restrictive supervisors that constrains the plant behavior by disabling controllable events and are nonblocking with respect to the set of marked states. The method also includes an implementation architecture for the supervisory control applied to microcontrollers to solve problems such as causality, choice and inexact synchronization. An interface concentrates all controllable and uncontrollable events generation. It deals with the choice problem when reduced supervisors are implemented, randomly choosing one controllable event among the possible ones. This dissertation also presents a tool developed for the automatic code generation of the proposed implementation structure. The main module code is generated to be independent of the number of supervisors and plant models, that is, is the same for any control application. The tool is used to obtain the control applied to a case study and also for the temperature control of a commercial refrigerator. The control system has been validated using the same tools applied for the validation of household appliances at Whirlpool Corporation / Neste trabalho é proposto um método de projeto para sistemas embarcados concebido com base na Teoria de Controle Supervisório de Sistemas a Eventos Discretos. O método é composto por etapas que vão desde a especificação até a aprovação do sistema de controle. A etapa de concepção do método utiliza da abordagem modular local para síntese de supervisores minimamente restritivos que limitam o comportamento da planta através da desabilitação de eventos controláveis e são não bloqueantes em relação ao conjunto de estados marcados. O método ainda inclui uma arquitetura de implementação do controle supervisório direcionada para microcontroladores, visando solucionar os problemas da causalidade, escolha e sincronização inexata. Uma interface é concebida para concentrar a geração de eventos controláveis e não controláveis. Apresenta-se uma solução para o problema da escolha quando são implementados supervisores reduzidos sendo tal escolha realizada de modo online definindo um evento controlável, entre os possíveis, de forma aleatória. Apresenta-se uma ferramenta desenvolvida para a geração de código baseada na estrutura de implementação proposta. O código do módulo principal é gerado de forma a ser independente do número de supervisores e modelos de planta envolvidos, sendo o mesmo para qualquer aplicação de controle. Utiliza-se a ferramenta para obtenção do código da lógica de controle em um estudo de caso e para a regulação de temperatura em um refrigerador comercial. A validação do controle é realizada utilizando-se de ferramentas aplicadas à validação de eletrodomésticos da linha branca na Whirlpool Eletrodomésticos.