Abstract
In order to test a Finite State Machine (FSM), first we typically have to identify some short interaction sequences allowing to reach those states or transitions considered as critical. If these sequences are applied to an implementation under test (IUT), then equivalent states or transitions would be reached and observed in the implementation – provided that the implementation were actually defined as the specification. In this paper we study how to obtain such sequences in a scenario where previous configurations can be restored at any time. In general, this feature enables sequences to reach the required parts of the machine in less time, because some repetitions can be avoided. However, finding optimal sequences is NP-hard when configurations can be restored. We use an evolutionary method, River Formation Dynamics, to heuristically solve this problem.
Work supported by projects TIN2006-15578-C02-01, CCG08-UCM/TIC-4124, and the UCM-BSCH programme (GR58/08 - group number 910606).
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
Preview
Unable to display preview. Download preview PDF.
References
Brinksma, E., Tretmans, J.: Testing transition systems: An annotated bibliography. In: Cassez, F., Jard, C., Rozoy, B., Dermot, M. (eds.) MOVEP 2000. LNCS, vol. 2067, pp. 187–195. Springer, Heidelberg (2001)
de Jong, K.: Evolutionary computation: a unified approach. In: Genetic and Evolutionary Computation Conference, GECCO 2008, pp. 2245–2258. ACM Press, New York (2008)
Dorigo, M.: Ant Colony Optimization. MIT Press, Cambridge (2004)
Lee, D., Yannakakis, M.: Principles and methods of testing finite state machines: A survey. Proceedings of the IEEE 84(8), 1090–1123 (1996)
Petrenko, A.: Fault model-driven test derivation from finite state models: Annotated bibliography. In: Cassez, F., Jard, C., Rozoy, B., Dermot, M. (eds.) MOVEP 2000. LNCS, vol. 2067, pp. 196–205. Springer, Heidelberg (2001)
Rabanal, P., Rodríguez, I., Rubio, F.: Using river formation dynamics to design heuristic algorithms. In: Akl, S.G., Calude, C.S., Dinneen, M.J., Rozenberg, G., Wareham, H.T. (eds.) UC 2007. LNCS, vol. 4618, pp. 163–177. Springer, Heidelberg (2007)
Rabanal, P., Rodríguez, I., Rubio, F.: Finding minimum spanning/distances trees by using river formation dynamics. In: Dorigo, M., Birattari, M., Blum, C., Clerc, M., Stützle, T., Winfield, A.F.T. (eds.) ANTS 2008. LNCS, vol. 5217, pp. 60–71. Springer, Heidelberg (2008)
Rabanal, P., Rodríguez, I., Rubio, F.: Applying river formation dynamics to solve NP-complete problems. In: Nature-Inspired Algorithms for Optimisation. Studies in Computational Intelligence, vol. 193, pp. 333–368. Springer, Heidelberg (2009)
Rabanal, P., Rodríguez, I., Rubio, F.: A formal approach to heuristically test restorable systems (Extended version) (2009), http://kimba.mat.ucm.es/prabanal/
Rabanal, P., Rodríguez, I., Rubio, F.: Testing restorable systems by using RFD. In: IWANN 2009. LNCS, vol. 5517. Springer, Heidelberg (2009)
Rodríguez, I., Merayo, M.G., Núñez, M.: \(\mathcal{HOTL}\): Hypotheses and observations testing logic. Journal of Logic and Algebraic Programming 74(2), 57–93 (2008)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2009 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Rabanal, P., Rodríguez, I., Rubio, F. (2009). A Formal Approach to Heuristically Test Restorable Systems. In: Leucker, M., Morgan, C. (eds) Theoretical Aspects of Computing - ICTAC 2009. ICTAC 2009. Lecture Notes in Computer Science, vol 5684. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-03466-4_19
Download citation
DOI: https://doi.org/10.1007/978-3-642-03466-4_19
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-03465-7
Online ISBN: 978-3-642-03466-4
eBook Packages: Computer ScienceComputer Science (R0)