A master thesis from Aalborg University
On-The-Fly Model Checking of Weighted Computation Tree Logic
Author(s)
Term
4. term
Education
Publication year
2013
Submitted on
2013-06-07
Pages
72 pages
Abstract
We present min-max graphs; a technique to encode the model checking problem of weighted Computation Tree Logic (CTL), with nonnegative constraints on the modalities, against weighted Kripke structures. We outline previous efforts to encode this problem using dependency graphs and their symbolic extension. We demonstrate how to model check weighted CTL through fixed-point computation on a graph that encodes the problem, using global and local/on-the-fly fixed-point algorithms. Moreover, we have implemented the algorithms and evaluated their performance through experiments. In turn, we conclude that the local approach is often very advantageous.
Keywords
wctl ; model checking ; ctl ; on-the-fly ; local
Documents
Colophon: This page is part of the AAU Student Projects portal, which is run by Aalborg University. Here, you can find and download publicly available bachelor's theses and master's projects from across the university dating from 2008 onwards. Student projects from before 2008 are available in printed form at Aalborg University Library.
If you have any questions about AAU Student Projects or the research registration, dissemination and analysis at Aalborg University, please feel free to contact the VBN team. You can also find more information in the AAU Student Projects FAQs.