Generating preset distinguishing sequences using SAT

Güniçen, Canan and Türker, Uraz Cengiz and Ural, Hasan and Yenigün, Hüsnü (2011) Generating preset distinguishing sequences using SAT. In: 26th International Symposium on Computer and Information Sciences (ISCIS 2011), London, UK

[thumbnail of ISCIS2011-GTUY.doc] MS Word
Restricted to Registered users only

Download (122kB) | Request a copy


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.
Item Type: Papers in Conference Proceedings
Uncontrolled Keywords: Finite state machines - Distinguishing sequences - Satisfiability problem
Subjects: Q Science > QA Mathematics > QA075 Electronic computers. Computer science
Q Science > QA Mathematics > QA076 Computer software
Divisions: Faculty of Engineering and Natural Sciences > Academic programs > Computer Science & Eng.
Faculty of Engineering and Natural Sciences
Depositing User: Hüsnü Yenigün
Date Deposited: 27 Mar 2012 15:10
Last Modified: 26 Apr 2022 09:06

Actions (login required)

View Item
View Item