Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

15

IFM
2007
Springer

favoriteEmaildiscussreport

104views Formal Methods» more IFM 2007»

Probabilistic Timed Behavior Trees

13 years 10 months ago

Probabilistic Timed Behavior Trees

Download www.behaviorengineering.org

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

Real-time Traffic

Behavior Trees | IFM 2007 | Probabilistic Timed Automata | Probabilistic Timed Behavior |

claim paper

Related Content

» Multiple Communication in MultiHop Radio Networks

» Timed Behavior Trees and Their Application to Verifying RealTime Systems

» Modeling Highway Traffic Volumes

» ProApproX a lightweight approximation query processor over probabilistic trees

» Probabilistic calling context

» Understanding the scalability of Bayesian network inference using clique tree growth curve...

» Probabilistic Deduction with Conditional Constraints over Basic Events

» Probabilistic modeling of data cache behavior

» Behavioral Cartography of Timed Automata

Post Info
More Details (n/a)

Added	08 Jun 2010
Updated	08 Jun 2010
Type	Conference
Year	2007
Where	IFM
Authors	Robert Colvin, Lars Grunske, Kirsten Winter

Comments (0)