Home // PESARO 2011, The First International Conference on Performance, Safety and Robustness in Complex Systems and Applications // View article

Verifying Distributed Algorithms with Executable Creol Models

Authors:
Wolfgang Leister
Joakim Bjørk
Rudolf Schlatte
Andreas Griesmayer

Keywords: formal analysis; modelling; model checking; testing; routing algorithms

Abstract:
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.

Pages: 1 to 6

Copyright: Copyright (c) IARIA, 2011

Publication date: April 17, 2011

Published in: conference

ISSN: 2308-3700

ISBN: 978-1-61208-132-8

Location: Budapest, Hungary

Dates: from April 17, 2011 to April 22, 2011