paper-with-me

홈 › Papers

Verifying Safety of Behaviour Trees in Event-B

2022-09-28 · Matteo Tadiello, Elena Troubitsyna

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 invariants of already used trees, while keeping the complexity of the formalization of the tree simple for the final user. Allowing the possibility to test the particular instance of the behavior tree without the necessity to know the more abstract levels of the formalization.

📄 PDF Abstract BibTeX arXiv:2209.14045

Code (0)

등록된 구현이 없습니다.

Tasks

Decision Making

Methods 이 논문이 사용한 방법론

Test 설명 없음

Similar Papers 제목 키워드 기반

Verifying And Interpreting Neural Networks using Finite Automata

2022-11-02 · Marco Sälzer, Eric Alsmann, Florian Bruse, Martin Lange

Verifying properties and interpreting the behaviour of deep neural networks (DNN) is an important task given their ubiquitous use in applications, including safety-critical ones, and their black-box nature. We propose an…

Adversarial Robustness

Safety Verification of Neural Network Controlled Systems

2020-11-10 · Arthur Clavière, Eric Asselin, Christophe Garion, Claire Pagetti

In this paper, we propose a system-level approach for verifying the safety of neural network controlled systems, combining a continuous-time physical system with a discrete-time neural network based controller. We assume…

Safety Verification of Decision-Tree Policies in Continuous Time

2023-09-21 · NeurIPS 2023 11

Decision trees have gained popularity as interpretable surrogate models for learning-based control policies. However, providing safety guarantees for systems controlled by decision trees is an open challenge. We show tha…

Learning Invariants using Decision Trees

2015-01-20 · Siddharth Krishna, Christian Puhrsch, Thomas Wies

The problem of inferring an inductive invariant for verifying program safety can be formulated in terms of binary classification. This is a standard problem in machine learning: given a sample of good and bad points, one…

Binary Classification

Improving the Modularity of AUV Control Systems using Behaviour Trees

2018-11-01 · Christopher Iliffe Sprague, Özer Özkahraman, Andrea Munafo, Rachel Marlow 외

In this paper, we show how behaviour trees (BTs) can be used to design modular, versatile, and robust control architectures for mission-critical systems. In particular, we show this in the context of autonomous underwate…