Generating Preset Distinguishing Sequences Using SAT

  • Canan Güniçen
  • Uraz Cengiz Türker
  • Hasan Ural
  • Hüsnü Yenigün
Conference paper

DOI: 10.1007/978-1-4471-2155-8_62

Cite this paper as:
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

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.

Keywords

Finite state machines Distinguishing sequences Satisfiability problem 

Copyright information

© Springer-Verlag London Limited  2011

Authors and Affiliations

  • Canan Güniçen
    • 1
  • Uraz Cengiz Türker
    • 1
  • Hasan Ural
    • 2
  • Hüsnü Yenigün
    • 1
  1. 1.Computer Science and Engineering, FENSSabanc? University Orhanl? TuzlaIstanbulTurkey
  2. 2.SITEUniversity of OttawaOttawaCanada

Personalised recommendations