Skip to main content
Log in

Estimating the feasibility of transition paths in extended finite state machines

  • Published:
Automated Software Engineering Aims and scope Submit manuscript

Abstract

There has been significant interest in automating testing on the basis of an extended finite state machine (EFSM) model of the required behaviour of the implementation under test (IUT). Many test criteria require that certain parts of the EFSM are executed. For example, we may want to execute every transition of the EFSM. In order to find a test suite (set of input sequences) that achieves this we might first derive a set of paths through the EFSM that satisfy the criterion using, for example, algorithms from graph theory. We then attempt to produce input sequences that trigger these paths. Unfortunately, however, the EFSM might have infeasible paths and the problem of determining whether a path is feasible is generally undecidable. This paper describes an approach in which a fitness function is used to estimate how easy it is to find an input sequence to trigger a given path through an EFSM. Such a fitness function could be used in a search-based approach in which we search for a path with good fitness that achieves a test objective, such as executing a particular transition, and then search for an input sequence that triggers the path. If this second search fails then we search for another path with good fitness and repeat the process. We give a computationally inexpensive approach (fitness function) that estimates the feasibility of a path. In order to evaluate this fitness function we compared the fitness of a path with the ease with which an input sequence can be produced using search to trigger the path and we used random sampling in order to estimate this. The empirical evidence suggests that a reasonably good correlation (0.72 and 0.62) exists between the fitness of a path, produced using the proposed fitness function, and an estimate of the ease with which we can randomly generate an input sequence to trigger the path.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Similar content being viewed by others

