Parallel Model Checking of ω-Automata.
In: Proceedings of the Formal Methods 2016 Doctoral Symposium co-located with 21st International Symposium on Formal Methods (FM 2016), 8 Nov 2016, Limassol, Cyprus.
CEUR Workshop Proceedings.
Full text available as:
Official URL: http://ceur-ws.org/Vol-1744/paper1.pdf
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.
|Item Type:||Conference or Workshop Paper (Extended Abstract, Talk)|
|Research Group:||EWI-FMT: Formal Methods and Tools|
|Research Project:||3TU.BSR: Big Software on the Run|
|Uncontrolled Keywords:||model checking, parallel, multi-core, LTL, Büchi, Rabin, Parity|
|Deposited On:||12 January 2017|
Export this item as:
To correct this item please ask your editor
Repository Staff Only: edit this item