Parallel brute-force algorithm for deriving reset sequences from deterministic incomplete finite automata

Uraz Cengiz TÜRKER

Makale detayları

Parallel brute-force algorithm for deriving reset sequences from deterministic incomplete finite automata

Yazarlar:

Uraz Cengiz TÜRKER

Yayıncı:

TUBITAK

Dergi:

Turkish Journal of Electrical Engineering and Computer Science 2019 Vol.27 Issue 5, pp.3544-3556

Belge Tipi:

Makale

Yayın Tarihi:

9/2019

Belge Dili:

İngilizce

Document ID (Org No.):

2000733635

Sıklık:

İki Aylık

eISSN:

1303-6203

pISSN:

1300-0632

Özet:

 

A reset sequence (RS) for a deterministic finite automaton AA\mathscr{A} is an input sequence that brings AA\mathscr{A} to a particular   state regardless of the initial state of AA\mathscr{A}.   Incomplete finite automata (FA) are strong in modeling reactive systems,   but despite their importance,   there are no works published for   deriving RSs from FA.   This paper proposes a massively parallel algorithm   to derive short RSs from FA.    Experimental results reveal that    the proposed parallel algorithm   can construct RSs from FA with 16,000,000 states.    When multiple GPUs are added to the system the approach can handle larger FA.

Makale detayları

Parallel brute-force algorithm for deriving reset sequences from deterministic incomplete finite automata

Yazarlar: Uraz Cengiz TÜRKER

Yayıncı: TUBITAK

Dergi: Turkish Journal of Electrical Engineering and Computer Science 2019 Vol.27 Issue 5, pp.3544-3556

Belge Tipi: Makale

Yayın Tarihi: 9/2019

Belge Dili: İngilizce

Document ID (Org No.): 2000733635

Sıklık: İki Aylık

eISSN: 1303-6203

pISSN: 1300-0632

Sayı

Yazarlar:

Uraz Cengiz TÜRKER

Yayıncı:

TUBITAK

Dergi:

Turkish Journal of Electrical Engineering and Computer Science 2019 Vol.27 Issue 5, pp.3544-3556

Belge Tipi:

Makale

Yayın Tarihi:

9/2019

Belge Dili:

İngilizce

Document ID (Org No.):

2000733635

Sıklık:

İki Aylık

eISSN:

1303-6203

pISSN:

1300-0632