Graph rewriting: an algebraic and logic approach
Handbook of theoretical computer science (vol. B)
Analysis of Recursive State Machines
CAV '01 Proceedings of the 13th International Conference on Computer Aided Verification
STOC '04 Proceedings of the thirty-sixth annual ACM symposium on Theory of computing
International Journal on Software Tools for Technology Transfer (STTT) - Special section on high-level test of complex systems
Synchronization of Regular Automata
MFCS '09 Proceedings of the 34th International Symposium on Mathematical Foundations of Computer Science 2009
Model-based test selection for infinite-state reactive systems
FMCO'06 Proceedings of the 5th international conference on Formal methods for components and objects
CSR'08 Proceedings of the 3rd international conference on Computer science: theory and applications
A symbolic framework for model-based testing
FATES'06/RV'06 Proceedings of the First combined international conference on Formal Approaches to Software Testing and Runtime Verification
Automatic test generation from interprocedural specifications
TestCom'07/FATES'07 Proceedings of the 19th IFIP TC6/WG6.1 international conference, and 7th international conference on Testing of Software and Communicating Systems
Height-deterministic pushdown automata
MFCS'07 Proceedings of the 32nd international conference on Mathematical Foundations of Computer Science
| Hi-index | 0.00 |
In this paper we explore test generation for Recursive Tiles Systems (RTS) in the framework of the classical ioco testing theory. The RTS model allows the description of reactive systems with recursion, and is very similar to other models like Pushdown Automata, Hyperedge Replacement Grammars or Recursive State Machines. We first present an off-line test generation algorithm for Weighted RTS, a determinizable sub-class of RTS, and second, an on-line test generation algorithm for the full RTS model. Both algorithms use test purposes to guide test selection through targeted behaviours.