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 条
  • [11] Timed Behavior Trees for Failure Mode and Effects Analysis of time-critical systems
    Colvin, Robert
    Grunske, Lars
    Winter, Kirsten
    JOURNAL OF SYSTEMS AND SOFTWARE, 2008, 81 (12) : 2163 - 2182
  • [12] Probabilistic fuzzy timed protocol verification
    Huang, CM
    Hsu, JM
    Lee, SW
    COMPUTER COMMUNICATIONS, 1996, 19 (05) : 407 - 425
  • [13] Formal Testing of Timed and Probabilistic Systems
    Nunez, Manuel
    TESTING SOFTWARE AND SYSTEMS, 2011, 7019 : 9 - 14
  • [14] Model checking for probabilistic timed automata
    Norman, Gethin
    Parker, David
    Sproston, Jeremy
    FORMAL METHODS IN SYSTEM DESIGN, 2013, 43 (02) : 164 - 190
  • [15] On verification of Probabilistic timed automata against Probabilistic duration properties
    Van Hung, Dang
    Zhang, Miaomiao
    13TH IEEE INTERNATIONAL CONFERENCE ON EMBEDDED AND REAL-TIME COMPUTING SYSTEMS AND APPLICATIONS, PROCEEDINGS, 2007, : 165 - +
  • [16] Modal Specifications for Probabilistic Timed Systems
    Han, Tingting
    Krause, Christian
    Kwiatkowska, Marta
    Giese, Holger
    ELECTRONIC PROCEEDINGS IN THEORETICAL COMPUTER SCIENCE, 2013, (117): : 66 - 80
  • [17] Modeling and Analysis of Probabilistic Timed Systems
    Dubey, Abhishek
    Riley, Derek
    Abdelwahed, Sherif
    Bapty, Ted
    16TH ANNUAL IEEE INTERNATIONAL CONFERENCE AND WORKSHOP ON THE ENGINEERING OF COMPUTER BASED SYSTEMS, PROCEEDINGS, 2009, : 69 - 78
  • [18] PROBABILISTIC AND PRIORITIZED MODELS OF TIMED CSP
    LOWE, G
    THEORETICAL COMPUTER SCIENCE, 1995, 138 (02) : 315 - 352
  • [19] Weak bisimulation for Probabilistic Timed Automata
    Lanotte, Ruggero
    Maggiolo-Schettini, Andrea
    Troina, Angelo
    THEORETICAL COMPUTER SCIENCE, 2010, 411 (50) : 4291 - 4322
  • [20] Minimal Witnesses for Probabilistic Timed Automata
    Jantsch, Simon
    Funke, Florian
    Baier, Christel
    AUTOMATED TECHNOLOGY FOR VERIFICATION AND ANALYSIS (ATVA 2020), 2020, 12302 : 501 - 517
12345