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 条
  • [41] Consistency in Parametric Interval Probabilistic Timed Automata
    Andre, Etienne
    Delahaye, Benoit
    PROCEEDINGS 23RD INTERNATIONAL SYMPOSIUM ON TEMPORAL REPRESENTATION AND REASONING - TIME 2016, 2016, : 110 - 119
  • [42] A Decidable Probability Logic for Timed Probabilistic Systems
    Lanotte, Ruggero
    Beauquier, Daniele
    FUNDAMENTA INFORMATICAE, 2009, 96 (1-2) : 127 - 151
  • [43] Concavely-Priced Probabilistic Timed Automata
    Jurdzinski, Marcin
    Kwiatkowska, Marta
    Norman, Gethin
    Trivedi, Ashutosh
    CONCUR 2009 - CONCURRENCY THEORY, PROCEEDINGS, 2009, 5710 : 415 - +
  • [44] An extension of the inverse method to probabilistic timed automata
    Étienne André
    Laurent Fribourg
    Jeremy Sproston
    Formal Methods in System Design, 2013, 42 : 119 - 145
  • [45] Extended directed search for probabilistic timed reachability
    Aljazzar, Husain
    Leue, Stefan
    FORMAL MODELING AND ANALYSIS OF TIMED SYSTEMS, 2006, 4202 : 33 - 51
  • [46] Counterexample For Timed Probabilistic Reachability In Uniform CTMDP
    Zhang, Junhua
    Huang, Zhiqiu
    Cao, Zining
    Xiao, Fangxiong
    2008 INTERNATIONAL SEMINAR ON FUTURE INFORMATION TECHNOLOGY AND MANAGEMENT ENGINEERING, PROCEEDINGS, 2008, : 612 - 615
  • [47] Monitoring of Probabilistic Timed Property Sequence Charts
    Zhang, Pengcheng
    Li, Wenrui
    Wan, Dingsheng
    Grunske, Lars
    SOFTWARE-PRACTICE & EXPERIENCE, 2011, 41 (07): : 841 - 866
  • [48] Symbolic model checking for probabilistic timed automata
    Kwiatkowska, M
    Norman, G
    Sproston, J
    Wang, FZ
    FORMAL TECHNIQUES, MODELLING AND ANALYSIS OF TIMED AND FAULT-TOLERANT SYSTEMS, PROCEEDINGS, 2004, 3253 : 293 - 308
  • [49] A Modest Approach to Checking Probabilistic Timed Automata
    Hartmanns, Arnd
    Hermanns, Holger
    SIXTH INTERNATIONAL CONFERENCE ON THE QUANTITATIVE EVALUATION OF SYSTEMS, PROCEEDINGS, 2009, : 187 - 196
  • [50] Consistency in Parametric Interval Probabilistic Timed Automata
    Andre, Etienne
    Delahaye, Benoit
    Fournier, Paulin
    JOURNAL OF LOGICAL AND ALGEBRAIC METHODS IN PROGRAMMING, 2020, 110 (110)
12345