Skip to main content
SpringerLink
Log in

Distinguishing Sequences for Partially Specified FSMs

  • Conference paper
NASA Formal Methods (NFM 2014)

Part of the book series: Lecture Notes in Computer Science ((LNPSE,volume 8430))

Included in the following conference series:

Abstract

Distinguishing Sequences (DSs) are used inmany Finite State Machine (FSM) based test techniques. Although Partially Specified FSMs (PSFSMs) generalise FSMs, the computational complexity of constructing Adaptive and Preset DSs (ADSs/PDSs) for PSFSMs has not been addressed. This paper shows that it is possible to check the existence of an ADS in polynomial time but the corresponding problem for PDSs is PSPACE-complete. We also report on the results of experiments with benchmarks and over 8 ∗ 106 PSFSMs.

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

Access this chapter

Log in via an institution
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

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Friedman, A.D., Menon, P.R.: Fault detection in digital circuits. Computer Applications in Electrical Engineering Series (1971)

    Google Scholar 

  2. Aho, A.V., Sethi, R., Ullman, J.D.: Compilers, principles, techniques, and tools. Addison-Wesley series in computer science

    Google Scholar 

  3. Chow, T.S.: Testing software design modelled by finite state machines. IEEE Transactions on Software Engineering 4, 178–187 (1978)

    Article  MATH  Google Scholar 

  4. Holzmann, G.J.: Design and validation of computer protocols. Prentice-Hall software series

    Google Scholar 

  5. Brinksma, E.: A theory for the derivation of tests. In: Proceedings of Protocol Specification, Testing, and Verification VIII, pp. 63–74. North-Holland, Atlantic City (1988)

    Google Scholar 

  6. Dahbura, A.T., Sabnani, K.K., Uyar, M.U.: Formal methods for generating protocol conformance test sequences. Proceedings of the IEEE 78(8), 1317–1326 (August)

    Google Scholar 

  7. Lee, D., Sabnani, K.K., Kristol, D.M., Paul, S.: Conformance testing of protocols specified as communicating finite state machines-a guided random walk based approach. IEEE Transactions on Communications 44(5), 631–640 (May)

    Google Scholar 

  8. Lee, D., Yannakakis, M.: Principles and methods of testing finite-state machines - a survey. Proceedings of the IEEE 84(8), 1089–1123 (1996)

    Article  Google Scholar 

  9. Low, S.H.: Probabilistic conformance testing of protocols with unobservable transitions. In: Proceedings of the 1993 International Conference on Network Protocols, pp. 368–375 (October 1993)

    Google Scholar 

  10. Mihail, M., Papadimitriou, C.H.: On the random walk method for protocol testing. In: Dill, D.L. (ed.) CAV 1994. LNCS, vol. 818, pp. 132–141. Springer, Heidelberg (1994)

    Chapter  Google Scholar 

  11. Sabnani, K., Dahbura, A.: A protocol test generation procedure. Computer Networks 15(4), 285–297 (1988)

    Article  Google Scholar 

  12. Sidhu, D.P., Leung, T.-K.: Formal methods for protocol testing: A detailed study. IEEE Transactions on Software Engineering 15(4), 413–426 (1989)

    Article  Google Scholar 

  13. Binder, R.V.: Testing Object-Oriented Systems: Models, Patterns, and Tools. Addison-Wesley (1999)

    Google Scholar 

  14. Haydar, M., Petrenko, A., Sahraoui, H.A.: Formal verification of web applications modeled by communicating automata. In: de Frutos-Escrig, D., Núñez, M. (eds.) FORTE 2004. LNCS, vol. 3235, pp. 115–132. Springer, Heidelberg (2004)

    Chapter  Google Scholar 

  15. Betin-Can, A., Bultan, T.: Verifiable concurrent programming using concurrency controllers. In: Proceedings of the 19th IEEE International Conference on Automated Software Engineering, pp. 248–257. IEEE Computer Society (2004)

    Google Scholar 

  16. Pomeranz, I., Reddy, S.M.: Test generation for multiple state-table faults in finite-state machines. IEEE Transactions on Computers 46(7), 783–794 (1997)

    Article  Google Scholar 

  17. Utting, M., Pretschner, A., Legeard, B.: A taxonomy of model-based testing approaches. Software Testing, Verification and Reliability 22(5), 297–312 (2012)

    Article  Google Scholar 

  18. Grieskamp, W., Kicillof, N., Stobie, K., Braberman, V.A.: Model-based quality assurance of protocol documentation: Tools and methodology. Software Testing, Verification and Reliability 21(1), 55–71 (2011)

    Article  Google Scholar 

  19. Aho, A.V., Dahbura, A.T., Lee, D., Uyar, M.U.: An optimization technique for protocol conformance test generation based on UIO sequences and rural chinese postman tours. In: Protocol Specification, Testing, and Verification VIII, Atlantic City, pp. 75–86. Elsevier, North-Holland (1988)

    Google Scholar 

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

    Google Scholar 

  21. Gonenc, G.: A method for the design of fault detection experiments. IEEE Transactions on Computers 19, 551–558 (1970)

    Article  Google Scholar 

  22. Vasilevskii, M.P.: Failure diagnosis of automata. Cybernetics and Systems Analysis 9, 653–665

    Google Scholar 

  23. Vuong, S.T., Chan, W.W.L., Ito, M.R.: The UIOv-method for protocol test sequence generation. In: The 2nd International Workshop on Protocol Test Systems, Berlin (1989)

    Google Scholar 

  24. Fujiwara, S., von Bochmann, G., Khendek, F., Amalou, M., Ghedamsi, A.: Test selection based on finite state models. IEEE Transactions on Software Engineering 17(6), 591–603 (1991)

    Article  Google Scholar 

  25. Ural, H., Zhu, K.: Optimal length test sequence generation using distinguishing sequences. IEEE/ACM Transactions on Networking 1(3), 358–371 (1993)

    Article  Google Scholar 

  26. Petrenko, A., Yevtushenko, N.: Testing from partial deterministic FSM specifications. IEEE Transactions on Computers 54(9), 1154–1165 (2005)

    Article  Google Scholar 

  27. von Bochmann, G., Petrenko, A.: Protocol testing: Review of methods and relevance for software testing. In: ACM International Symposium on Software Testing and Analysis, Seattle USA, pp. 109–123 (1994)

    Google Scholar 

  28. Lai, R.: A survey of communication protocol testing. Journal of Systems and Software 62(1), 21–46 (2002)

    Article  Google Scholar 

  29. Kohavi, Z.: Switching and Finite State Automata Theory. McGraw-Hill, New York (1978)

    Google Scholar 

  30. Moore, E.P.: Gedanken-experiments. In: Shannon, C., McCarthy, J. (eds.) Automata Studies. Princeton University Press (1956)

    Google Scholar 

  31. Boute, R.T.: Distinguishing sets for optimal state identification in checking experiments. IEEE Trans. Comput. 23, 874–877 (1974)

    Article  Google Scholar 

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

    Article  Google Scholar 

  33. Jourdan, G.-V., Ural, H., Yenigun, H., Zhang, J.: Lower bounds on lengths of checking sequences. Formal Aspects of Computing 22(6), 667–679 (2010)

    Article  MATH  Google Scholar 

  34. Lee, D., Yannakakis, M.: Testing finite-state machines: State identification and verification. IEEE Trans. on Computers 43(3), 306–320 (1994)

    Article  MathSciNet  Google Scholar 

  35. da Silva Simão, A., Petrenko, A.: Checking completeness of tests for finite state machines. IEEE Transactions on Computers 59(8), 1023–1032 (2010)

    Article  Google Scholar 

  36. da Silva Simão, A., Petrenko, A., Yevtushenko, N.: On reducing test length for FSMs with extra states. Software Testing, Verification and Reliability 22(6), 435–454 (2012)

    Article  Google Scholar 

  37. Hierons, R.M., Jourdan, G.-V., Ural, H., Yenigun, H.: Checking sequence construction using adaptive and preset distinguishing sequences. In: SEFM, pp. 157–166 (2009)

    Google Scholar 

  38. Ural, H.: Formal methods for test sequence generation. Computer Communications 15(5), 311–325 (1992)

    Article  Google Scholar 

  39. da Silva Simão, A., Petrenko, A.: Generating checking sequences for partial reduced finite state machines. Testing of Software and Communicating Systems, 153–168 (2008)

    Google Scholar 

  40. Tsai, P.-C., Wang, S.-J., Chang, F.-M.: FSM-based programmable memory bist with macro command. In: 2005 IEEE International Workshop on Memory Technology, Design, and Testing, MTDT 2005, pp. 72–77 (August 2005)

    Google Scholar 

  41. Zarrineh, K., Upadhyaya, S.J.: Programmable memory bist and a new synthesis framework. In: Twenty-Ninth Annual International Symposium on Fault-Tolerant Computing. Digest of Papers, pp. 352–355 (June 1999)

    Google Scholar 

  42. Xie, L., Wei, J., Zhu, G.: An improved FSM-based method for BGP protocol conformance testing. In: International Conference on Communications, Circuits and Systems, pp. 557–561 (2008)

    Google Scholar 

  43. Drumea, A., Popescu, C.: Finite state machines and their applications in software for industrial control. In: 27th Int. Spring Seminar on Electronics Technology: Meeting the Challenges of Electronics Technology Progress, vol. 1, pp. 25–29 (2004)

    Google Scholar 

  44. Petrenko, A., Yevtushenko, N.: Testing from partial deterministic FSM specifications. IEEE Transactions on Computers 54(9), 1154–1165 (2005)

    Article  Google Scholar 

  45. Yannakakis, M., Lee, D.: Testing finite state machines: Fault detection. Journal of Computer and System Sciences 50(2), 209–227 (1995)

    Article  MATH  MathSciNet  Google Scholar 

  46. Yevtushenko, N., Petrenko, A.: Synthesis of test experiments in some classes of automata. Automatic Control and Computer Sciences 4 (1990)

    Google Scholar 

  47. Gill, A.: Introduction to The Theory of Finite State Machines. McGraw-Hill, New York (1962)

    MATH  Google Scholar 

  48. Rho, J.-K., Hachtel, G., Somenzi, F.: Don’t care sequences and the optimization of interacting finite state machines. In: IEEE International Conference on Computer-Aided Design, ICCAD 1991. Digest of Technical Papers, pp. 418–421 (November 1991)

    Google Scholar 

  49. Sokolovskii, M.N.: Diagnostic experiments with automata. Kibernetica (6), 44–49 (1971)

    Google Scholar 

  50. Savitch, W.J.: Relationships between nondeterministic and deterministic tape complexities. Journal of Computer and System Sciences 4(2), 177–192 (1970)

    Article  MATH  MathSciNet  Google Scholar 

  51. Güniçen, C., Türker, U.C., Ural, H., Yenigün, H.: Generating preset distinguishing sequences using sat. In: Computer and Information Sciences II, pp. 487–493. Springer (2012)

    Google Scholar 

  52. Brglez, F.: ACM/SIGMOD benchmark dataset, http://cbl.ncsu.edu:16080/benchmarks/Benchmarks-upto-1996.html

