Optimal test sequence generation for protocols: the Chinese postman algorithm applied to Q.931
Conformance testing methodologies and architectures for OSI protocols
Graph Algorithms for Conformance Testing Using the Rural ChinesePostman Tour
SIAM Journal on Discrete Mathematics
Software unit test coverage and adequacy
ACM Computing Surveys (CSUR)
Fault Model-Driven Test Derivation from Finite State Models: Annotated Bibliography
MOVEP '00 Proceedings of the 4th Summer School on Modeling and Verification of Parallel Processes
Testing Transition Systems: An Annotated Bibliography
MOVEP '00 Proceedings of the 4th Summer School on Modeling and Verification of Parallel Processes
Introduction to Evolutionary Computing
Introduction to Evolutionary Computing
Ant Colony Optimization
Finding safety errors with ACO
Proceedings of the 9th annual conference on Genetic and evolutionary computation
Finding Minimum Spanning/Distances Trees by Using River Formation Dynamics
ANTS '08 Proceedings of the 6th international conference on Ant Colony Optimization and Swarm Intelligence
Automatic test case generation with region-related coverage annotations for real-time systems
ATVA'05 Proceedings of the Third international conference on Automated Technology for Verification and Analysis
Using river formation dynamics to design heuristic algorithms
UC'07 Proceedings of the 6th international conference on Unconventional Computation
Applying Evolutionary Computation Methods to Formal Testing and Model Checking
IWANN '09 Proceedings of the 10th International Work-Conference on Artificial Neural Networks: Part I: Bio-Inspired Systems: Computational and Ambient Intelligence
A Formal Approach to Heuristically Test Restorable Systems
ICTAC '09 Proceedings of the 6th International Colloquium on Theoretical Aspects of Computing
Hybridizing river formation dynamics and ant colony optimization
ECAL'09 Proceedings of the 10th European conference on Advances in artificial life: Darwin meets von Neumann - Volume Part II
An ACO-RFD hybrid method to solve NP-complete problems
Frontiers of Computer Science: Selected Publications from Chinese Universities
Smart data packet ad hoc routing protocol
Computer Networks: The International Journal of Computer and Telecommunications Networking
| Hi-index | 0.00 |
Given a finite state machine denoting the specification of a system, finding some short interaction sequences capable to reach some/all states or transitions of this machine is a typical goal in testing methods. We study the problem of finding such sequences in the case where configurations previously traversed can be saved and restored (at some cost). Finding optimal sequences for this case is an NP-hard problem. We propose an heuristic method to approximately solve this problem based on an evolutionary computation approach, in particular River Formation Dynamics . Some experimental results are reported.