Disjunction Composition of BDD Transition Systems for Model-Based Testing

Fuente: arXiv
Enregistré dans:
Détails bibliographiques
Auteurs principaux: Zameni, Tannaz, Bos, Petra van den, Rensink, Arend
Format: Preprint
Publié: 2026
Sujets:
Accès en ligne:
Tags: Ajouter un tag
Pas de tags, Soyez le premier à ajouter un tag!
_version_ 1866910026888642560
author Zameni, Tannaz
Bos, Petra van den
Rensink, Arend
author_facet Zameni, Tannaz
Bos, Petra van den
Rensink, Arend
contents We introduce a compositional approach to model-based test generation in Behavior-Driven Development (BDD). BDD is an agile methodology in which system behavior is specified through textual scenarios that, in our approach, are translated into transition systems used for model-based testing. This paper formally defines disjunction composition, to combine BDD transition systems that represent alternative system behaviors. Disjunction composition allows for modeling and testing the integrated behavior while ensuring that the testing power of the original set of scenarios is preserved. This is proved using a symbolic semantics for BDD transition systems, with the property that the symbolic equivalence of two BDD transition systems guarantees that they fail the same test cases. Also, we demonstrate the potential of disjunction composition by applying the composition in an industrial case study.
format Preprint
id arxiv_https___arxiv_org_abs_2602_17237
institution arXiv
publishDate 2026
record_format arxiv
spellingShingle Disjunction Composition of BDD Transition Systems for Model-Based Testing
Zameni, Tannaz
Bos, Petra van den
Rensink, Arend
Software Engineering
Formal Languages and Automata Theory
We introduce a compositional approach to model-based test generation in Behavior-Driven Development (BDD). BDD is an agile methodology in which system behavior is specified through textual scenarios that, in our approach, are translated into transition systems used for model-based testing. This paper formally defines disjunction composition, to combine BDD transition systems that represent alternative system behaviors. Disjunction composition allows for modeling and testing the integrated behavior while ensuring that the testing power of the original set of scenarios is preserved. This is proved using a symbolic semantics for BDD transition systems, with the property that the symbolic equivalence of two BDD transition systems guarantees that they fail the same test cases. Also, we demonstrate the potential of disjunction composition by applying the composition in an industrial case study.
title Disjunction Composition of BDD Transition Systems for Model-Based Testing
topic Software Engineering
Formal Languages and Automata Theory
url https://arxiv.org/abs/2602.17237