Verifying Distributed Algorithms with Executable Creol Models

We show a way to evaluate functional properties of distributed algorithms by the example of the AODV algorithm in sensor networks, Creol models and component testing. We present a new method to structure the evaluation work into the categories of techniques, perspectives, arrangements, and properties using executable models. We demonstrate how to use this structure for network simulations and component testing in order to evaluate a large list of properties. We also show which properties are most suited to be evaluated by which technique, perspective, and arrangement.