O design de sistemas automatizados inteligentes é fortemente dependente da etapa inicial de análise de requisitos, que além de suprimir possíveis incongruências - próprias desta fase inicial - provê um modelo inicial e funcional do sistema a ser implementado, capaz de orientar a definição dos parâmetros (design parameters) e em seguida a própria implementação. Um grande esforço tem sido empregado na área de Inteligência Artificial para definir planejadores automáticos confiáveis que possam ser usados na solução de problemas reais, que geralmente possuem um número elevado de parâmetros. Isto leva a uma situação onde métodos formais, geralmente aplicados em abordagens independentes de domínio, precisam ser aliados a métodos mais pragmáticos para produzir bons resultados. Seguindo esse princípio,o presente trabalho propõe um método de projeto no qual o usuário podem fazer a aquisição de conhecimento, modelar o domínio (tanto o domínio de aplicação quanto o domínio do problema de planejamento), fazer uma análise dinâmica do modelo e eventualmente verificá-lo usando linguagens conhecidas como UML, as Redes de Petri, e HTN, mantendo as características hierárquicas do problema. Esta abordagem demanda novos planejadores automáticos que consideram a abstração do sistema hierárquico, que é derivado de um modelo hierárquico de requisitos e de uma análise unificada feita também em redes de Petri hierárquicas. / The design of intelligent systems is strongly dependent of the requirements analysis initial stage, wich can remove possible inconsistencies - own this early stage - providing a primary functional model of the system being implemented. Besides that, it can be able to guide the definition of the parameters (design parameters) and then the implementation itself. A lot of effort has been employed in Artificial Intelligence field to define reliable automated planning systems that can be used to solve real problems, which generally have a large number of parameters. This leads to a situation where formal methods, generally applied to solve domain-independent problems, need to be combined with more pragmatic methods to produce good results. Following this principle, this work proposes a design method in which the user can make the acquisition of knowledge, model the domain (both the work domain and the planning problem domain), make a dynamic analysis of the model and eventually simulate it using well-kown language as UML, Petri Nets, and HTN, maintaining the hierarchical characteristics of the problem. This approach demands new automated planners who consider the abstraction of hierarchical system, which is derived from a hierarchical model requirements and an unified analysis made in hierarchical Petri nets.

Submitted by Renata Lopes (renatasil82@gmail.com) on 2017-04-25T11:55:26Z No. of bitstreams: 1 wolmararaujoneto.pdf: 9045744 bytes, checksum: 685167b5aabc68d680681643c44b7a4e (MD5) / Approved for entry into archive by Adriana Oliveira (adriana.oliveira@ufjf.edu.br) on 2017-04-25T12:12:34Z (GMT) No. of bitstreams: 1 wolmararaujoneto.pdf: 9045744 bytes, checksum: 685167b5aabc68d680681643c44b7a4e (MD5) / Made available in DSpace on 2017-04-25T12:12:34Z (GMT). No. of bitstreams: 1 wolmararaujoneto.pdf: 9045744 bytes, checksum: 685167b5aabc68d680681643c44b7a4e (MD5) Previous issue date: 2014-08-25 / CNPq - Conselho Nacional de Desenvolvimento Científico e Tecnológico / A presente dissertação tem como objetivo principal desenvolver uma metodologia capaz de auxiliar no projeto e implementação de controles para sistemas a eventos discretos (SED) de forma a otimizar a modelagem, documentação e implantação da planta estudada. Para tanto a definição tradicional de autômato foi alterado para incluir um novo subconjunto de estados obrigatórios, isto é, estados que o sistema deve passar antes de chegar a um estado marcado. Seguindo a modelagem tradicional, cada subsistema é modelado através desta nova abordagem. Em uma segunda etapa, uma nova iteração de análise de cada subsistema é realizada para restringir situações indesejadas do sistema. Com esta fase finalizada os subsistemas são mesclados através de uma técnica tradicional de autômatos em paralelo. O sistema final resultante é apresentado a um otimizador, baseado em PROLOG, que busca a melhor sequência de eventos obedecendo a todas as restrições modeladas e termine no estado marcado informado pelo projeto. Este resultado fornece a Rede de Petri ideal do sistema e sua programação em GRAFCET. Tais métodos serão testados em componentes de um sistema de manufatura flexível real. / The present master thesis has as its main goal to develop a methodology able to assist in design and implementation of discrete event system (DES) controllers in order to optimize the modeling, documentation and deployment of plant in study. To do so the automaton traditional concept was changed to include a new subset of mandatory states, i.e. states that the system should pass before reach a marked state. Following the traditional modeling, each subsystem is modeled using this new approach. In a second step, a new iteration of analysis of each subsystem is performed to restrain system’s unwanted situations. At the end of this step the subsystems are composed by a traditional parallel automatons technique. The resulting system is presented to an optimizer, based in PROLOG, which searches the best event sequence obeying to all modeled restrictions and ends in the marked state defined in design. This result provides the ideal Petri Net of the system and its GRAFCET programming. Such methods will be tested in a flexible real manufacturing system.