Download references

Author information

Authors and Affiliations

  1. School of Information Systems, Computing and Mathematics, Brunel University, Uxbridge, Middlesex, UK

    Robert M. Hierons

  2. Sabancı Üniversitesi Orta Mahalle, Üniversite Caddesi No: 27, Tuzla, 34956, Istanbul, Turkey

    Uraz Cengiz Türker

Authors
  1. Robert M. Hierons
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Uraz Cengiz Türker
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. NASA, 2101 NASA Parkway, M/C ER4, 77058, Houston, TX, USA

    Julia M. Badger

  2. Intelligent Systems Division, NASA Ames Research Center, 94035, Moffett Field, CA, USA

    Kristin Yvonne Rozier

Rights and permissions

Reprints and permissions

Copyright information

© 2014 Springer International Publishing Switzerland

About this paper

Cite this paper

Hierons, R.M., Türker, U.C. (2014). Distinguishing Sequences for Partially Specified FSMs. In: Badger, J.M., Rozier, K.Y. (eds) NASA Formal Methods. NFM 2014. Lecture Notes in Computer Science, vol 8430. Springer, Cham. https://doi.org/10.1007/978-3-319-06200-6_5

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-06200-6_5

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-319-06199-3

  • Online ISBN: 978-3-319-06200-6

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation