Skip to main content
SpringerLink
Log in

Generating Preset Distinguishing Sequences Using SAT

  • Conference paper
  • First Online:
Computer and Information Sciences II

Abstract

The preset distinguishing sequence generation problem is converted into a SAT problem to investigate the performance of SAT solvers for generating preset distinguishing sequences. An initial set of experiments are carried out and it is shown that the heuristics of SAT solvers can perform better than brute force algorithms that are used to generate preset distinguishing sequences.

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

References

  1. Friedman, A.D., Menon, P.R.: Fault Detection in Digital Circuits. Prentice Hall, Englewood Cliffs (1971)

    Google Scholar 

  2. Aho, A.V., Sethi, R., Ullman, J.D.: Compilers: principles, techniques, and tools. In: Reading. Addison-Wesley, MJ (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)

    Article  Google Scholar 

  4. Holzmann, G.J.: Design and Validation of Protocols. Prentice Hall, Englewood Cliffs (1990)

    Google Scholar 

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

    Google Scholar 

  6. 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). Springer Lecture Notes in Computer Science, vol. 3235, pp. 115–132. Springer Berlin/Heidelberg, September 2004

    Google Scholar 

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

  8. Hierons, R.M., Ural, H.: Reduced Length Checking Sequences. IEEE Trans. Comput. 51(9), 1111–1117 (2002)

    Article  MathSciNet  Google Scholar 

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

    Article  MathSciNet  Google Scholar 

  10. Gonenc, G.: A method for the design of fault detection experiments. IEEE Trans. Comput. 19, 551–558 (1970)

    Article  Google Scholar 

  11. Moore, E.P.: Gedanken experiments on sequential machines. In: Shannon, C., McCarthy, J. (eds.) Automata Studies. Princeton University Press, Princeton (1956)

    Google Scholar 

  12. Lee, D., Yannakakis, M.: Testing finite-state machines: state identification and verification. IEEE Trans. Comput. 43(3), 306–320 (1994). doi:10.1109/12.272431

    Article  MathSciNet  Google Scholar 

  13. Gill, A.: Introduction to the Theory of Finite State Machines. McGraw Hill, NY (1962)

    MATH  Google Scholar 

  14. Kohavi, Z.: Switching and Finite Automata Theory. McGraw Hill, NY (1978)

    MATH  Google Scholar 

  15. Cook, S.A.: The complexity of theorem proving procedures. In: Proceedings of 3rd Annual ACM Symposium on Theory of Computing, pp. 151–158. ACM, NY (1971)

    Google Scholar 

Download references

Acknowledgments

This work was supported in part by the Natural Sciences and Engineering Research Council of Canada, and the Ontario Centres of Excellence, and by Sabanci University.

Author information

Authors and Affiliations

  1. Computer Science and Engineering, FENS, Sabanc? University Orhanl? Tuzla, 34956, Istanbul, Turkey

    Canan Güniçen, Uraz Cengiz Türker & Hüsnü Yenigün

  2. SITE, University of Ottawa, 800 King Edward Avenue, Ottawa, ON, K1N 6N5, Canada

    Hasan Ural

Authors
  1. Canan Güniçen
    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

  3. Hasan Ural
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. Hüsnü Yenigün
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Hasan Ural .

Editor information

Editors and Affiliations

  1. , Dept of Electrical and Electronics Eng'g, Imperial College, London, SW7 2BT, United Kingdom

    Erol Gelenbe

  2. Imperial College, London, United Kingdom

    Ricardo Lent

  3. University of East London, London, United Kingdom

    Georgia Sakellari

Rights and permissions

Reprints and permissions

Copyright information

© 2011 Springer-Verlag London Limited

About this paper

Cite this paper

Güniçen, C., Türker, U.C., Ural, H., Yenigün, H. (2011). Generating Preset Distinguishing Sequences Using SAT. In: Gelenbe, E., Lent, R., Sakellari, G. (eds) Computer and Information Sciences II. Springer, London. https://doi.org/10.1007/978-1-4471-2155-8_62

Download citation

  • DOI: https://doi.org/10.1007/978-1-4471-2155-8_62

  • Published:

  • Publisher Name: Springer, London

  • Print ISBN: 978-1-4471-2154-1

  • Online ISBN: 978-1-4471-2155-8

  • eBook Packages: EngineeringEngineering (R0)

Publish with us

Policies and ethics

Search

Navigation