Verifying Safety of Behaviour Trees in Event-B

@inproceedings{Tadiello2022VerifyingSO,
  title={Verifying Safety of Behaviour Trees in Event-B},
  author={Matteo Tadiello and Elena Troubitsyna},
  booktitle={FMAS/ASYDE@SEFM},
  year={2022}
}
Behavior Trees (BT) are becoming increasingly popular in the robotics community. The BT tool is well suited for decision-making applications allowing a robot to perform complex behavior while being explainable to humans as well. Verifying that BTs used are well constructed with respect to safety and reliability requirements is essential, especially for robots operating in critical environments. In this work, we propose a formal specification of Behavior Trees and a methodology to prove… 

References

SHOWING 1-10 OF 16 REFERENCES

A Framework for Formal Verification of Behavior Trees With Linear Temporal Logic

It is proved that this method does not compromise the flexible design process of BTs, i.e. changes to subtrees can be verified separately and their combination can be assured to be correct.

How Behavior Trees modularize robustness and safety in hybrid systems

This paper formalizes and analyzes the reasons behind the success of the BTs using standard tools of robot control theory, focusing on how properties such as robustness and safety are addressed in a modular way.

Safety Assessment Using Behavior Trees and Model Checking

This paper demonstrates the use of Behavior Trees and model checking to assess system safety requirements for a system containing substantial redundancy for the Airbus A320 aircraft, which are critical for aircraft control.

Automatic Safe Behaviour Tree Synthesis for Autonomous Agents

This paper proposes a systematic approach for automatically generating a safe behaviour tree (BT) coordinator to guide an autonomous vehicle to satisfy the goal of a mission without violating the

Performance analysis of stochastic behavior trees

This paper presents a mathematical framework for performance analysis of Behavior Trees, and introduces Stochastic Behavior Trees (SBT), where it is shown how Discrete Time Markov Chains (DTMC) can be used to aggregate measures from one level of the tree to the next.

Behavior trees in action: a study of robotics applications

It is found that Behavior Trees are a pragmatic language, not fully specified, allowing projects to extend it even for just one model, and contributes a dataset of real-world behavior models, hoping to inspire the community to use and further develop this language, associated tools, and analysis techniques.

Synthesis of correct-by-construction behavior trees

The proposed approach combines the modularity and reactivity of BTs with the formal guarantees of Linear Temporal Logic methods to synthesize a BT in polynomial time that is guaranteed to correctly execute the desired task.

Formal Goal-Oriented Development of Resilient MAS in Event-B

A formal goal-oriented approach to development of resilient MAS is proposed that formalizes the notion of goal and goal achievement in Event-B and proposes the specification and refinement patterns that allow us to guarantee that the targeted goals are reached despite agent failures.

Learning of Behavior Trees for Autonomous Agents

The proposed algorithm incrementally learns a switching structure, in terms of a BT, that is able to handle the situations encountered and uses the and–or analogy to limit the size of the resulting structure.