A evolução dos processos de negócio para uma visão de serviços alavancou um novo modelo computacional, o modelo orientado a serviços. Nesse modelo, os processos de negócio são modelados e implementados sob a ótica de serviços. O governo mostra-se como um domínio potencial de implantação de soluções orientadas a serviços. Embora as organizações governamentais estejam adotando o uso de serviços a fim de alcançar a interoperabilidade de sistemas de informação de governo, os serviços são geralmente criados a partir dos princípios elementares, sem considerar o reuso de soluções orientadas a serviços concebidas por outras entidades públicas. Assim, esta pesquisa tem como propósito fornecer diretrizes para auxiliar a especificação de serviços de governo eletrônico baseadas em padrões de serviços, para subsidiar o desenvolvimento de sistemas de governo, alinhados aos benefícios de computação orientada a serviços e o reuso de soluções para o governo eletrônico. Esta tese apresenta o MESe-gov, um modelo para especificação de serviços de governo eletrônico e o DESe-gov, um conjunto de diretrizes para especificação de serviços de governo eletrônico. Também é proposto um ciclo de vida de serviço para a especificação de novos serviços a partir dos padrões de serviços. A concepção de serviços, aliada ao conceito de padrões de serviços, ajuda engenheiros de software identificar elementos funcionais recorrentes e reduzir a redundância de esforços para a concepção de serviços com propósitos similares. Nesta pesquisa, foram realizados estudos de casos em que foram aplicadas as diretrizes a partir dos serviços existentes na área financeira do governo. Como resultado, os estudos de casos mostram que as diretrizes auxiliam a especificação de padrões de serviços. / The evolution of business processes for an insight on services has boosted a new computational model, the service-oriented model. The business processes in the service-oriented computational model are modelled and implemented from the perspective of services. The government appears to be a high potential scenario for the deployment of service-oriented applications. Although government organizations are adopting the use of services in order to achieve interoperability of government systems, those services are usually created from basic principles, without considering the reuse of service-oriented solutions adopted by other public entities. Thus, this research aims to provide guidelines to assist the specification of e-government services based on service patterns, to support the development of government systems, aligned with the benefits of service-oriented computing and the reuse of solutions for e-government. This thesis presents the MESe-gov, a model for the services specification of electronic government and the DESe-gov, a set of guidelines for the services specification of electronic government. A service lifecycle is also proposed for the specification of new services from service patterns. The conception of services combined with the concept of service patterns can help software engineers to identify recurrent functional elements and reduce redundant efforts in the conception of services with the same purposes. In this research, case studies were conducted in which the guidelines from existing services in the governments financial area were implemented. As a result, the case studies show that the guidelines help to specify service patterns.

Cette thèse porte sur la spécification, la vérification et la validation de systèmes critiques à l'aide de méthodes formelles, en particulier, B événementiel. Nous avons travaillé sur l'utilisation de B événementiel pour étudier des algorithmes de contrôle du platooning, à partir d'une version 1D simplifiée vers une version 2D plus réaliste. L'analyse critique du modèle du platooning en 1D a découvert certaines anomalies. La difficulté d'exprimer les théorèmes de deadlock-freeness dans B événementiel nous a motivé pour développer un outil, le générateur de théorèmes de deadlock-freeness, pour construire automatiquement ces théorèmes. Notre évaluation a confirmé que les preuves mathématiques ne sont pas suffisantes pour vérifier la correction d'une spécification formelle : une spécification formelle doit aussi être validée. Nous pensons que les activités de validation, comme les activités de vérification, doivent être associées à chaque raffinement. Pour ce faire, nous avons besoin de meilleurs outils de validation. Certains outils d'exécution existants échouent pour certains modèles non-déterministes exprimés en B événementiel. Nous avons donc conçu et implanté un nouvel outil d'exécution, JeB, un environnement de simulation en JavaScript pour B événementiel. JeB permet aux utilisateurs d'insérer du code sûr à la main pour fournir des calculs déterministes lorsque la traduction automatique échoue. Pour atteindre cet objectif, nous avons défini des obligations de preuve qui garantissent la correction de simulations par rapport au modèle formel / This thesis aims at the specification, verification and validation of safety-critical systems with formal methods, in particular, with Event-B. We assessed the usability of Event-B by the development of platooning control algorithms, specially how it scaled up from a simplified 1D version to a more realistic 2D version. The critical analysis of the 1D platooning model uncovered some anomalous behaviors. The difficulty of expressing the deadlock-freeness theorems in Event-B motivated us to develop a tool, the generator of deadlock-freeness theorems, to automatically construct these theorems. Our assessment confirmed that the mathematical proofs are not sufficient to assure the correctness of a formal specification: a formal specification should also be validated. We believe that the validation activities, like the verification activities, should be associated with each refinement during the development. To do that, we need better validation tools. The state-of-the-art tools which can execute Event-B models failed in highly non-deterministic models. Therefore we designed and implemented a new execution tool, JeB, which is a JavaScript simulation framework for Event-B. JeB allows users to safely insert hand-coded pieces of code to supply deterministic computations where the automatic translation fails. To achieve this goal, we have defined a set of proof-obligations which, when discharged, guarantee the correctness of the simulations with respect to the model.

