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

MS Word - Registered users only
119Kb

Official URL: http://dx.doi.org/10.1007/978-1-4471-2155-8_62

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.

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
ID Code:	18901
Deposited By:	Hüsnü Yenigün
Deposited On:	27 Mar 2012 15:10
Last Modified:	27 Mar 2012 15:10

Repository Staff Only: item control page