Skip to main content

Input Sequence Generation for Testing of Communicating Finite State Machines (CFSMs)

  • Conference paper
Genetic and Evolutionary Computation – GECCO 2004 (GECCO 2004)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 3103))

Included in the following conference series:

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.

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

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Similar content being viewed by others

References

  1. Tanenbaum, A.: Computer Networks, 3rd edn. Prentice-Hall, Englewood Cliffs (1996)

    Google Scholar 

  2. Beizer, B.: Software testing techniques. 2nd edn., Technical report (1990)

    Google Scholar 

  3. Petrenko, A., Yavtushenko, N., Dssouli, R.: Testing strategies for communicating fsms. Protocol Test Systems, 195–208 (November 1995)

    Google Scholar 

  4. 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)

    Google Scholar 

  5. 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)

    Chapter  Google Scholar 

  6. Goldderg, D.E.: Genetic Algorithms in search, optimisation and machine learning. Addison-Wesley Publishing Company, Reading (1989)

    Google Scholar 

  7. 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)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints 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

Publish with us

Policies and ethics