Probabilistic timed behavior trees

被引：0

作者：

Colvin, Robert ^{[1
]}

Grunske, Lars ^{[1
]}

Winter, Kirsten ^{[1
]}

机构：

[1] Univ Queensland, Sch Informat Technol & Elect Engn, ARC Ctr Complex Syst, St Lucia, Qld 4067, Australia

来源：

INTEGRATED FORMAL METHODS, PROCEEDINGS | 2007年 / 4591卷

基金：

澳大利亚研究理事会;

关键词：

behavior Trees; probabilities; timed automata; model checking;

D O I：

暂无

中图分类号：

TP301 [理论、方法];

学科分类号：

081202 ;

摘要：

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.

引用

页码：156 / 175

页数：20

共 50 条

[31] Modeling and Reliability Evaluation for Electromechanical Systems Based on Probabilistic Behavior Trees
Yang P.
Liu Q.
Fan J.
Hou Y.
Zhongguo Jixie Gongcheng/China Mechanical Engineering, 2020, 31 (14): : 1639 - 1646
[32] Probabilistic Multicast Trees
Johnston, David A.
McIntyre, David R.
Wolff, Francis G.
Papachristou, Christos A.
JOURNAL OF COMPUTER SCIENCE & TECHNOLOGY, 2012, 12 (01): : 16 - 21
[33] PROBABILISTIC ALGORITHMS FOR TREES
SAGAN, BE
YEH, YN
FIBONACCI QUARTERLY, 1989, 27 (03): : 201 - 208
[34] Parametric, Probabilistic, Timed Resource Discovery System
Coti, Camille
ELECTRONIC PROCEEDINGS IN THEORETICAL COMPUTER SCIENCE, 2016, (220): : 53 - 62
[35] A Specification with Performance Evaluation for Probabilistic Timed Automata
Ma, Yan
Cao, Zining
Liu, Yang
2017 12TH INTERNATIONAL CONFERENCE ON INTELLIGENT SYSTEMS AND KNOWLEDGE ENGINEERING (IEEE ISKE), 2017,
[36] Local abstraction refinement for probabilistic timed programs
Draeger, Klaus
Kwiatkowska, Marta
Parker, David
Qu, Hongyang
THEORETICAL COMPUTER SCIENCE, 2014, 538 : 37 - 53
[37] Validation of Formal Models by Timed Probabilistic Simulation
Vu, Fabian
Leuschel, Michael
Mashkoor, Atif
RIGOROUS STATE-BASED METHODS, ABZ 2021, 2021, 12709 : 81 - 96
[38] Computing Bisimilarity Metrics for Probabilistic Timed Automata
Lanotte, Ruggero
Tini, Simone
INTEGRATED FORMAL METHODS, IFM 2019, 2019, 11918 : 303 - 321
[39] An extension of the inverse method to probabilistic timed automata
Andre, Etienne
Fribourg, Laurent
Sproston, Jeremy
FORMAL METHODS IN SYSTEM DESIGN, 2013, 42 (02) : 119 - 145
[40] Stochastic Games for Verification of Probabilistic Timed Automata
Kwiatkowska, Marta
Norman, Gethin
Parker, David
FORMAL MODELING AND ANALYSIS OF TIMED SYSTEMS, PROCEEDINGS, 2009, 5813 : 212 - 227

← 1 2 3 4 5 →