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

No Thumbnail Available
File version
Author(s)
Anwer, Sajid
Wen, Lian
Wang, Zhe
Griffith University Author(s)
Primary Supervisor
Other Supervisors
Editor(s)
Date
2020
Size
File type(s)
Location

Singapore

License
Abstract

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.

Journal Title
Conference Title

2020 27th Asia-Pacific Software Engineering Conference (APSEC)

Book Title
Edition
Volume
Issue
Thesis Type
Degree Program
School
Publisher link
Patent number
Funder(s)
Grant identifier(s)
Rights Statement
Rights Statement
Item Access Status
Note
Access the data
Related item(s)
Subject

Software engineering

Persistent link to this record
Citation

Anwer, S; Wen, L; Wang, Z, A Formal Model for Behavior Trees Based on Context - Free Grammar, 2020 27th Asia-Pacific Software Engineering Conference (APSEC), 2020, pp. 465-469