Verification of behaviour networks using finite-state automata

Authors:
Christopher Armbrust;Lisa Kiekbusch;Thorsten Ropertz;Karsten Berns
Affiliations:
Robotics Research Lab, Department of Computer Science, University of Kaiserslautern, Kaiserslautern, Germany;Robotics Research Lab, Department of Computer Science, University of Kaiserslautern, Kaiserslautern, Germany;Robotics Research Lab, Department of Computer Science, University of Kaiserslautern, Kaiserslautern, Germany;Robotics Research Lab, Department of Computer Science, University of Kaiserslautern, Kaiserslautern, Germany
Venue:
KI'12 Proceedings of the 35th Annual German conference on Advances in Artificial Intelligence
Year:
2012

Citing 4
Cited 0

A theory of timed automata

Theoretical Computer Science
Model checking

Model checking
An Behavior-based Robotics

An Behavior-based Robotics
Verification and Validation of AI Systems that Control Deep-Space Spacecraft

ISMIS '97 Proceedings of the 10th International Symposium on Foundations of Intelligent Systems

Quantified Score

Hi-index	0.00

Visualization

Abstract

This paper addresses the problem of verifying properties of behaviour-based systems used for controlling robots. A behaviour-based system typically consists of many interconnected components, the behaviours, which in combination realise the system's overall functionality. The connections between the behaviours are crucial for the correct operation of a system. Therefore, key properties of behaviour-based systems are verifiable based on their behaviour interconnections. In this paper, it is described how behaviour-based networks can be (automatically) modelled using finite-state machines and how model checking with the Uppaal toolbox can then be applied for verification and analysis tasks.