National Repository of Grey Literature 2 records found  Search took 0.01 seconds. 
Petri nets in Netlab Tool
Šajdík, Ondrej ; Smrčka, Aleš (referee) ; Rogalewicz, Adam (advisor)
The aim of this work is to support the continuation of the Netlab tool's development and to simplify its extension. Netlab is a desktop application that allows for the modeling of systems in the form of Petri nets using a graphical editor, and subsequently performs model checking analyses on the created model. Within the scope of this work, the concepts of model checking, Petri nets, and available analyses within the application were examined. The application had not been developed for an extended period, resulting in significant obstacles for further improvements. These issues are addressed and resolved throughout the course of this work. Another goal is to enable users of the application to execute a reverse analysis algorithm on the created model, which has been implemented, thereby demonstrating extensibility and potential for future development.
Resolution-based methods for linear temporal reasoning
Suda, Martin ; Barták, Roman (advisor) ; Hoffmann, Jörg (referee) ; Biere, Armin (referee)
The aim of this thesis is to explore the potential of resolution-based methods for linear temporal reasoning. On the abstract level, this means to develop new algorithms for automated reasoning about properties of systems which evolve in time. More concretely, we will: 1) show how to adapt the superposition framework to proving theorems in propositional Linear Temporal Logic (LTL), 2) use a connection between superposition and the CDCL calculus of modern SAT solvers to come up with an efficient LTL prover, 3) specialize the previous to reachability properties and discover a close connection to Property Directed Reachability (PDR), an algorithm recently developed for model checking of hardware circuits, 4) further improve PDR by providing a new technique for enhancing clause propagation phase of the algorithm, and 5) adapt PDR to automated planning by replacing the SAT solver inside with a planning-specific procedure. We implemented the proposed ideas and provide experimental results which demonstrate their practical potential on representative benchmark sets. Our system LS4 is shown to be the strongest LTL prover currently publicly available. The mentioned enhancement of PDR substantially improves the performance of our implementation of the algorithm for hardware model checking in the multi-property...

Interested in being notified about new results for this query?
Subscribe to the RSS feed.