Probabilistic timed behavior trees

Authors:
Robert Colvin;Lars Grunske;Kirsten Winter
Affiliations:
ARC Centre for Complex Systems, School of Information Technology and Electrical Engineering, University of Queensland, Australia;ARC Centre for Complex Systems, School of Information Technology and Electrical Engineering, University of Queensland, Australia;ARC Centre for Complex Systems, School of Information Technology and Electrical Engineering, University of Queensland, Australia
Venue:
IFM'07 Proceedings of the 6th international conference on Integrated formal methods
Year:
2007

Citing 12
Cited 8

Probabilistic and prioritized models of timed CSP

MFPS '92 Selected papers of the meeting on Mathematical foundations of programming semantics
Automatic verification of real-time systems with discrete probability distributions

Theoretical Computer Science
On probabilistic timed automata

Theoretical Computer Science
A Probabilistic Extension of UML Statecharts

FTRTFT '02 Proceedings of the 7th International Symposium on Formal Techniques in Real-Time and Fault-Tolerant Systems: Co-sponsored by IFIP WG 2.2
Verifying Continuous Time Markov Chains

CAV '96 Proceedings of the 8th International Conference on Computer Aided Verification
Reliability assessment through probabilistic refinement

Nordic Journal of Computing
Model checking for probability and time: from theory to practice

LICS '03 Proceedings of the 18th Annual IEEE Symposium on Logic in Computer Science
From Requirements Change to Design Change: A Formal Path

SEFM '04 Proceedings of the Software Engineering and Formal Methods, Second International Conference
Performance analysis of probabilistic timed automata using digital clocks

Formal Methods in System Design
Timed Behavior Trees and Their Application to Verifying Real-Time Systems

ASWEC '07 Proceedings of the 2007 Australian Software Engineering Conference
An automated failure mode and effect analysis based on high-level design specification with behavior trees

IFM'05 Proceedings of the 5th international conference on Integrated Formal Methods
PRISM: a tool for automatic verification of probabilistic systems

TACAS'06 Proceedings of the 12th international conference on Tools and Algorithms for the Construction and Analysis of Systems

Timed Behavior Trees for Failure Mode and Effects Analysis of time-critical systems

Journal of Systems and Software
Timed Simulation of Extended AADL-Based Architecture Specifications with Timed Abstract State Machines

QoSA '09 Proceedings of the 5th International Conference on the Quality of Software Architectures: Architectures for Adaptive Software Systems
Monitoring probabilistic properties

Proceedings of the the 7th joint meeting of the European software engineering conference and the ACM SIGSOFT symposium on The foundations of software engineering
A classification and comparison of model checking software architecture techniques

Journal of Systems and Software
First International Workshop on Quantitative Stochastic Models in the Verification and Design of Software Systems (QUOVADIS 2010)

Proceedings of the 32nd ACM/IEEE International Conference on Software Engineering - Volume 2
A semantics for Behavior Trees using CSP with specification commands

Science of Computer Programming
Parameterizing behavior trees

MIG'11 Proceedings of the 4th international conference on Motion in Games
Execution of natural language requirements using State Machines synthesised from Behavior Trees

Journal of Systems and Software

Quantified Score

Hi-index	0.00

Visualization

Abstract

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 specification formalism (probabilistic timed automata) which has tool support for formal analysis of probabilistic user requirements.