Abstract
Finite State Machines (FSMs) have been used to model systems in different areas like sequential circuits, software development and communication protocols [1]. FSMs have been an effective method of modelling because a variety of techniques and automated tools exist that work with them.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Similar content being viewed by others
References
Tanenbaum, A.: Computer Networks, 3rd edn. Prentice-Hall, Englewood Cliffs (1996)
Beizer, B.: Software testing techniques. 2nd edn., Technical report (1990)
Petrenko, A., Yavtushenko, N., Dssouli, R.: Testing strategies for communicating fsms. Protocol Test Systems, 195–208 (November 1995)
Hierons, R.: Checking states and transitions of a set of communicating finite state machines. Microprocessors and Microsystems,Special Issue on Testing and testing techniques for real-time embedded software systems 24, 443–452 (2001)
Guo, Q., Hierons, R., Harman, M., Derderian, K.: Computing unique input/output sequences using genetic algorithms. In: Petrenko, A., Ulrich, A. (eds.) FATES 2003. LNCS, vol. 2931, pp. 169–184. Springer, Heidelberg (2004)
Goldderg, D.E.: Genetic Algorithms in search, optimisation and machine learning. Addison-Wesley Publishing Company, Reading (1989)
Derderian, K., Hierons, R., Harman, M., Guo, Q.: Generating unique input output sequences for finite state machine testing using genetic algorithms. IEE Electronics Letters (Under consideration) (2004)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2004 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Derderian, K., Hierons, R.M., Harman, M., Guo, Q. (2004). Input Sequence Generation for Testing of Communicating Finite State Machines (CFSMs). In: Deb, K. (eds) Genetic and Evolutionary Computation – GECCO 2004. GECCO 2004. Lecture Notes in Computer Science, vol 3103. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-24855-2_164
Download citation
DOI: https://doi.org/10.1007/978-3-540-24855-2_164
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-22343-6
Online ISBN: 978-3-540-24855-2
eBook Packages: Springer Book Archive