Abeona: A generalized framework for state space exploration algorithm composition
Bram Kamies · 2020
This thesis proposes a novel design for implementing state space exploration (SSE) algorithms through composition of components. The concept of this framework is to offer a generalisation for users of SSE algorithms to implement their solution with. This satisfies users who need to tweak and configure their solution and would otherwise have to resort to modifying the original implementation source code. In this thesis a design for the framework is specified that supports the compositional approach. Following an analysis of existing state space exploration algorithms, a skeleton pipeline is derived for the execution of SSE algorithms and a set of components necessary to implement SSE algorithms. The validation is done firstly by integrating the solution into two existing solutions for SSE based exploration. Second, a performance comparison is made to measure the overhead the framework has over the existing solutions. Thirdly, various demo applications are developed to showcase the state-agnostic property of the framework. This shows that the framework is widely applicable to any preexisting representation of states the user may have. Finally, a user study is performed to obtain insight into the user-friendliness of the framework to new users.