A Formal Model for Behavior Trees Based on Context-Free Grammar

被引：0
|
作者：
Anwer, Sajid [1 ]
Wen, Lian [1 ]
Wang, Zhe [1 ]
机构：
[1] Griffith Univ, Sch Informat & Commun Technol, Brisbane, Qld, Australia
来源：
2020 27TH ASIA-PACIFIC SOFTWARE ENGINEERING CONFERENCE (APSEC 2020) | 2020年
关键词：
Behavior Tree; Context-Free Grammar; CFG; Software Requirements Modeling; Formal Verification;
D O I：
10.1109/APSEC51365.2020.00057
中图分类号：
TP31 [计算机软件];
学科分类号：
081202 ; 0835 ;
摘要：
In the last two decades, several studies have been carried out to translate Behavior Trees (BTs) into other formal languages. However, as BTs are usually drawn directly from natural languages, there is no formal grammar to define what is a valid BT. In this research, we first propose a normal form for requirement BT as a building block for a valid BT, and then design a context-free grammar that can generate and verify all valid BTs. This work provides a solid foundation for BT research and will improve the quality of requirements modeling by identifying some common requirement defects.
引用
收藏
页码：465 / 469
页数：5
相关论文
共 50 条
  • [1] A Graphical Model for Context-Free Grammar Parsing
    Pingali, Keshav
    Bilardi, Gianfranco
    COMPILER CONSTRUCTION (CC 2015), 2015, 9031 : 3 - 27
  • [2] Human behavior recognition using a context-free grammar
    Rosani, Andrea
    Conci, Nicola
    De Natale, Francesco G. B.
    JOURNAL OF ELECTRONIC IMAGING, 2014, 23 (03)
  • [3] ON CONTEXT-FREE TREES
    CAZANESCU, VE
    THEORETICAL COMPUTER SCIENCE, 1985, 41 (01) : 33 - 50
  • [4] UNIVERSAL CONTEXT-FREE GRAMMAR
    KASAI, T
    INFORMATION AND CONTROL, 1975, 28 (01): : 30 - 34
  • [5] CONTEXT-FREE GRAMMAR FORMS
    CREMERS, A
    GINSBURG, S
    JOURNAL OF COMPUTER AND SYSTEM SCIENCES, 1975, 11 (01) : 86 - 117
  • [6] Parallel Contextual Array Insertion Deletion Grammar and (Context-Free : Context-Free) Matrix Grammar
    Jayasankar, S.
    Thomas, D. G.
    Immanuel, S. James
    Paramasivan, Meenakshi
    Robinson, T.
    Nagar, Atulya K.
    COMBINATORIAL IMAGE ANALYSIS, IWCIA 2020, 2020, 12148 : 147 - 163
  • [7] Grammar compression with probabilistic context-free grammar
    Naganuma, Hiroaki
    Hendrian, Diptarama
    Yoshinaka, Ryo
    Shinohara, Ayumi
    Kobayashi, Naoki
    2020 DATA COMPRESSION CONFERENCE (DCC 2020), 2020, : 386 - 386
  • [8] Context-free series on trees
    Bozapalidis, S
    INFORMATION AND COMPUTATION, 2001, 169 (02) : 186 - 229
  • [9] ON THE HOTZ GROUP OF A CONTEXT-FREE GRAMMAR
    FROUGNY, C
    SAKAROVITCH, J
    VALKEMA, E
    ACTA INFORMATICA, 1982, 18 (01) : 109 - 115
  • [10] The Polytope of Context-Free Grammar Constraints
    Pesant, Gilles
    Quimper, Claude-Guy
    Rousseau, Louis-Martin
    Sellmann, Meinolf
    INTEGRATION OF AI AND OR TECHNIQUES IN CONSTRAINT PROGRAMMING FOR COMBINATORIAL OPTIMIZATION PROBLEMS, PROCEEDINGS, 2009, 5547 : 223 - +
12345