National Repository of Grey Literature 8 records found  Search took 0.00 seconds. 
Congruences for Tree Automata
Žufan, Petr ; Janků, Petr (referee) ; Holík, Lukáš (advisor)
This thesis discusses testing of tree automata (TA) equivalence. We propose a new algorithm based on Bonchi Pouse's algorithm of word automata. The new algortihm combines bisimulation and determinization on the fly. Using an optimalization based on congruence closure, we try to avoid extreme expansion of state space. From this point of view, the new algorithm is better than others.
A Converter between the LESS and SASS Stylesheet Formats
Večerek, Attila ; Janků, Petr (referee) ; Vojnar, Tomáš (advisor)
Cílem této bakalářské práce je výzkum rozdílů mezi CSS preprocesorovými jazyky, jmenovitě Less a Sass, a nalezení použitelných transormačních metod k implementaci překladače mezi jejich formáty. Nejprve je předložen koncept CSS preprocesorů a následuje detailní popis vlastností jazyků Less a Sass. V této práci jsou uvedené všechny zjištěné rozdíly, a pak jsou představeny nové konverzní metody s demonstrativními příklady. Následuje popis návrhu a implementace překladače. Součástí této práce je tvorba nástroje pro porovnávání CSS, který je postaven na základě transformace abstraktního syntaktického stromu. Návrh komparátoru je popsán spolu s procesem testování, jenž byl použitý pro verifikaci zavedených konverzních metod. V poslední části práce jsou shrnuty dosažené výsledky a je navržen budoucí vývoj překladače.
Path Planning of Airplane
Janků, Petr ; Rozman, Jaroslav (referee) ; Samek, Jan (advisor)
This work deals with fi nding an optimal trajectory of an aircraft, both in continuous and discretized environment. Theoretical part is devoted to the basic concepts of motion planning problems and description of selected planning methods of aircraft motion. Practical part is devoted to the implementation of selected methods and verification of optimality. Experiments con firmed that the continuous environment method requires shorter computing time; however, may not always fi nd an optimal path.
A Library for Binary Decision Diagrams
Janků, Petr ; Hrubý, Martin (referee) ; Holík, Lukáš (advisor)
Efficient manipulation of Boolean functions is an important component of many computer-aided design task. As a data structure for representing and manipulating Boolean functions, Binary Decision Diagrams are commonly used. These diagrams are commonly used in many fields such as model checking, system verification, circuit design, etc. In this thesis we describe these diagrams and there are present their modifications. Furthermore, this paper present and describes techniques for effective handling and representation of binary decision diagrams. This thesis describes the design and implementation of library that will work with these diagrams. It is further discussed how the developed library can be used within the library VATA for manipulating tree automata. Finally, the library was compared with well known and heavily optimized library CUDD, which is public and with library CacBDD. The experimental results showed that the performance of the proposed library is quite close to that of CUDD a CacBDD (has comparable and mostly even slightly better performance).

See also: similar author names
2 Janků, Petra
1 Janků, Přemysl
Interested in being notified about new results for this query?
Subscribe to the RSS feed.