Abstract
In this paper, we present a method that learns a deterministic finite state machine from the conformance test logs of a telecommunication protocol; then that machine is used as test model for performance testing. The learning process is in contrast to most theoretical methods automatic; it applies a sequential pattern mining algorithm on the test logs, and uses a recently proposed metric for finding frequent and significant transition sequences. The method aims to help and speed up test model design, and at the same time it may not provide an exact solution, the equivalence of some states may not be proven. In the paper, we show the results of experiments on random machines, and issues and considerations that arise when the method was applied to 3GGP Telephony Application Server test logs.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
References
Agrawal, R., Srikant, R.: Fast algorithms for mining association rules in large databases. In: Proceedings of the 20th International Conference on Very Large Data Bases, VLDB 1994, pp. 487–499. Morgan Kaufmann Publishers Inc., San Francisco (1994). http://dl.acm.org/citation.cfm?id=645920.672836
Angluin, D.: Learning Regular Sets from Queries and Counterexamples. Inf. Comput. 75(2), 87–106 (1987). http://dx.doi.org/10.1016/0890-5401(87)90052-6
Balcázar, J., Díaz, J., Gavaldà, R., Watanabe, O.: Algorithms for learning finite automata from queries: a unified view. In: Du, D.Z., Ko, K.-I. (eds.) Advances in Algorithms, Languages, and Complexity, pp. 53–72. Springer, New York (1997). http://dx.doi.org/10.1007/978-1-4613-3394-4_2
Barringer, H., Giannakopoulou, D., Pasareanu, C.S.: Proof rules for automated compositional verification through learning. In: Proceedings of the SAVCBS Workshop, pp. 14–21 (2003). http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.3.8668
Hagerer, A., Hungar, H.: Model generation by moderated regular extrapolation. In: Kutsche, R.-D., Weber, H. (eds.) FASE 2002. LNCS, vol. 2306, p. 80. Springer, Heidelberg (2002)
Howar, F., Steffen, B., Merten, M.: Automata learning with automated alphabet abstraction refinement. In: Jhala, R., Schmidt, D. (eds.) VMCAI 2011. LNCS, vol. 6538, pp. 263–277. Springer, Heidelberg (2011)
Hungar, H., Niese, O., Steffen, B.: Domain-specific optimization in automata learning. In: Hunt Jr., W.A., Somenzi, F. (eds.) CAV 2003. LNCS, vol. 2725, pp. 315–327. Springer, Heidelberg (2003)
Kardkovács, Z.T., Kovács, G.: Finding sequential patterns with TF-IDF metrics in health-care databases. Acta Universitatis Sapientiae Informatica 6(2), 287–310 (2015). http://doi.org/10.1515/ausi-2015-0008
Lee, D., Yannakakis, M.: Principles and methods of testing finite state machines: a survey. Proc. IEEE 84(8), 1090–1123 (1996). http://doi.org/10.1109/5.533956
Li, K., Groz, R., Shahbaz, M.: Integration testing of components guided by incremental state machine learning. In: TAIC PART, pp. 59–70. IEEE Computer Society (2006). http://dblp.uni-trier.de/db/conf/taicpart/taicpart2006.html#LiGS06
Pfleeger, C.: State reduction in incompletely specified finite-state machines. IEEE Trans. Comput. C–22(12), 1099–1102 (1973). http://doi.org/10.1109/T-C.1973.223655
Prajapati, G.L.: Advances in learning formal languages. In: International MultiConference of Engineers and Computer Scientists, IMECS 2011, pp. 118–126. International Association of Engineers, Hong Kong, 16–18 March 2011. http://www.iaeng.org/publication/IMECS2011/IMECS2011_pp118-126.pdf
Rivest, R.L., Schapire, R.E.: Inference of finite automata using homing sequences. In: Proceedings of the Twenty-first Annual ACM Symposium on Theory of Computing, STOC 1989, pp. 411–420. ACM, New York (1989). http://doi.acm.org/10.1145/73007.73047
Shahbaz, M., Li, K., Groz, R.: Learning parameterized state machine model for integration testing. In: 31st Annual International Computer Software and Applications Conference, COMPSAC 2007, vol. 2, pp. 755–760, July 2007. http://doi.org/10.1109/COMPSAC.2007.134
Srikant, R., Agrawal, R.: Miningsequential patterns: generalizations and performance improvements. In: Apers, P.M.G., Bouzeghoub, M., Gardarin, G. (eds.) EDBT 1996. LNCS, vol. 1057. Springer, Heidelberg (1996). http://dl.acm.org/citation.cfm?id=645337.650382
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2015 Springer International Publishing Switzerland
About this paper
Cite this paper
Adamis, G., Kovács, G., Réthy, G. (2015). Generating Performance Test Model from Conformance Test Logs. In: Fischer, J., Scheidgen, M., Schieferdecker, I., Reed, R. (eds) SDL 2015: Model-Driven Engineering for Smart Cities. SDL 2015. Lecture Notes in Computer Science(), vol 9369. Springer, Cham. https://doi.org/10.1007/978-3-319-24912-4_19
Download citation
DOI: https://doi.org/10.1007/978-3-319-24912-4_19
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-24911-7
Online ISBN: 978-3-319-24912-4
eBook Packages: Computer ScienceComputer Science (R0)