How testable are BDI agents? An analysis of branch coverage

2Citations
Citations of this article
1Readers
Mendeley users who have this article in their library.
Get full text

Abstract

Before deploying a software system, it is important to assure that it will function correctly. Traditionally, this assurance is obtained by testing the system with a collection of test cases. However, since agent systems exhibit complex behaviour, it is not clear whether testing is even feasible. In this paper we extend our understanding of the feasibility of testing BDI agent programs by analysing their testability with respect to the all edges test adequacy criterion, and comparing with previous work that considered the all paths criterion. Our findings include that the number of tests required with respect to the all edges criterion is much lower than for the all paths criterion. We also compare BDI program testability with testability of (abstract) procedural programs.

Cite

CITATION STYLE

APA

Winikoff, M. (2016). How testable are BDI agents? An analysis of branch coverage. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 10002 LNAI, pp. 90–106). Springer Verlag. https://doi.org/10.1007/978-3-319-46882-2_6

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free