Cette thèse a pour objectif la génération de séquences de franchissement dans les Réseaux de Petri Temporisés (RdPT) en utilisant une approche incrémentale. Le verrou principal auquel est confronté ce travail est l’explosion combinatoire qui résulte de la construction classique du graphe d’accessibilité du RdPT. Nous proposons d’utiliser la notion de séquence de steps temporisés, afin d’exprimer progressivement l’ensemble des séquences de franchissements permettant de passer d’un état courant à un état cible. La notion de step temporisé correspond à une abstraction logique du comportement du système considéré. Le caractère incrémental de l’approche a pour objectif de gagner en efficacité. En effet, il consiste à exprimer tout nouvel état de la résolution par rapport à une profondeur K+1, en fonction d’un état atteint à la profondeur K. Ainsi, nous proposons plusieurs algorithmes de recherche incrémentale permettant d'améliorer l'efficacité de la résolution des problèmes d'accessibilité. Nous utilisons ensuite la programmation par contraintes pour modéliser le problème de recherche d’accessibilité dans un RdPT et mettre en œuvre notre approche incrémentale. Notre approche permet également d’ajouter des contraintes spécifiques à un contexte de résolution. Nous avons notamment utilisé cette possibilité pour proposer des techniques d'identification des jetons dans un RdPT borné, dans le cadre de la reconfiguration des systèmes manufacturiers. Nous concluons par l’évaluation de différentes applications constituant des « benchmarks » permettant d’illustrer l'efficacité des approches proposées / This PhD thesis is dedicated to the generation of firing sequences in Timed Petri Net (TPN) using an incremental approach. To reduce the influence of the well-known combinatorial explosion issue, a unique sequence of timed steps is introduced to represent implicitly the underlying reachability graph of the TPN, without needing its whole construction. This sequence of timed steps is developed based on the logical abstraction technique. The advantage of the incremental approach is that it can express any state just from the last step information, instead of representing all states before.Several incremental search algorithms are introduced to improve the efficiency of our methodology. Constraint programming techniques are used to model and solve our incremental model, in which search strategies are developed that can search for solutions more efficiently. Our methodology can be used to add specific constraints to model realistic systems. Token identification techniques are developed to handle token confusion issues that appear when addressing the reconfiguration of manufacturing systems. Experimental benchmarks illustrate the effectiveness of approaches proposed in this thesis

Un environnement spatial naturel hostile, les systèmes spatiaux de télédétection traditionnels,monolithiques et téléopérés depuis le sol, demeurent vulnérables face à un nombre croissant de menaces émergentes issues de l’environnement spatial artificiel (armes antisatellites,débris). Plutôt que de chercher à protéger physiquement les satellites, nous proposons d’adopter une stratégie fondée sur le concept de résilience, qui traduit la capacité d’un système à poursuivre sa mission face à des aléas imprévisibles, fût-ce en mode dégradé. En nous appuyant sur de récentes innovations dans les technologies spatiales, nous nous sommes intéressés à la conception et à l’évaluation d’architectures système fondées sur la mise en réseau de constellations de microsatellites hétérogènes, autonomes et communicants.Afin d’étudier de telles architectures, appelées réseaux de constellations autonomes (RCA),nous proposons une approche de modélisation ainsi qu’un outil de simulation à base de réseaux de Petri imbriqués. Grâce à des métriques issues des réseaux de télécommunication ainsi que des systèmes multiagents, nous avons évalué les RCA au travers de leurs performances opérationnelles et de leurs capacités de communication, nominales puis dans divers modes dégradés. Du point de vue de la résilience, les résultats présentés mettent en évidence l’intérêt de disposer de réseaux de communication denses et de modules de reconfiguration autonomes embarqués au sein même des satellites. / Although Earth observation space systems are designed with strong safety requirements due to an hostile natural space environment, they remain vulnerable to an increasing range of emerging space threats such as antisatellite weapons or orbital debris. Instead of a physical protection of these monolithic and remote-controlled assets, we propose a design strategy based on the concept of resilience which is the ability of a system to maintain an acceptable level of performance in the presence of unforeseeable disturbance.Thanks to the latest space technology innovations, we devised new system architectures composed of networked constellations of heterogeneous and autonomous interacting microsatellites. We decided to model these architectures, called autonomous networked constellations (RCA in French), thanks to Petri nets, and more specifically their nets-within-nets variant. Using telecommunication and multiagent metrics, we assessed different RCA configurations through their operational performance and communicability, for nominal as wellas degraded modes. From the resilience point of view, we present quantitative results that point out the benefits of dense space networks and embedded autonomous reconfiguration modules.

