Probabilistic Timed Behavior Trees

12 years 9 months ago
Probabilistic Timed Behavior Trees
The Behavior Tree notation has been developed as a method for systematically and traceably capturing user requirements. In this paper we extend the notation with probabilistic behaviour, so that reliability, performance, and other dependability properties can be expressed. The semantics of probabilistic timed Behavior Trees is given by mapping them to probabilistic timed automata. We gain advantages for requirements capture using Behavior Trees by incorporating into the notation an existing elegant speciļ¬cation formalism (probabilistic timed automata) which has tool support for formal analysis of probabilistic user requirements.
Robert Colvin, Lars Grunske, Kirsten Winter
Added 08 Jun 2010
Updated 08 Jun 2010
Type Conference
Year 2007
Where IFM
Authors Robert Colvin, Lars Grunske, Kirsten Winter
Comments (0)