The equivalence problem of multitape finite automata
Theoretical Computer Science
Equivalence, reduction and minimization of finite automata over semirings
Theoretical Computer Science
Test Selection Based on Finite State Models
IEEE Transactions on Software Engineering
Introduction to Automata Theory, Languages and Computability
Introduction to Automata Theory, Languages and Computability
IEEE Transactions on Software Engineering
Algorithms for Guided Tree Automata
WIA '96 Revised Papers from the First International Workshop on Implementing Automata
A formal approach to specifying and testing the interoperation between components
ACM-SE 38 Proceedings of the 38th annual on Southeast regional conference
Testing Software Design Modeled by Finite-State Machines
IEEE Transactions on Software Engineering
| Hi-index | 0.00 |
This paper considers the integration testing for networked software that is built by assembling several distributed components in an interoperable manner. Using the traditional single automata-based test approaches, we suffer from the state combinatorial explosion problem. Moreover, several generated test cases may not be executable. This paper proposed a test method based on the automata net which is the extension of communication automata. The state/transition path (S/T-Path) is defined to describe the execution of the software under test. The test cases are constructed through combining the atomic S/T-Paths and all executable. The test cases are calculated from the local transition structures and the interaction procedure between components, so the state combinatorial explosion problem will not be encountered. The generation of test cases for certain software and the benefits for the problems are discussed. Results show that our method has better properties.