Specifications for non-terminating reactive systems are described by ω-regular properties. Such properties can be translated in various types of automata, e.g. Büchi, Rabin, and Parity. A model checker can then check for language containment and determine whether the system meets the specification. Checking these automata becomes more complex when introducing probabilities and/or an adversary, e.g. the uncontrollable environment, to the automaton.
Parallel algorithms have become crucial for fully utilizing current hardware systems. With respect to model checking we therefore focus on designing scalable parallel algorithms for emptiness checking.
This research focuses on designing and improving parallel graph searching
algorithms for emptiness checking on various types of ω-automata. As a basis, we developed a scalable multi-core on-the-fly algorithm for the detection of strongly connected components (SCCs). Our aim is to contribute to the state-of-the-art techniques in parallel model checking, based on both theoretical complexity analysis and empirical studies on suitable benchmarks.
|Publisher||CEUR Workshop Proceedings|
|Conference||Formal Methods 2016 Doctoral Symposium co-located with 21st International Symposium on Formal Methods (FM 2016)|
|Abbreviated title||FM-DS 2016|
|Period||8/11/16 → 8/11/16|
|Other||8 Nov 2016|
- Model Checking