scholarly journals Deteksi Serangan Denial of Service pada Internet of Things Menggunakan Finite-State Automata

2021 ◽  
Vol 21 (1) ◽  
pp. 43-52
Author(s):  
Fery Antony ◽  
Rendra Gustriansyah
Keyword(s):  
Internet Of Things ◽  
Denial Of Service ◽  
Finite State Automata ◽  
Finite State

Internet of things memiliki kemampuan untuk menghubungkan obyek pintar dan memungkinkan mereka untuk berinteraksi dengan lingkungan dan peralatan komputasi cerdas lainnya melalui jaringan internet. Namun belakangan ini, keamanan jaringan internet of things mendapat ancaman akibat serangan cyber yang dapat menembus perangkat internet of things target dengan menggunakan berbagai serangan denial of service. Penelitian ini bertujuan untuk mendeteksi dan mencegah serangan denial of service berupa synchronize flooding dan ping flooding pada jaringan internet of things dengan pendekatan finite-state automata. Hasil pengujian menunjukkan bahwa pendekatan finite-state automata berhasil mendeteksi serangan synchronize flooding dan ping flooding pada jaringan internet of things, tetapi pencegahan serangan tidak secara signifikan mengurangi penggunaan prosesor dan memori. Serangan synchronize flooding menyebabkan delay saat mengaktifkan/menonaktifkan peralatan internet of things sedangkan serangan ping flooding menyebabkan error. Implementasi bash-iptables berhasil mengurangi serangan synchronize flooding dengan efisiensi waktu pencegahan sebesar 55,37% dan mengurangi serangan ping flooding sebesar 60% tetapi dengan waktu yang tidak signifikan.

scholarly journals Desain Finite State Automata Untuk Merancang Vending Automata Logam Mulia

2021 ◽  
Vol 8 (2) ◽  
pp. 113
Author(s):  
Susanto Susanto ◽  
Venny Yulianty ◽  
Bobby Suryo Prakoso ◽  
Suwanda Suwanda ◽  
Windu Gata ◽  
...  
Keyword(s):  
Internet Of Things ◽  
Precious Metals ◽  
The Internet ◽  
Finite State Automata ◽  
Safe Haven ◽  
Vending Machines ◽  
Keywords Internet ◽  
Finite State ◽  
Modern Era ◽  
The Internet Of Things

Abstrak: Menabung logam mulia merupakan investasi yang dianggap safe haven, ditengah era modern saat ini menabung logam mulia dapat dilakukan dengan cara dicicil, sedangkan yang menjadi masalahnya adalah kekhawatiran ketika fisik logam mulia tidak dapat ditarik fisiknya yang membuat potensi fraud atau investasi bodong yang sedang marak saat ini, untuk mengatasi masalah itu penjualan logam mulia dapat dikembangkan menjadi lebih menarik dengan vending machine, untuk memperdalam pemahaman mengenai salah satu model komputasi yang mendasar dan pengenalan Internet of Things (IoT), desain vending machine ini akan menggunakan metode finite state automata (FSA). Dengan desain finite state automata, penelitian ini telah menghasilkan desain vending machine logam mulia berbasis Internet of Things (IoT) dari cara login ke vending machine sampai fisik logam mulia dapat diterima. Produk penjualan logam mulia dengan menggunakan vending machine ini diharapkan dapat menjangkau masyarakat lebih luas untuk berinvestasi, khususnya logam mulia.   Kata kunci: Internet of Things, logam mulia, vending machine   Abstract: Saving gold is an investment that is considered a safe haven, in the midst of today's modern era saving gold can be done in installments, while the problem is the concern when the physical gold cannot be physically withdrawn which creates the potential for fraud or fraudulent investments that are currently rampant. to overcome this problem the sale of precious metals can be developed to be more attractive with vending machines, to deepen understanding of one of the fundamental computing models and the introduction of the Internet of Things (IoT), this vending machine design will use the finite state automata (FSA) method. With the design of finite state automata (FSA), this research has resulted in the design of a gold vending machine based on the Internet of Things (IoT) from how to login to the vending machine until the gold is physically acceptable. The product selling gold using vending machines is expected to reach a wider audience to invest, especially gold.   Keywords: Internet of Things, precious metals, vending machine

Characterizations of rough finite state automata

2015 ◽  
Vol 8 (3) ◽  
pp. 721-730 ◽  
Author(s):  
Shambhu Sharan ◽  
Arun K. Srivastava ◽  
S. P. Tiwari
Keyword(s):  
Finite State Automata ◽  
Finite State

scholarly journals Copyful Streaming String Transducers

2021 ◽  
Vol 178 (1-2) ◽  
pp. 59-76
Author(s):  
Emmanuel Filiot ◽  
Pierre-Alain Reynier
Keyword(s):  
Polynomial Time ◽  
Equivalence Problem ◽  
Expressive Power ◽  
The Other ◽  
Finite State Automata ◽  
Finite State ◽  
Variable Content ◽  
Deterministic Automata ◽  
Intermediate Output ◽  
Linear Manner

Copyless streaming string transducers (copyless SST) have been introduced by R. Alur and P. Černý in 2010 as a one-way deterministic automata model to define transductions of finite strings. Copyless SST extend deterministic finite state automata with a set of variables in which to store intermediate output strings, and those variables can be combined and updated all along the run, in a linear manner, i.e., no variable content can be copied on transitions. It is known that copyless SST capture exactly the class of MSO-definable string-to-string transductions, and are as expressive as deterministic two-way transducers. They enjoy good algorithmic properties. Most notably, they have decidable equivalence problem (in PSpace). On the other hand, HDT0L systems have been introduced for a while, the most prominent result being the decidability of the equivalence problem. In this paper, we propose a semantics of HDT0L systems in terms of transductions, and use it to study the class of deterministic copyful SST. Our contributions are as follows: (i)HDT0L systems and total deterministic copyful SST have the same expressive power, (ii)the equivalence problem for deterministic copyful SST and the equivalence problem for HDT0L systems are inter-reducible, in quadratic time. As a consequence, equivalence of deterministic SST is decidable, (iii)the functionality of non-deterministic copyful SST is decidable, (iv)determining whether a non-deterministic copyful SST can be transformed into an equivalent non-deterministic copyless SST is decidable in polynomial time.

Sign in / Sign up

Export Citation Format

Share Document