This thesis covers the development of a component specification for the steering system of vehicles engineered by CEVT. This includes the components steering column, intermediate shaft, steering gear and tie rods. Due to the reuse of requirements on the component specification from previous projects it now lacks connection to customer needs. A verification of the component specification is necessary to ensure that no redundant or unnecessary requirements are present. The verification was performed through a comparison between a newly established specification and the current one. Identified customer needs were gathered on complete vehicle level and classified according to customer satisfaction with respect to implementation according to the Kano model. The subjective customer needs were translated into objective, quantifiable metrics on complete vehicle level that was then decomposed onto component level. Customer needs and metrics were then correlated against each other and visualized through the House of Quality matrix. Numeric targets for the metrics were based on its impact on customer satisfaction. This resulted in 50 identified metrics connected to the steering column and 58 metrics connected to the steering gear. The comparison resulted in 22 deviations between the new and current specification where 8 metrics was identified for further investigation. Further development would include investigation of these 8 identified metrics and relate targets to competitors’ performance.

[pt] Neste trabalho propomos uma arquitetura para a verificação formal de protocolos e algoritmos distribuídos. Esta pode ser vista como uma camada mais abstrata sobre o processo tradicional de verificação formal, onde temos a especificação e propriedade a serem verificadas, o verificador e o resultado retornado por este. O objetivo é simplificar o processo de especificação e verificação formal de protocolos e algoritmos distribuídos através de um ambiente mais dedicado. A parte principal desta arquitetura é a linguagem de especificação LEP, que contém construções de domínio-especifíco para simplificar a especificação destes sistemas. Outra característica desta linguagem é separar as especificações da topologia e do protocolo propriamente dito. Acreditamos que esta separação é válida pois torna mais clara a intenção das partes e ainda permite, por exemplo, o reuso de uma topologia entre diferentes especificações de protocolos. Assim, visamos oferecer uma linguagem cujos exemplos de especificações devem se assemelhar às descrições de algoritmos encontradas nos livros didáticos. Além disso, de forma a se ter a entrada e a saída dos verificadores formais de forma a obter a saída no nível de abstração de LEP. / [en] In this work we propose an architecture for the formal verification of protocols and distribued algoritms. This can be see as a more abstract layer over the ordinary process of formal verification, where we have just the specification of the protocol and properties to be verified, and the formal tool. Our goal is to simplifu the specification and formal verification of protocols and distributed algorithms through a dedicated environment. The core of the architecture is its input specification language (Lep), which provides domain-specific constructions for simplifying the specification of those systems. With LEP the specification of the protocol and the specification of the topology to be referred to protocol are given separetely. We feel that this division improves the legibility of both and allows the reuse of the specification of a topology among distinct protocols. Using this approach we try to offer a language whose specifications should be similar to the descriptions of the algorithms found on the didactic books. Moreover, in order to have the input and output of the architecture compatible, we also propose a way of processing the result of the formal verification tool. Then we could have the result on the abstract level of LEP.

One of the difficulties of Component Based Software Engineering (CBSE) [1] in reusing pre-existing components is the need to adapt these components to work within the desired target systems [2, 3, 4, 5, 6]. Third-party or in-house Commercial Off-the-shelf (COTS) components may not always have the required exact functionality demanded by the builders of the target system, so these systems have to be either modified [2, 3, 4, 5, 6] or adapted to provide this required functionality. Modifying these components may not be always practically possible. In this thesis, we propose an infrastructure that supports the active interface adaptation technique [3, 8, 9, 10]. This infrastructure directly addresses the problem of effectively packaging components for third-party use, adaptation, and deployment. Doing so we support both component designers and third party application builders. Further we evaluate our approach using several adaptations over the case studies.