Presently, most spacecraft are controlled from ground involving activities such as up-linking the schedule of daily operations and monitoring health parameters. These activities lead to a cognitive overload on human operators. Imaging/science opportunities are lost, if any discrepancies occur during the execution of pre-planned sequences. Consequently, advanced space exploration systems for future needs demand on-board intelligence and autonomy. This thesis attempts to solve the problem of providing an adequate degree of autonomy in future generation of spacecraft. The autonomous spacecraft accept high-level goals from users and make decisions on-board to generate detailed command schedules satisfying stringent constraints posed by the harsh environment of the space, visibility criteria and scarce on-board resources. They reconfigure themselves in case of any failure and re-plan when needed. Autonomy concepts are derived in the context of complex systems by drawing analogy to living organisms and social organisations. A general autonomy framework may be defined with a six level structure comprising of the following capabilities -reflexes, awareness, self-regulation, self-healing, self-adaptation and self-evolution. A generic and reusable software architecture is proposed using hybrid multi-agent systems, which are arranged in a hierarchical manner using two types of decomposition viz. stratum and layer. The software architecture of the autonomous spacecraft is modeled as a stratified agent with a deliberative stratum, which achieves adaptive behaviour and a reactive stratum, which achieves reactive behaviour. Each individual agent has a generic structure comprising of perception, action, communication and knowledge components. It achieves the specialist capability through model-based reasoning. The knowledge models encompass: Planning knowledge describing higher-level goals, task structure and method of achieving the goals, Control knowledge encompassing the static and dynamic models of the spacecraft and Diagnostic knowledge incorporating the cause-effect relationships. The deliberative stratum is capable of planning in different time horizons and is, in turn, organised into a hierarchical agent system with three layers corresponding to different time horizons. It is composed of a long-term, medium-term and short-term planning agents, focusing on strategic issues, spacecraft level resources and specific spacecraft states respectively. The power of Petri nets is exploited for knowledge modeling as well as for plan representation. The ability of Petri nets to represent causality, concurrency and conflict relations explicitly makes it an excellent tool for representing the planning problem. Hierarchical Timed Petri Net is chosen for our modeling, since it captures the temporal requirements of the real-time spacecraft operations as well as facilitates the modeling of the system with multiple levels of abstraction. The necessary primitives for the plan representation are defined. In hierarchical modeling using Petri nets, refinement is done by a compound (high-level) transition. A compound transition models either a complex activity, which corresponds to high-level operation on spacecraft or a method, which corresponds to the agent capability. At the lowest layer, a transition in the plan represents a primitive command to the spacecraft, such as ‘switch on camera’. The Petri net unfolding technique, which is a partial order approach, is applied to derive the plans from the dynamic knowledge models. This tackles the problem of combinatorial explosion. A hierarchical planning approach is followed, in which the abstract plan is recursively decomposed using the unfolding technique and refined by way of exercising the appropriate decisions in each layer. The reactive stratum is configured with three peer level agents. The control agent executes the command schedule and has the capability for reflex action. Structural properties of Petri nets are exploited by the execution-monitoring agent and the diagnostic agent for system level diagnosis. Fault tree method is applied for fine granularity diagnosis. The resultant architecture is a cost-effective solution, since it permits reusability of knowledge models across similar missions. The knowledge models are formally verified for ensuring the absence of deadlocks, buffer overflows, recoverability and detection of unreachable modules using Petri net properties such as reachability, liveness, boundedness, safeness, reversibility and home state. The high-risk components are subjected to safety property verification, which makes the system rugged. The hierarchical composition of Petri net models (which are independently verified), preserves liveness and boundedness characteristics and thus ensuring the reliability of the integrated models. This, in turn, ensures that reliable plans are generated on-board using these good quality models. The models of the system components viz. partial order plan, conditional plan, dynamic world model, reflex model, resource model and the hierarchical models are developed and demonstrated using HPSIM and Moses Tool Suite, using examples from spacecraft domain. The long-term planning agent, with hierarchical world models, for handling high-level goals is developed and simulated using Moses Tool Suite. The plan generation using unfolding approach is demonstrated using VIPTool, which has the partial order analysis capability. In summary, the main contributions include (a) Definition of a general framework for spacecraft autonomy; (b) design of a generic and reusable architecture for autonomous spacecraft using hybrid multi-agent concepts; (c) unified knowledge representation and reasoning using Petri nets across various strata/layers; (d) application of Petri net unfolding technique in a hierarchical manner for plan generation; (e) use of structural properties of Petri nets for fault identification and location; (f) verification and validation of Petri net models using Petri net properties and (g) simulation and demonstration of the system components viz. partial order plan, conditional plan, dynamic world model, reflex model, resource model and hierarchical models, by developing examples from spacecraft domain, using HPSIM and Moses Tool Suite and demonstration of plan generation using unfolding technique using VIPTool.

