|
|
Schedulability Analysis of Real-Time Tasks under Uncertainty
Čus, Samuel ; Šimek, Václav (referee) ; Strnadel, Josef (advisor)
The goal of this bachelor’s thesis is to familiarize with real-time systems, uncertainties and scheduling mechanisms related to these systems, statistical model checking, as well as the design and implementation of an approach to schedulability analysis under uncertainties, creating suitable sets of real-time tasks, and verifying their schedulability using the approach. I have mainly incorporated uncertainties caused by system interruptions and undeterministic task parameters. To address the given problem, I created a set of tasks, incorporated uncertainties into the system, and analyzed the schedulability of the tasks. The system modeling and analysis were conducted using the UPPAAL SMC tool, and, for comparison, also using the Cheddar tool with selected sets of tasks.
|
|
|
Search of Control Strategies Using UPPAAL STRATEGO
Hruška, Filip ; Hrubý, Martin (referee) ; Strnadel, Josef (advisor)
This thesis deals with finding control strategies for pre-selected problems from various areas using tool Uppaal Stratego. Four areas were selected, namely chess, a sliding puzzle, the tower of Hanoi, and a kinematic problem involving a package, a car, and an airplane. For the selected areas and problems, a set of models was designed and implemented. For the tower of Hanoi and the sliding field, it was possible to successfully evaluate relevant strategies, raising the probabilities of success to more than 90 %. For other models, a problem was found in the size of the state space and the strategies could not be evaluated because the maximum memory capacity that the tool uses was not sufficient. For the kinematic problem, after limiting and simplifying the model, the strategies were successfully evaluated, but for chess, this was not possible even after significant simplification.
|
|
|
Proof Systems: A Study on Form and Complexity
Jalali Keshavarz, Raheleh ; Pudlák, Pavel (advisor) ; Metcalfe, George (referee) ; Ramanayake, Revantha (referee)
Proof Systems: A Study on Form and Complexity This dissertation includes three parts. The first two parts are related to each other. In [2] and [1], Iemhoff introduced a connection between the existence of a terminating sequent calculus of a certain kind and the uniform inter- polation property of the super-intuitionistic logic that the calculus captures. In the second part, we will generalize this relationship to also cover the sub- structural setting on the one hand and a more powerful type of systems called semi-analytic calculi, on the other. To be more precise, we will show that any sufficiently strong substructural logic with a semi-analytic calculus has Craig interpolation property and in case that the calculus is also terminating, it has uniform interpolation. This relationship then leads to some concrete applications. On the positive side, it provides a uniform method to prove the uniform interpolation property for the logics FLe, FLew, CFLe, CFLew, IPC, CPC and some of their K and KD-type modal extensions. However, on the negative side the relationship finds its more interesting application to show that many sub-structural logics including Ln, Gn, BL, R and RMe , al- most all super-intutionistic logics (except at most seven of them) and almost all extensions of S4 (except thirty seven of them) do not...
|
|
|
Search of Control Strategies Using UPPAAL STRATEGO
Hruška, Filip ; Hrubý, Martin (referee) ; Strnadel, Josef (advisor)
This thesis deals with finding control strategies for pre-selected problems from various areas using tool Uppaal Stratego. Four areas were selected, namely chess, a sliding puzzle, the tower of Hanoi, and a kinematic problem involving a package, a car, and an airplane. For the selected areas and problems, a set of models was designed and implemented. For the tower of Hanoi and the sliding field, it was possible to successfully evaluate relevant strategies, raising the probabilities of success to more than 90 %. For other models, a problem was found in the size of the state space and the strategies could not be evaluated because the maximum memory capacity that the tool uses was not sufficient. For the kinematic problem, after limiting and simplifying the model, the strategies were successfully evaluated, but for chess, this was not possible even after significant simplification.
|
|
|
David Kellogg Lewis' possible worlds
ŠTORKÁNOVÁ, Radka
This bachelor thesis deals with philosophical theory of possible worlds which are on the border between logic and metaphysics. The aim of the thesis is to introduce and critically evaluate modal realism of the American philosopher David Kellog Lewis. At first the thesis defines what the possible worlds are and what their use is. In this case basis can be already found in pre-philosophical intuition regarding possibility. The next section focuses on the central points of Lewis' understanding of possible worlds. His greatly original concept, including the fact that other possible worlds exist as well as ours, naturally brings many difficulties. The nature of these problems is discussed in the last section.
|
|
| |
|
|
The use of logic in IT security
Švarný, Petr ; Řepa, Václav (advisor) ; Mařík, Vladimír (referee)
This thesis studies the use of dynamic epistemic logics for the sake of information privacy. The core of the work is the synthesis of three approaches: security logics from A. Hommersom, plausibility frames and communication logic from A. Baltag and S. Smets, and studies concerning the so called Russian cards protocol. Thereafter we present a program, made in the NetLogo environment, in order to demonstrate the workings of the basic ideas.
|
guest ::
