Disturbance Decoupling in Finite Automata

Disturbance decoupling problem in finite automata: Sensor location problem

2016 IEEE Conference on Control Applications (CCA) ◽

10.1109/cca.2016.7587876 ◽

2016 ◽

Author(s):

Arvo Kaldmae ◽

Ulle Kotta ◽

Alexey Shumsky ◽

Alexey Zhirabok

Keyword(s):

Location Problem ◽

Finite Automata ◽

Sensor Location ◽

Disturbance Decoupling

Download Full-text

A novel cryptosystem based on abstract automata and Latin cubes

Studia Scientiarum Mathematicarum Hungarica ◽

10.1556/012.2015.52.2.1309 ◽

2015 ◽

Vol 52 (2) ◽

pp. 221-232

Author(s):

Pál Dömösi ◽

Géza Horváth

Keyword(s):

Block Cipher ◽

Finite Automata ◽

Theoretical Background ◽

Point Of View ◽

Theoretical Point ◽

Transition Matrices ◽

Encryption And Decryption ◽

Secret Keys ◽

Automata Network ◽

Fully Functioning

In this paper we introduce a novel block cipher based on the composition of abstract finite automata and Latin cubes. For information encryption and decryption the apparatus uses the same secret keys, which consist of key-automata based on composition of abstract finite automata such that the transition matrices of the component automata form Latin cubes. The aim of the paper is to show the essence of our algorithms not only for specialists working in compositions of abstract automata but also for all researchers interested in cryptosystems. Therefore, automata theoretical background of our results is not emphasized. The introduced cryptosystem is important also from a theoretical point of view, because it is the first fully functioning block cipher based on automata network.

Download Full-text

Global Stabilization with Almost Disturbance Decoupling of Single-Input-Single-Output Uncertain Nonlinear Systems using Output Feedback

1991 American Control Conference ◽

10.23919/acc.1991.4791701 ◽

1991 ◽

Author(s):

Ali Saberi ◽

Zongli Lin

Keyword(s):

Nonlinear Systems ◽

Output Feedback ◽

Global Stabilization ◽

Uncertain Nonlinear Systems ◽

Single Input Single Output ◽

Single Output ◽

Almost Disturbance Decoupling ◽

Disturbance Decoupling ◽

Single Input

Download Full-text

Disturbance decoupling in linear systems via dynamical compensators — A parametric eigenstructure assignment approach

1999 European Control Conference (ECC) ◽

10.23919/ecc.1999.7099577 ◽

1999 ◽

Cited By ~ 1

Author(s):

G. R. Duan ◽

G. W. Irwin ◽

G. P. Liu

Keyword(s):

Linear Systems ◽

Eigenstructure Assignment ◽

Disturbance Decoupling ◽

Assignment Approach

Download Full-text

Disturbance decoupling problem with stability for LPV systems

2003 European Control Conference (ECC) ◽

10.23919/ecc.2003.7085014 ◽

2003 ◽

Cited By ~ 4

Author(s):

G. Stikkel ◽

J. Bokor ◽

Z. Szabo

Keyword(s):

Disturbance Decoupling ◽

Lpv Systems

Download Full-text

Parallel Combining Different Approaches to Multi-pattern Matching for Fpga-based Security Systems

Advances in Cyber-Physical Systems ◽

10.23939/acps2020.01.008 ◽

2017 ◽

Vol 5 (1) ◽

pp. 8-15

Author(s):

Sergii Hilgurt ◽

Keyword(s):

Information Security ◽

Pattern Matching ◽

Intrusion Detection System ◽

Detection System ◽

Finite Automata ◽

Network Intrusion Detection ◽

Security Systems ◽

Analytical Technique ◽

Network Intrusion ◽

Pros And Cons

The multi-pattern matching is a fundamental technique found in applications like a network intrusion detection system, anti-virus, anti-worms and other signature- based information security tools. Due to rising traffic rates, increasing number and sophistication of attacks and the collapse of Moore’s law, traditional software solutions can no longer keep up. Therefore, hardware approaches are frequently being used by developers to accelerate pattern matching. Reconfigurable FPGA-based devices, providing the flexibility of software and the near-ASIC performance, have become increasingly popular for this purpose. Hence, increasing the efficiency of reconfigurable information security tools is a scientific issue now. Many different approaches to constructing hardware matching circuits on FPGAs are known. The most widely used of them are based on discrete comparators, hash-functions and finite automata. Each approach possesses its own pros and cons. None of them still became the leading one. In this paper, a method to combine several different approaches to enforce their advantages has been developed. An analytical technique to quickly advance estimate the resource costs of each matching scheme without need to compile FPGA project has been proposed. It allows to apply optimization procedures to near-optimally split the set of pattern between different approaches in acceptable time.

Download Full-text