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 条
  • [1] Timed and Probabilistic Model Checking over Phylogenetic Trees
    Ignacio Requeno, Jose
    Manuel Colom, Jose
    8TH INTERNATIONAL CONFERENCE ON PRACTICAL APPLICATIONS OF COMPUTATIONAL BIOLOGY & BIOINFORMATICS (PACBB 2014), 2014, 294 : 105 - 112
  • [2] Analyzing Phylogenetic Trees with Timed and Probabilistic Model Checking: The Lactose Persistence Case Study
    Ignacio Requeno, Jose
    Manuel Colom, Jose
    JOURNAL OF INTEGRATIVE BIOINFORMATICS, 2014, 11 (03) : 248
  • [3] On probabilistic timed automata
    Beauquier, D
    THEORETICAL COMPUTER SCIENCE, 2003, 292 (01) : 65 - 84
  • [4] Timed behavior trees and their application to verifying real-time systems
    Grunske, Lars
    Winter, Kirsten
    Colvin, Robert
    2007 AUSTRALIAN SOFTWARE ENGINEERING CONFERENCE, PROCEEDINGS, 2007, : 211 - +
  • [5] Synthesizing compact behavior trees for probabilistic robotics domains
    Scheide, Emily
    Best, Graeme
    Hollinger, Geoffrey A.
    AUTONOMOUS ROBOTS, 2025, 49 (01)
  • [6] Counterexamples for timed probabilistic reachability
    Aljazzar, H
    Hermanns, H
    Leue, S
    FORMAL MODELING AND ANALYSIS OF TIMED SYSTEMS, 2005, 3829 : 177 - 195
  • [7] Development of Probabilistic Timed CEGAR
    Yamane, Satoshi
    Shimizu, Takaya
    2014 2ND INTERNATIONAL CONFERENCE ON SYSTEMS AND INFORMATICS (ICSAI), 2014, : 482 - 491
  • [8] Simplified Timed Attack Trees
    Ali, Aliyu Tanko
    RESEARCH CHALLENGES IN INFORMATION SCIENCE (RCIS 2021), 2021, 415 : 653 - 660
  • [9] Finite automata on timed ω-trees
    La Torre, S
    Napoli, M
    THEORETICAL COMPUTER SCIENCE, 2003, 293 (03) : 479 - 505
  • [10] Model checking for probabilistic timed automata
    Gethin Norman
    David Parker
    Jeremy Sproston
    Formal Methods in System Design, 2013, 43 : 164 - 190
12345