Bakgrunden till rapporten var att det företag som medverkat i studien ville utveckla ett grundmönster för damkappor. Syftet med arbetet blev därför att utarbeta ett grundmönster med två ärmtyper som graderas mellan storlek 32-50, samt konstruera en kappmodell från samma grund. Utöver detta skulle även detaljkonstruktioner och specifikationer utformas. Frågeställningarna som styrde arbetet kretsade därför kring hur man på bästa sätt tar fram detta.All konstruktion utfördes i Lectra´s Modaris. För att ta fram grundmönstret jämfördes två arbetssätt för att sedan välja en av de grunder som konstruerats. Efter detta gjordes nödvändiga ändringar utifrån avprovningar. Kappmodellen utarbetades genom kompletterande detaljkonstruktioner utifrån grundmönstret. Även de fristående detaljkonstruktionerna utformades på samma sätt. Specifikationerna togs fram i företagets PDM-system Quest PDM.Passformen hos grundmönstret blev god, ett mindre balansfel kan dock finnas kvar. Kappmodellen som syddes upp av produktionskontoret i Litauen motsvarade kraven. Ståkragen bland detaljkonstruktionerna kunde förbättrats, annars uppfyller även dessa konstruktioner kraven.Specifikationerna från Quest PDM visade krav och instruktioner tydligt. Dock var det problematiskt att använda flera olika ritprogram inom systemet.The background for this report was that the company cooperating with me wanted to develop a basic pattern for women´s coats. The purpose of this study was to construct a basic pattern with two types of sleeves to be graded in the sizes 32-50 and use the basic pattern to create a women´s coat. Beside this, coat details and product specifications should be produced.Lectra´s CAD-program Modaris is used for pattern construction. To create the basic pattern two different construction methods was used, and one of them chosen for further developing. The coat was developed from the basic pattern through additional constructions. The separate detail construktions was created be the same method. The companys PDM system Quest PDM was used to form the product specifications.The fit of the basic pattern was good, a minor balance fault might still remain. The coat sewn by the companys production office in Lithuenia met the requirements. The standing straight collar could be further improved, the other detail constructions lived up to the standars.The product specifications from Quest PDM showed the instructions and demands clearly. Unfortunately there was a problem using different illustration software within the system. / Program: Designteknikerutbildningen

Varicose veins is a condition, which affects numerous people. The condition is mostly not harmful but aesthetically unappreciated. Therefore many people choose to have them surgically removed. After the surgery is completed, the leg is bandaged, this for creating an ideal healing environment, without any complications occurring. It is important that a uniform pressure is distributed evenly along the bandaged leg, because high or low pressure can cause complications which prolongs healing. During the bandaging it is difficult to achieve an even pressure since the pressure varies due to the shape of the leg and who is bandaging the leg. PressCise has developed a compression bandage with a guide along the bandage, so that each bandaging will give the same pressure upon the leg. The bandage is designed after a specific mathematical formula that is derived from the law of Laplace. This means that no matter how thick or thin the leg is at different points, the pressure will distribute itself evenly over the entire bandaged leg. PressCise aims to obtain a CE-mark for the product before a launch. An analysis of demands and a wide test study therefor needs to be carried out. Demands and requirements for the product from different laws and regulations have been observed in order to determine which tests are necessary to execute. At this stage PressCise also needs to evaluate different parameters. To begin with, they need to see how the bandage behaves in different types of treatments, and secondly they need to evaluate the properties in order to give the correct information concerning usage and durability advices. In this report, a survey of the competitors was conducted in order to estimate which standards and tests the competitors are marketing their products with. An examination of the requirements of the product from the PressCise, CE marking and laws will be study, to see which demands and regulations lies upon the bandage. In this report a minor test study will be executed, where the product will go through a washing test, an abrasion test and a hysteresis test. The report will conclude with a requirement specification for the current product and its launching. / Program: Textilingenjörsutbildningen

Gramática de grafos é uma linguagem formal bastante adequada para sistemas cujos estados possuem uma topologia complexa (que envolvem vários tipos de elementos e diferentes tipos de relações entre eles) e cujo comportamento é essencialmente orientado pelos dados, isto é, eventos são disparados por configurações particulares do estado. Vários sistemas reativos são exemplos desta classe de aplicações, como protocolos para sistemas distribuídos e móveis, simulação de sistemas biológicos, entre outros. A verificação de gramática de grafos através da técnica de verificação de modelos já é utilizada por diversas abordagens. Embora esta técnica constitua um método de análise bastante importante, ela tem como desvantagem a necessidade de construir o espaço de estados completo do sistema, o que pode levar ao problema da explosão de estados. Bastante progresso tem sido feito para lidar com esta dificuldade, e diversas técnicas têm aumentado o tamanho dos sistemas que podem ser verificados. Outras abordagens propõem aproximar o espaço de estados, mas neste caso não é possível a verificação de propriedades arbitrárias. Além da verificação de modelos, a prova de teoremas constitui outra técnica consolidada para verificação formal. Nesta técnica tanto o sistema quanto suas propriedades são expressas em alguma lógica matemática. O processo de prova consiste em encontrar uma prova a partir dos axiomas e lemas intermediários do sistema. Cada técnica tem argumentos pró e contra o seu uso, mas é possível dizer que a verificação de modelos e a prova de teoremas são complementares. A maioria das abordagens utilizam verificadores de modelos para analisar propriedades de computações, isto é, sobre a seqüência de passos de um sistema. Propriedades sobre estados alcançáveis só são verificadas de forma restrita. O objetivo deste trabalho é prover uma abordagem para a prova de propriedades de grafos alcançáveis de uma gramática de grafos através da técnica de prova de teoremas. Propõe-se uma tradução (da abordagem Single-Pushout) de gramática de grafos para uma abordagem lógica e relacional, a qual permite a aplicação de indução matemática para análise de sistemas com espaço de estados infinito. Definiu-se gramática de grafos utilizando estruturas relacionais e aplicações de regras com linguagens lógicas. Inicialmente considerou-se o caso de grafos (tipados) simples, e então se estendeu a abordagem para grafos com atributos e gramáticas com condições negativas de aplicação. Além disso, baseado nesta abordagem, foram estabelecidos padrões para a definição, codificação e reuso de especificações de propriedades. O sistema de padrões tem o objetivo de auxiliar e simplificar a tarefa de especificar requisitos de forma precisa. Finalmente, propõe-se implementar definições relacionais de gramática de grafos em estruturas de event-B, de forma que seja possível utilizar os provadores disponíveis para event-B para demonstrar propriedades de gramática de grafos. / Graph grammars are a formal language well-suited to applications in which states have a complex topology (involving not only many types of elements, but also different types of relations between them) and in which behaviour is essentially data-driven, that is, events are triggered basically by particular configurations of the state. Many reactive systems are examples of this class of applications, such as protocols for distributed and mobile systems, simulation of biological systems, and many others. The verification of graph grammar models through model-checking is currently supported by various approaches. Although model-checking is an important analysis method, it has as disadvantage the need to build the complete state space, which can lead to the state explosion problem. Much progress has been made to deal with this difficulty, and many techniques have increased the size of the systems that may be verified. Other approaches propose to over- and/or under-approximate the state-space, but in this case it is not possible to check arbitrary properties. Besides model checking, theorem proving is another wellestablished approach for verification. Theorem proving is a technique where both the system and its desired properties are expressed as formulas in some mathematical logic. A logical description defines the system, establishing a set of axioms and inference rules. The process of verification consists of finding a proof of the required property from the axioms or intermediary lemmas of the system. Each verification technique has arguments for and against its use, but we can say that model-checking and theorem proving are complementary. Most of the existing approaches use model checkers to analyse properties of computations, that is, properties over the sequences of steps a system may engage in. Properties about reachable states are handled, if at all possible, only in very restricted ways. In this work, our main aim is to provide a means to prove properties of reachable graphs of graph grammar models using the theorem proving technique. We propose an encoding of (the Single-Pushout approach of) graph grammar specifications into a relational and logical approach which allows the application of the mathematical induction technique to analyse systems with infinite state-spaces. We have defined graph grammars using relational structures and used logical languages to model rule applications. We first consider the case of simple (typed) graphs, and then we extend the approach to the non-trivial case of attributed-graphs and grammars with negative application conditions. Besides that, based on this relational encoding, we establish patterns for the presentation, codification and reuse of property specifications. The pattern has the goal of helping and simplifying the task of stating precise requirements to be verified. Finally, we propose to implement relational definitions of graph grammars in event-B structures, such that it is possible to use the event-B provers to demonstrate properties of a graph grammar.

This thesis focuses on analysis of jobs in private company MAVEL a.s. Objective of this thesis is to update current jobs descriptions, which are supplemented by specification, and to create the missing description of the selected jobs. The first part of the work is theoretical base, which is elaborated by the literature and relevant web sources. The practical part discribes the company and basic characteristics of the respondents, who were all workers of studied jobs. Next part is analysis of work, which was carried out by questionnaires. The analysis result is to create jobs descriptions, whose final version is fleshed out by interview with senior staff. Updated descriptions should facilitace the selection procedure to the given positions. At the end of the work are introduced some recommendations which should lead to more effictive HR activities in the investigate company.

Many contemporary computer games can be described as dynamic real-time simulations inhabited by autonomous intelligent virtual agents (IVAs) where most of the environment structure is immutable and navigating through the environment is one of the most common activities. Though controlling the behaviour of such agents seems perfectly suited for action planning techniques, planning is not widely adopted in existing games. This paper attempts to answer the question whether the current academic planning technology is ready for integration to existing games and under which conditions. The paper compares reactive techniques to classical planning in handling the action selection problem for IVAs in game-like environments. Several existing classical planners that occupied top positions in the International Planning Competition were connected to the virtual environment of Unreal Development Kit via the Pogamut platform. Performance of IVAs employing those planners and IVAs with reactive architecture was measured on a class of game like test environments under different levels of external interference. It was shown that agents employing classical planning outperform reactive agents only if the size of the planning problem is small or if the environment changes are either hostile to the agent or not very frequent.