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 条
12345