|
|
Human Interface to Automata Libraries of MONA Tool
Pyšný, Radek ; Šimáček, Jiří (referee) ; Rogalewicz, Adam (advisor)
Finite tree automata is formalism used in many different areas of computer science, among others in the area of formal verification. Nowdays there are few tools used for handling of finite tree automata, however libraries of MONA tool are the best choice. The finite tree automata are a frequent tool for formal verification of computer systems which work with dynamic data structures. The input format of finite tree automata for libraries of MONA tool is very difficult for humans because it is necessary to enter the move function of the finite tree automaton in a form of several multiterminal binary decision diagrams. The aim of this thesis is to design and implement tool to convert the finite set of move rules into internal format of the MONA tool.
|
|
|
AVR microcontroller-based reader of bar codes and RFID chips
Barka, Marek ; Daněček, Vít (referee) ; Šilhavý, Pavel (advisor)
This thesis dealt with concept resolution of bar-code scaning and Rfid chip, whitch their scan data are procesing with microprocesor and they are transmitted to input computer keyboard. Filing the bar-code and Rfid chip to the topical area automatic identification. A finish of the work is a realisation hardware and transmition recency data to the computer space. It work includes techniques, which it describes communication with others integrated circuit together detailed definition and test used interfaces.
|
|
|
Human Interface to Automata Libraries of MONA Tool
Pyšný, Radek ; Šimáček, Jiří (referee) ; Rogalewicz, Adam (advisor)
Finite tree automata is formalism used in many different areas of computer science, among others in the area of formal verification. Nowdays there are few tools used for handling of finite tree automata, however libraries of MONA tool are the best choice. The finite tree automata are a frequent tool for formal verification of computer systems which work with dynamic data structures. The input format of finite tree automata for libraries of MONA tool is very difficult for humans because it is necessary to enter the move function of the finite tree automaton in a form of several multiterminal binary decision diagrams. The aim of this thesis is to design and implement tool to convert the finite set of move rules into internal format of the MONA tool.
|
|
|
AVR microcontroller-based reader of bar codes and RFID chips
Barka, Marek ; Daněček, Vít (referee) ; Šilhavý, Pavel (advisor)
This thesis dealt with concept resolution of bar-code scaning and Rfid chip, whitch their scan data are procesing with microprocesor and they are transmitted to input computer keyboard. Filing the bar-code and Rfid chip to the topical area automatic identification. A finish of the work is a realisation hardware and transmition recency data to the computer space. It work includes techniques, which it describes communication with others integrated circuit together detailed definition and test used interfaces.
|
guest ::