References

  • Aho, A., Dahbura, A., Lee, D., Uyar, M.U.: An optimization technique for protocol conformance test generation based on UIO sequences and rural Chinese postman tour. IEEE Trans. Commun. 39, 1604–1615 (1991)

    Article  Google Scholar 

  • Bochmann, G.V.: Specifications of a simplified transport protocol using different formal description techniques. Comput. Netw. ISDN Syst. 18(5), 335–377 (1990)

    Article  Google Scholar 

  • Chow, T.S.: Testing software design modelled by finite state machines. IEEE Trans. Softw. Eng. 4, 178–187 (1978)

    Article  Google Scholar 

  • Derderian, K., Hierons, R.M., Harman, M., Guo, Q.: Input sequence generation for testing of communicating finite state machines CFSMs. In: LNCS, vol. 3103, pp. 1429–1430 (2004)

  • Derderian, K., Hierons, R.M., Harman, M., Guo, Q.: Automated unique input output sequence generation for conformance testing of FSMs. Comput. J. 49(3), 331–344 (2006)

    Article  Google Scholar 

  • Duale, A.Y., Uyar, M.Ü.: Generation of feasible test sequences for EFSM models. In: TestCom ’00: Proceedings of the IFIP TC6/WG6.1 13th International Conference on Testing Communicating Systems. Deventer, The Netherlands, p. 91 (2000)

  • Duale, A.Y., Uyar, M.Ü.: A method enabling feasible conformance test sequence generation for EFSM models. IEEE Trans. Comput. 53(5), 614–627 (2004)

    Article  Google Scholar 

  • Guo, Q., Hierons, R.M., Harman, M., Derderian, K.: Computing unique input/output sequences using genetic algorithms. In: Formal Approaches to Software Testing: Third International Workshop, FATES 2003. LNCS, vol. 2931, pp. 169–184 (2004)

  • Harel, D., Politi, M.: Modeling Reactive Systems with Statecharts: The STATEMATE Approach. McGraw-Hill, New York (1998)

    Google Scholar 

  • Hennie, F.C.: Fault–detecting experiments for sequential circuits. In: Proceedings of Fifth Annual Symposium on Switching Circuit Theory and Logical Design. Princeton, New Jersey, pp. 95–110 (1964)

  • Hierons, R.M., Ural, H.: Reduced length checking sequences. IEEE Trans. Comput. 51(9), 1111–1117 (2002)

    Article  MathSciNet  Google Scholar 

  • Hierons, R.M., Ural, H.: Optimizing the length of checking sequences. IEEE Trans. Comput. 55(5), 618–629 (2006)

    Article  MathSciNet  Google Scholar 

  • Hogrefe, D.: OSI formal specification case study: the Inres protocol and service. Technical Report 5, University of Bern (1991)

  • Lefticaru, R., Ipate, F.: Functional search-based testing from state machines. In: First IEEE Int. Conf. on Software Testing, Verification, and Validation, pp. 525–528 (2008)

  • Jones, B.F., Eyres, D.E., Sthamer, H.-H.: A strategy for using genetic algorithms to automate branch and fault-based testing. Comput. J. 41(2), 98–107 (1998)

    Article  Google Scholar 

  • Kalaji, A.S., Hierons, R.M., Swift, S.: Generating feasible transition paths for testing from an extended finite state machine (EFSM). In: Second IEEE International Conference on Software Testing, Verification and Validation (ICST 2009) (2008)

  • Lee, D., Yannakakis, M.: Testing finite state machines: state identification and verification. IEEE Trans. Comput. 43, 306–320 (1994)

    Article  MathSciNet  Google Scholar 

  • Lee, D., Yannakakis, M.: Principles and methods of testing finite state machines—a survey. Proc. IEEE 84, 1090–1123 (1996)

    Article  Google Scholar 

  • Michael, C.C., McGraw, G., Schatz, M.A.: Generating software test data by evolution. IEEE Trans. Softw. Eng. 27(12), 1085–1110 (2001)

    Article  Google Scholar 

  • Miller, R.E., Paul, S.: On the generation of minimal-length conformance tests for communication protocols. IEEE/ACM Trans. Netw. 1(1), 116–129 (1993)

    Article  Google Scholar 

  • Offutt, A.J., Liu, S., Abdurazik, A., Ammann, P.: Generating test data from state-based specifications. Softw. Test., Verif. Reliab. 13(1), 25–53 (2003)

    Article  Google Scholar 

  • Pargas, R.P., Harrold, M.J., Peck, R.R.: Test-data generation using genetic algorithms. Softw. Test., Verif. Reliab. 9(4), 263–282 (1999)

    Article  Google Scholar 

  • Pearson, S.W., Bailey, J.E.: Measurement of computer user satisfaction. In: Int. CMG Conference, pp. 49–58 (1979)

  • Petrenko, A., Boroday, S., Gorz, R.: Confirming configurations in EFSMs. IEEE Trans. Softw. Eng. 30(1), 29–42 (2004)

    Article  Google Scholar 

  • Ramalingom, T., Thulasiraman, K., Das, A.: Context independent unique state identification sequences for testing communication protocols modelled as extended finite state machines. Comput. Commun. 26(14), 1622–1633 (2003)

    Article  Google Scholar 

  • Shen, X., Li, G.: A new protocol conformance test generation method and experimental results. In: SAC ’92: Proceedings of the 1992 ACM/SIGAPP Symposium on Applied Computing, pp. 75–84 (1992)

  • Sidhu, D.P., Leung, T.K.: Formal methods for protocol testing: a detailed study. IEEE Trans. Softw. Eng. 15, 413–426 (1989)

    Article  Google Scholar 

  • Shen, Y., Lombardi, F., Dahbura, T.: Protocol conformance testing using multiple UIO sequences. In: IFIP WG6.1 9th Int. Symp. on Protocol Specification Testing and Verification. Amsterdam, Holland, pp. 131–144 (1989)

  • Tanenbaum, A.S.: Computer Networks, 3rd edn. Prentice Hall, Upper Saddle River (1996)

    Google Scholar 

  • Yang, B., Ural, H.: Protocol conformance test generation using multiple UIO sequences with overlapping. In: SIGCOMM ’90: Proceedings of the ACM Symposium on Communications Architectures & Protocols, pp. 118–125 (1990)

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Robert M. Hierons.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Derderian, K., Hierons, R.M., Harman, M. et al. Estimating the feasibility of transition paths in extended finite state machines. Autom Softw Eng 17, 33 (2010). https://doi.org/10.1007/s10515-009-0057-9

Download citation

  • Received:

  • Accepted:

  • Published:

  • DOI: https://doi.org/10.1007/s10515-009-0057-9

Navigation