This diploma thesis is divided into two main parts. The first section is dedicated to the history and development of the laser technology. The second part describes all individual types of laser technology which are used in the industry nowadays. The next section follows with the research of various laser devices which serve mainly as a cutting tool. This knowledge gathered in the previous part was used to create the next part including the own conception of the machine. The second half of this diploma thesis deals with a research of software available at the market today. Eventually, after summarizing the characteristics of each software, the new concept and implementation of own software are made. In the final section, there are mentioned the possible extension and available upgrades. The reader should be able to create his/her own conception of the laser device and software after reading and understanding this paper.

The subject of this master thesis are state machines and their testing. To this purpose, an application is described, which is able to test these state machines autonomously. Application have two parts, first generator and editor of data is built and second part is testing procedure, which is able to test state machines in question and to give corresponding test report.

This thesis describes the design and implementation of control applications for the deposition interface and mass spectrometer. The paper describes the working principle of these devices and their hardware specifications. It also describes how the design and the conception of the application. Developed applications are tested on real devices at the end.

This thesis focuses on problem-solution analysis of synchronous digital circuits; the results of which are autosynchronous circuit design methodology, timing parameter definitions based on simulation models and constraint settings. The RTL transformation of the synchronous state machine in VHDL language to an autosynchronous state machine was created with minimal modifications for the simple design of these circuits. Following this, a comparison of the transformed state machines with their synchronous originals in parameters such as chip area, current consumption and timing specification domain is introduced. The summation of this thesis displays a theoretical comparison of several types of synchronization (synchronous, autosynchronous, fundamental asynchronous, EAIC, Bundled-data, Dual-rail) which are presented on the single state machine example with the same technology parameters.

No description available.

No description available.

No description available.

No description available.

Arbetet undersöker skillnader i prestanda mellan SOLID och mer hårdkodade algoritmer, i form av respektive beteendeträd och en enum-switch tillståndsmaskin. Testerna utförs i spelmotorn Unity genom en isolerad testmiljö där exekveringstiden mäts mellan i scenarion. Algoritmerna har implementerats så att de kan köra olika beteenden, dessa testas i olika scenarion för att få fram resultaten. Exekveringstid mäts genom profiler-verktyget i Unity som sedan analyseras och jämförs för att se hur mycket tid det tar att exekvera och om det finns skillnader mellan dem. Resultaten tyder på att den hårdkodade algoritmen presterade bättre än den som följde SOLID-principer, dock inte så markant att det utesluter användningen av den mer flexibla koden.

Nous proposons dans cette thèse les approches de test pour la composition de services web. Nous nous intéressons aux test unitaire et d’intégration d’une orchestration de services web. L’aspect de vérification d’exécution en-ligne est aussi consideré. Nous définissons une plateforme de test unitaire pour l’orchestration de services web qui compose une architecture de test, une relation de conformité et deux approches de test basés sur le modèle de machine à l’états finis étendues temporisés: l’approche offline où les activités de test comme la génération de cas de test temporisé, l’exécution de test et l’assignement de verdict sont appliquées en séquentielle tandis que ces activités sont appliquées en parallèle dans l’approche online. Pour le test d’intégration d’une orchestration, nous combinons deux approches: active et passive.Au debut, l’approche active est utilisée pour activer une nouvelle session d’orchestration par l’envoi d’un message de requête SOAP. Après, tous les messages d’entré et de sortie de l’orchestration sont collectés et analysés par l’approche passive.Pour l’aspect de vérification d’exécution en-ligne, nous nous intéressons à la vérification d’une trace qui respecte un ensemble des constraintes, noté règles, ou pas. Nous avons proposé extendre le langage Nomad en définissant des constraintes sur chaque action atomique et un ensemble de corrélation de données entre les actions pour définir des règles pour le service web. Ce langage nous permet de définir des règles avec le temps futur et passé, et d’utiliser des opérations NOT, AND, OR pour combiner quelque conditions dans le contexte de la règle. Ensuite, nous proposons un algorithme pour vérifier l’exactitude d’une séquence des messages en parallèle avec le moteur de collecte de trace. / In this thesis, we propose the testing approaches for web service composition. We focus on unit, integrated testing of an orchestration of web services and also the runtime verification aspect. We defined an unit testing framework for an orchestration that is composed of a test architecture, a conformance relation and two proposed testing approaches based on Timed Extended Finite State Machine (TEFSM) model: offline which test activities as timed test case generation, test execution and verdict assignment are applied in sequential, and online which test activities are applied in parallel. For integrated testing of an orchestration, we combines of two approaches: active and passive. Firstly, active approach is used to start a new session of the orchestration by sending a SOAP request. Then all communicating messages among services are collected and analyzed by a passive approach. On the runtime verification aspect, we are interested in the correctness of an execution trace with a set of defined constraints, called rules. We have proposed to extend the Nomad language, by defining the constraints on each atomic action (fixed conditions) and a set of data correlations between the actions to define the rules for web services. This language allows us to define a rule with future and past time, and to use the operations: NOT, AND, OR to combines some conditions into a context of the rule. Afterwards, we proposed an algorithm to check correctness of a message sequence in parallel with the trace collection engine. Specifically, this algorithm verifies message by message without storing them.