In this paper we present the application of the formal testing method to the statechart notation. The method is proposed for deriving test sets for complex statecharts, i.e. containing hierarchy and concurrency, using a ‘divide and conquer’ strategy. Initially, test cases are generated for simple statecharts and then these test cases are ‘merged’ to derive test cases for complex statecharts. They are then populated with test data. Methods for generating test cases for simple statecharts and for ‘merging’ of such test cases, are described using a simple example. The blackbox test method presented is easy to automate.
CITATION STYLE
Bogdanov, K., Holcombe, M., & Singh, H. (1999). Automated test set generation for statecharts. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 1641, pp. 107–121). Springer Verlag. https://doi.org/10.1007/3-540-48257-1_6
Mendeley helps you to discover research relevant for your work.