|
|
Modelling and Analysis of Campus Network at the BUT
Kojecký, Vladimír ; Veselý, Vladimír (referee) ; Grégr, Matěj (advisor)
This thesis deals with the design and implementation of tools for creating a computer network simulation model. Network analysis is based on configuration files from connected network devices. According to the requirements of the simulation it is necessary in the configuration file to focus on data relating to the monitored elements and their properties, or which may be of some influence. The output is then passed on simulation environment to form the desired network model by the observed data, which is already possible to perform simulations.
|
|
|
Automated Methods of Finding Bugs in Compilers
Müller, Petr ; Smrčka, Aleš (referee) ; Vojnar, Tomáš (advisor)
This thesis discusses an application of the fuzz testing method for testing compilers and interpreters. In the first part, it deals with compilers, optimizations, and bugs typical for an optimizing compiler. It analyzes applicability of static and dynamic analysis methods for searching such bugs and proposes dynamic fuzz testing as suitable for this task. A compiler testing tool suite using this method was implemented within this thesis and applied on several real compilers, including GCC, in which the tool revealed a series of bugs.
|
|
|
Generating 3D Trees Based on Real Images
Kubiš, František ; Polok, Lukáš (referee) ; Szentandrási, István (advisor)
Master's thesis studies the possibilities of generating 3D trees using variety of methods including context-free grammars and L-systems. Master's thesis also includes chapter on evolutionary and genetic algorithms, which briefly summarize their function. In this project genetic algorithm which takes 2D image of tree and the beginning of its trunk is proposed. Based on this information it will generate 3D tree which is visually close to the original image. In addition to methods of generating trees, reader will get information about processing input image and designing test application.
|
|
|
Parallel Deep Pushdown Automata
Solár, Peter ; Křivka, Zbyněk (referee) ; Meduna, Alexandr (advisor)
This thesis introduces parallel deep pushdown automata as the parallel version of the deep pushdown automata. They are based on the rules, where the automaton can expand n topmost non-terminals in only one derivation step if there are enough non-terminals on the pushdown. The main advantage rests in a fact, that parallel automaton can makde a decission faster.
|
|
|
New Parallel and Regulated Automata and Grammars
Kučera, Jiří ; Průša, Daniel (referee) ; Sawa, Zdeněk (referee) ; Meduna, Alexandr (advisor)
Tato práce zkoumá a zavádí čtyři nové jazykové modely se zaměřením na regulované a paralelní verze automatů a gramatik. První z modelů, stavově synchronizované systémy automatů , zavádí systémy složené z konečného počtu zásobníkových automatů jejichž činnost je řízena slovy z řídícího jazyka nad množinou stavů. Druhý model, neomezené hluboké zásobníkové automaty , je variantou hlubokých zásobníkových automatů z nichž bylo sejmuto omezení kladené na hloubku expanze na zásobníku. Třetí model, skákající čisté gramatiky , zavádí skákající gramatiky bez neterminálních symbolů. Poslední model, k#$-přepisující systémy , rozšiřuje #-přepisující systémy o přídavnou zásobníkovou paměť. Text této práce je členěn do tří částí. První část uvádí motivaci k zavedení studovaných jazykových modelů a zasazuje je do kontextu souvisejících oblastí teorie formálních jazyků. Je zde také uveden přehled o celkové organizaci práce, základních pojmů teorie formálních jazyků a současných poznatků souvisejících s předmětem výzkumu. Druhá část tvoří jádro této práce. Jsou v ní formálně definovány všechny nově zavedené jazykové modely a studována jejich vyjadřovací síla. Poslední část uzavírá tuto práci souhrnem získaných teoretických výsledků společně se souvisejícími otevřenými problémy a nastiňuje cesty dalšího výzkumu spolu s výhledy na možná využití.
|
|
|
Formal description of board games
Nowak, Stanislav ; Štěpánek, Petr (advisor) ; Kunčar, Ondřej (referee)
The aim of thesis was to design a mathematical formalism that allows describing and exploring the properties of board games. The work benefits from the findings of automata theory and logic programming. First part of thesis deals with finite automata and their possible applications for the needs of board games. The result is an extension of finite-state automaton covering the specifics of board games called game automaton. Board games are a complex domain hight level tools should be used. Such a tools is a logical programming. Using logic programming was designed instrument that allows declarative descriptions of games, named gaming system. This declarative description is used as an framework for the implementation of interactive games. Linking the two worlds will be demonstrated by conversion of the gaming system to the game automaton.
|
|
|
General Grammars: Normal Forms with Applications
Klobučníková, Dominika ; Krčmář, Radim (referee) ; Meduna, Alexandr (advisor)
This thesis deals with the topic of unrestricted grammars, normal forms, and their applications. It focuses on context-sensitive grammars as their special cases. Based on the analysis of the set, an algorithm was designed using the principles of the Cocke-Younger-Kasami algorithm to make a decision of whether an input string is a sentence of a context-sensitivegrammar. The final application, which implements this algorithm, works with context-sensitive grammars in the Penttonen normal form.
|
|
|
Generic Realtime Strategies
Baláž, Tibor ; Dvořák, Filip (advisor) ; Černý, Martin (referee)
Strategy games are a field of digital entertainment that has always attracted large audiences of players and researchers - be it for modeling military strategy, economical principles or automated decision making and artificial intelligence. The thesis is focused on developing an environment that allows to efficiently prototype strategic games with a high level of abstraction. The theoretical part of the thesis defines what is a strategy game, gives introduction into the game engines and describes a new language used for defining the games. The practical part describes how is the language interpreted into the game engine and how the execution of the game proceeds. Powered by TCPDF (www.tcpdf.org)
|
|
|
Generic Realtime Strategies
Baláž, Tibor ; Dvořák, Filip (advisor) ; Černý, Martin (referee)
Strategy games are a field of digital entertainment that has always attracted large audiences of players and researchers - be it for modeling military strategy, economical principles or automated decision making and artificial intelligence. The thesis is focused on developing an environment that allows to efficiently prototype strategic games with a high level of abstraction. The theoretical part of the thesis defines what is a strategy game, gives introduction into the game engines and describes a new language used for defining the games. The practical part describes how is the language interpreted into the game engine and how the execution of the game proceeds. Powered by TCPDF (www.tcpdf.org)
|
|
|
Formal description of board games
Nowak, Stanislav ; Štěpánek, Petr (advisor) ; Kunčar, Ondřej (referee)
The aim of thesis was to design a mathematical formalism that allows describing and exploring the properties of board games. The work benefits from the findings of automata theory and logic programming. First part of thesis deals with finite automata and their possible applications for the needs of board games. The result is an extension of finite-state automaton covering the specifics of board games called game automaton. Board games are a complex domain hight level tools should be used. Such a tools is a logical programming. Using logic programming was designed instrument that allows declarative descriptions of games, named gaming system. This declarative description is used as an framework for the implementation of interactive games. Linking the two worlds will be demonstrated by conversion of the gaming system to the game automaton.
|
guest ::
