Skip to main content
SpringerLink
Log in

Generating Minimum Height ADSs for Partially Specified Finite State Machines

  • Conference paper
  • First Online:
Information Sciences and Systems 2015

Part of the book series: Lecture Notes in Electrical Engineering ((LNEE,volume 363))

  • 650 Accesses

Abstract

In earlier work, the problem of generating a preset distinguishing sequence from a finite state machine (FSM) was converted into a Boolean formulae to be fed into a SAT solver, with experiments suggesting that such approaches are required as the size of input alphabet grows. In this paper we extend the approach to the minimum height adaptive distinguishing sequence construction problem for partially specified FSMs (PSFMSs), which is known to be an NP-Hard problem. The results of experiments with randomly generated PSFSMs and case studies from the literature show that SAT solvers can perform better than a previously proposed brute-force algorithm.

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 129.00
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 169.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info
Hardcover Book
USD 169.99
Price excludes VAT (USA)
  • Durable hardcover 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

Notes

  1. 1.

    While the upper bound on PDS length is exponential, test generation takes polynomial time if there is a known PDS.

References

  1. Friedman, A.D., Menon, P.R.: Fault Detection in Digital Circuits. Computer Applications in Electrical Engineering Series. Prentice-Hall (1971)

    Google Scholar 

  2. Aho, A.V., Sethi, R., Ullman, J.D.: Compilers: Principles, Techniques, and Tools. Addison-Wesley (1986)

    Google Scholar 

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

    Google Scholar 

  4. Holzmann, G.J.: Design and Validation of Computer Protocols. Prentice Hall (1991)

    Google Scholar 

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

    Google Scholar 

  6. Sabnani, K., Dahbura, A.: A protocol test generation procedure. Comput. Netw. 15(4), 285–297 (1988)

    Google Scholar 

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

    Google Scholar 

  8. Haydar, M., Petrenko, A., Sahraoui, H.: Formal verification of web applications modeled by communicating automata. In: Formal Techniques for Networked and Distributed Systems—FORTE 2004, vol. 3235, pp. 115–132. Springer (2004)

    Google Scholar 

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

    Article  MathSciNet  Google Scholar 

  10. Ural, Hasan: Formal methods for test sequence generation. Comput. Commun. 15(5), 311–325 (1992)

    Article  Google Scholar 

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

    Google Scholar 

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

    Google Scholar 

  13. Yannakakis, M., Lee, D.: Testing finite state machines: Fault detection. J. Comput. Syst. Sci. 50(2), 209–227 (1995)

    Article  MathSciNet  Google Scholar 

  14. Yevtushenko, N., Petrenko, A.: Synthesis of test experiments in some classes of automata. Autom. Control Comput. Sci. 4 (1990)

    Google Scholar 

  15. Petrenko, Alexandre, Yevtushenko, Nina: Testing from partial deterministic FSM specifications. IEEE Trans. Comput. 54(9), 1154–1165 (2005)

    Article  MATH  Google Scholar 

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

    Google Scholar 

  17. da Silva Simão, A., Petrenko, A.: Generating checking sequences for partial reduced finite state machines. Test. Softw. Commun. Syst. 153–168 (2008)

    Google Scholar 

  18. Hierons, R.M., Türker, U.C.: Distinguishing sequences for partially specified FSMs. In: NASA Formal Methods—6th International Symposium, NFM 2014, Houston, TX, USA, April 29 - May 1, 2014. Proceedings, pp. 62–76 (2014)

    Google Scholar 

  19. Türker, U.C., Yenigün, H.: Hardness and inapproximability of minimizing adaptive distinguishing sequences. Formal Methods Syst. Des. 44(3), 264–294 (2014)

    Article  Google Scholar 

  20. 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—26th International Symposium on Computer and Information Sciences, London, UK, 26–28 September 2011, pp. 487–493 (2011)

    Google Scholar 

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

    Google Scholar 

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

  23. Türker, U.C., Ünlüyurt, T., Yenigün, H.: Lookahead-Based Approaches for Minimizing Adaptive Distinguishing Sequences. In: Testing Software and Systems—26th IFIP WG 6.1 International Conference, ICTSS 2014, Madrid, Spain, September 23–25, 2014. Proceedings, pp. 32–47 (2014)

    Google Scholar 

Download references

Acknowledgments

This research is sported by The Scientific and Technological Research Council of Turkey under the grant reference no B.14.2.TBT.0.06.01-219-115543.

Author information

Authors and Affiliations

  1. Department of Computer Science, Brunel University, Uxbridge, Middlesex, UK

    Robert M. Hierons & 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

Corresponding author

Correspondence to Uraz Cengiz Türker .

Editor information

Editors and Affiliations

  1. Department of Electrical, Imperial College, London, United Kingdom

    Omer H. Abdelrahman

  2. Department of Electrical and Electronic Engineering, Imperial College, London, United Kingdom

    Erol Gelenbe

  3. Department of Electrical and Electronic Engineering, Imperial College, London, United Kingdom

    Gokce Gorbil

  4. Department of Engineering Technology, University of Houston, Houston, Texas, USA

    Ricardo Lent

Rights and permissions

Reprints and permissions

Copyright information

© 2016 Springer International Publishing Switzerland

About this paper

Cite this paper

Hierons, R.M., Türker, U.C. (2016). Generating Minimum Height ADSs for Partially Specified Finite State Machines. In: Abdelrahman, O., Gelenbe, E., Gorbil, G., Lent, R. (eds) Information Sciences and Systems 2015. Lecture Notes in Electrical Engineering, vol 363. Springer, Cham. https://doi.org/10.1007/978-3-319-22635-4_15

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-22635-4_15

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-319-22634-7

  • Online ISBN: 978-3-319-22635-4

  • eBook Packages: EngineeringEngineering (R0)

Publish with us

Policies and ethics

Search

Navigation