Les travaux de cette thèse portent sur l'analyse des comportements chaotiques dans les convertisseurs multicellulaires séries. Ces systèmes à commutationpeuvent présenter une variété de phénomènes complexes liés à des bifurcationset au chaos. Sachant qu'un convertisseur de puissance qui a une charge purementdissipative, ne peut générer un comportement chaotique, nous avons dans la première partie de cette thèse, connecté un hacheur à deux cellules à une charge non linéaire non strictement dissipative et nous avons analysé ses comportements à l'aide des propriétés dynamiques de base et présenté les routes vers le chaos. La fin de cette partie a été consacrée à l'étude du hacheur à cinq cellules qui est une généralisation du hacheur à deux cellules. Afin de supprimer le comportement chaotique, la deuxième partie du travail a été consacrée à la synthèse d'une loi de commande hybride basé sur la modélisation par réseaux de Petri pour la régulation des tensions des condensateurs flottants et du courant de charge. / This thesis deals with the analysis of chaotic behaviors in serial multicellularconverters. These switching systems can have a variety of complex phenomenaassociated with bifurcations and chaos. Knowing that a power converter that has a purely dissipative load cannot generate chaotic behavior, we've in the first part of this thesis, we connected a two-cell chopper to a nonlinear load not strictly dissipative and we've analyzed its behaviors by using some basic dynamic properties and thus presented the routes to chaos. The end of this part was devoted to the study of the 5-cell chopper which is a generalization of the two-cell chopper. In order to eliminate the chaotic behavior, the second part was devoted to the synthesis of a controlled law based on hybrid modeling of Petri nets for the regulation of capacitor voltages and current load.

O uso de técnicas e métodos formais contribui para o desenvolvimento de sistemas confiáveis. No entanto, apesar do rigor obtido, em geral, é necessário que essas técnicas sejam complementadas com atividades de teste e validação. Deve-se ressaltar que o custo para eliminar erros encontrados nas etapas iniciais de desenvolvimento é menor do que quando esses erros são encontrados nas fases posteriores. Dessa forma, é essencial a condução de atividades de VV&T - Verificação, Validação e Teste - desde as primeiras fases de desenvolvimento. Critérios de teste, como uma forma sistemática de avaliar e/ou gerar casos de teste de qualidade e, dessa forma, contribuir para aumentar a qualidade da atividade de teste, têm sido investigados para o teste de especificação de Sistemas Reativos. A técnica Redes de Petri Coloridas tem sido constantemente utilizada para a especificação do aspecto comportamental de Sistemas Reativos. Apesar de existirem diversas técnicas de análise, um aspecto não considerado é a cobertura alcançada, visto que, em geral, a aplicação exaustiva não é viável devido ao alto custo. Considerando a relevância do estabelecimento de métodos sistemáticos para o teste e validação dessas especificações, este trabalho propõe a aplicação do critério de teste Análise de Mutantes para o teste de Redes de Petri Coloridas. Neste trabalho foram almejados três objetivos principais, os quais podem ser divididos em estudos teóricos, estudos empíricos e automatização. No contexto de estudos teóricos, foi realizada a definição e embasamento teórico para possibilitar a aplicação da Análise de Mutantes no contexto de Redes de Petri Coloridas. Além disso, investigaram-se mecanismos genéricos para a descrição e geração de mutantes. Definiu-se um algoritmo para a geração de casos de teste baseado na Análise de Mutantes. No contexto de estudos empíricos, foram conduzidos estudos de caso para avaliar a aplicabilidade e eficácia dos resultados teóricos obtidos. Finalmente, no contexto de automatização, foram desenvolvidas ferramentas de apoio à aplicação da Análise de Mutantes. / The usage of formal methods and techniques contributes to the development of highly reliable system, but, in spite of the achieved rigour, these techniques must be complemented with testing and validation activities. It should be highlighted that the cost to eliminate errors found in the early phases of development is smaller than when those errors are found in the later phases. Therefore, the accomplishment of VV&T activities - Verification, Validation and Test - starting at the first development phases is essential. Testing criteria, as a systematic way to evaluate and/or generate test cases, contributing, therefore, to improve the quality of the test activity, have been proposed for testing reactive systems specifications. A technique that has been steadily employed for specifying the behavioural aspect of reactive systems is the coloured Petri nets. Although there are several analysis and validation techniques, a usually neglected aspect is the achieved coverage, given that, in general, the exhaustive application is not feasible due to its high cost. Considering the relevance of establishing systematic methods for the test and validation of coloured Petri nets based specification, this work proposes the investigation of the viability of applying Mutation Testing to test coloured Petri nets. In this work three main goals were pursued, which can be grouped in: theoretical studies, empirical studies and tool development. In the context of theoretical studies, it was accomplished the definition of theoretical concepts to enable the application of Mutant Analysis in the context of coloured Petri nets. Moreover, a mutation-based algorithm was defined to generate test sequences for Petri nets. In the context of empirical studies, case studies were carried out to evaluate the applicability and effectiveness of the achieved theoretical results. Finally, in the context of tool development, tools for supporting the application of Mutation Testing were developed.

Les systèmes d'alarmes jouent un rôle critique dans la bonne exploitation des installations industrielles modernes. Cependant, dans la plupart de ces systèmes, les alarmes ne sont pas toujours traitées correctement par les opérateurs car il y a régulièrement beaucoup trop d’alarmes à gérer, notamment lors des avalanches d’alarmes. Pour réduire le flux d'alarmes, notre approche consiste à détecter des redondances entre alarmes qui pourraient être supprimées. Pour atteindre cet objectif, nous recherchons dans un premier temps les adjacences fréquentes entre les alarmes contenues dans un historique. Ceci est réalisé en adaptant l’algorithme de recherche de motifs fréquents AprioriAll. Nous explorons également une seconde méthode consistant à trouver des précédences systématiques. Pour les découvrir, nous identifions les relations de domination et de mutuelle dépendance contenues dans l’historique des alarmes. Pour faciliter l’analyse experte, les relations découvertes sont traduites sous la forme d’un réseau de Pétri.Ces deux méthodes sont ensuite confrontées à un historique d’alarmes industriel fourni par General Electric. Les résultats obtenus montrent que nos deux méthodes permettent une réduction globale du flux d'alarmes qui est plus importante durant les avalanches. / Alarm systems play an important role for the safe and efficient operation of modern industrial plants. However, in most of industrial alarm systems, alarm flows cannot always be correctly managed by the operators as they often turn into alarm floods, sequences of numerous alarms occurring in a short period of time. To reduce the alarm flows, this report focuses on detection of redundant alarms that could be removed. This objective is met by, first, looking for frequent adjacency in the alarm log. To identify them, the frequent pattern mining algorithm AprioriAll is adapted. Another way to find potentially redundant alarms is to look for systematic predecessors. To discover them, dominations and mutual dependencies contained in the alarm log are identified. To ease this analysis, the discovered relations are depicted in the form of Petri nets.Both those methods are then tested against an industrial alarm log made available by General Electric. The results show that both methods allow a reduction of the alarm flow, with the biggest reduction being during alarm floods.

This work is focusing on automatic verification of systems with parallel running processes. We discuss the existing methods and certain possibilities of optimizing them. Existing techniques are essentially based on finding an inductive invariant (for instance using a variant of counterexample-guided abstract refinement (CEGAR)). The effectiveness of these methods depends on the size of the invariant. In this thesis, we explored the possibility of improving the methods by focusing on finding invariants of minimal size. We implemented a tool that facilitates exploring the space of invariants of the system under scrutiny. Our experimental results show that many practical existing systems indeed have invariants that are much smaller than what can be found by the existing methods. The conjectures and the results of the work will serve as a basis of future research of an efficient method for finding small invariants of parallel systems.

This thesis deals with optimization problems of planning and scheduling. There are using genetic algorithms which are inspired by evolution process. Main work is familiar with the problem of planning and scheduling, genetic algorithm and Petri nets. This knowledge was used to create applications that would with the use of genetic algorithms was able to solve planning problems and the resulting plans would be represented the Time Petri Net. In conclusion of the this thesis are presented obtained results and examples of field use.