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 条
  • [31] CONTROL SETS ON CONTEXT-FREE GRAMMAR FORMS
    GREIBACH, SA
    JOURNAL OF COMPUTER AND SYSTEM SCIENCES, 1977, 15 (01) : 35 - 98
  • [32] Unsupervised Statistical Learning of Context-free Grammar
    Unold, Olgierd
    Gabor, Mateusz
    Wieczorek, Wojciech
    ICAART: PROCEEDINGS OF THE 12TH INTERNATIONAL CONFERENCE ON AGENTS AND ARTIFICIAL INTELLIGENCE, VOL 1, 2020, : 431 - 438
  • [33] DESCRIPTIONAL COMPLEXITY OF CONTEXT-FREE GRAMMAR FORMS
    CSUHAJVARJU, E
    KELEMENOVA, A
    THEORETICAL COMPUTER SCIENCE, 1993, 112 (02) : 277 - 289
  • [34] ELIMINATION OF LEFT RECURSION IN CONTEXT-FREE GRAMMAR
    BORDIER, J
    REVUE FRANCAISE D AUTOMATIQUE INFORMATIQUE RECHERCHE OPERATIONNELLE, 1970, 4 (NB3): : 145 - 162
  • [35] ELIMINATION OF LOEFT RECURSIVITY IN A CONTEXT-FREE GRAMMAR
    BORDIER, J
    REVUE FRANCAISE D INFORMATIQUE DE RECHERCHE OPERATIONNELLE, 1970, 4 (NB3): : 145 - &
  • [36] The omphalos context-free grammar learning competition
    Starkie, B
    Coste, F
    van Zaanen, M
    GRAMMATICAL INFERENCE: ALGORITHMS AND APPLICATIONS, PROCEEDINGS, 2004, 3264 : 16 - 27
  • [37] Statistical Parsing with Context-Free Filtering Grammar
    Demko, Michael
    Penn, Gerald
    ADVANCES IN ARTIFICIAL INTELLIGENCE, PROCEEDINGS, 2009, 5549 : 52 - +
  • [38] Model-based testing for UML statechart diagram via extended context-free grammar
    Li, L. (liliping@sspu.edu.cn), 1600, Trade Science Inc, 126,Prasheel Park,Sanjay Raj Farm House,Nr. Saurashtra Unive, Rajkot, Gujarat, 360 005, India (08):
  • [39] Split-Based Algorithm for Weighted Context-Free Grammar Induction
    Gabor, Mateusz
    Wieczorek, Wojciech
    Unold, Olgierd
    APPLIED SCIENCES-BASEL, 2021, 11 (03): : 1 - 13
  • [40] A Probabilistic Context-Free Grammar Based Random Test Program Generation
    Cekan, Ondrej
    Kotasek, Zdenek
    2017 EUROMICRO CONFERENCE ON DIGITAL SYSTEM DESIGN (DSD), 2017, : 356 - 359
12345