Towards Formal Verification of Behaviour-Driven Development Scenarios Using Timed Automata

This paper introduces an approach for translating Behaviour-Driven Development (BDD) scenarios written under a domain-specific language (DSL) into Timed Automata (TA) to al-low for formal verification of real-time systems. A set of mapping rules is presented to facilitate the translation. We demonstrate the feasibility of our approach through an illustrative example of a vending machine that operates under a particular set of time constraints. Our proof-of-concept indicates that this approach is an important step towards ensuring compatibility between high-level software specifications (BDD scenarios) and formal models (TA models). We also discuss the current limitations of such work along with recommendations on how these might be addressed.