Modeling and analysis of networked finite state machine subject to random communication losses
In networked control systems, channel packet loss is inevitable due to the restricted bandwidth, especially in control (from supervisory controller to some remote actuators), which will lead to the occurrence of failure control. In this paper, the controllability of networked finite state machine (&...
Main Authors: | , , |
---|---|
Format: | Article |
Language: | English |
Published: |
AIMS Press
2023-02-01
|
Series: | Mathematical Modelling and Control |
Subjects: | |
Online Access: | https://www.aimspress.com/article/doi/10.3934/mmc.2023005?viewType=HTML |
_version_ | 1797826906849017856 |
---|---|
author | Weiwei Han Zhipeng Zhang Chengyi Xia |
author_facet | Weiwei Han Zhipeng Zhang Chengyi Xia |
author_sort | Weiwei Han |
collection | DOAJ |
description | In networked control systems, channel packet loss is inevitable due to the restricted bandwidth, especially in control (from supervisory controller to some remote actuators), which will lead to the occurrence of failure control. In this paper, the controllability of networked finite state machine (<italic>NFSM</italic>) is investigated within the framework of matrix semi-tensor product (<italic>STP</italic>), where random channel packet losses are considered. Firstly, to capture the transition dynamics under random packet losses in the control channel, we introduce a stochastic variable to estimate the state evolution, and the variable is assumed to obey the Bernoulli binary distribution. Meanwhile, the <italic>NFSM</italic> with random channel packet losses can be expressed as a probabilistic logic representation. Subsequently, by means of the delicate operation of matrix <italic>STP</italic>, some concise validation conditions for the controllability with a probability of one ($ w.p. $ 1), are derived for <italic>NFSM</italic> based on the probabilistic logic representation. Finally, a typical computing instance is used to demonstrate the validity of the proposed method. The conclusions are conducive to study the security issues of the system involving opacity, fault detection, controller design and so on. |
first_indexed | 2024-04-09T12:39:48Z |
format | Article |
id | doaj.art-6c6b7ed6c75f46e196f5fe57e7a665c1 |
institution | Directory Open Access Journal |
issn | 2767-8946 |
language | English |
last_indexed | 2024-04-09T12:39:48Z |
publishDate | 2023-02-01 |
publisher | AIMS Press |
record_format | Article |
series | Mathematical Modelling and Control |
spelling | doaj.art-6c6b7ed6c75f46e196f5fe57e7a665c12023-05-15T01:14:24ZengAIMS PressMathematical Modelling and Control2767-89462023-02-0131506010.3934/mmc.2023005Modeling and analysis of networked finite state machine subject to random communication lossesWeiwei Han 0Zhipeng Zhang 1Chengyi Xia21. Tianjin Key Laboratory of Intelligence Computing and Novel Software Technology, Tianjin University of Technology, Tianjin, 300384, China2. School of Artificial Intelligence, Tiangong University, Tianjin, 300387, China2. School of Artificial Intelligence, Tiangong University, Tianjin, 300387, ChinaIn networked control systems, channel packet loss is inevitable due to the restricted bandwidth, especially in control (from supervisory controller to some remote actuators), which will lead to the occurrence of failure control. In this paper, the controllability of networked finite state machine (<italic>NFSM</italic>) is investigated within the framework of matrix semi-tensor product (<italic>STP</italic>), where random channel packet losses are considered. Firstly, to capture the transition dynamics under random packet losses in the control channel, we introduce a stochastic variable to estimate the state evolution, and the variable is assumed to obey the Bernoulli binary distribution. Meanwhile, the <italic>NFSM</italic> with random channel packet losses can be expressed as a probabilistic logic representation. Subsequently, by means of the delicate operation of matrix <italic>STP</italic>, some concise validation conditions for the controllability with a probability of one ($ w.p. $ 1), are derived for <italic>NFSM</italic> based on the probabilistic logic representation. Finally, a typical computing instance is used to demonstrate the validity of the proposed method. The conclusions are conducive to study the security issues of the system involving opacity, fault detection, controller design and so on.https://www.aimspress.com/article/doi/10.3934/mmc.2023005?viewType=HTMLsemi-tensor productnetworked systemfinite state machinecontrollabilitychannel packet losses |
spellingShingle | Weiwei Han Zhipeng Zhang Chengyi Xia Modeling and analysis of networked finite state machine subject to random communication losses Mathematical Modelling and Control semi-tensor product networked system finite state machine controllability channel packet losses |
title | Modeling and analysis of networked finite state machine subject to random communication losses |
title_full | Modeling and analysis of networked finite state machine subject to random communication losses |
title_fullStr | Modeling and analysis of networked finite state machine subject to random communication losses |
title_full_unstemmed | Modeling and analysis of networked finite state machine subject to random communication losses |
title_short | Modeling and analysis of networked finite state machine subject to random communication losses |
title_sort | modeling and analysis of networked finite state machine subject to random communication losses |
topic | semi-tensor product networked system finite state machine controllability channel packet losses |
url | https://www.aimspress.com/article/doi/10.3934/mmc.2023005?viewType=HTML |
work_keys_str_mv | AT weiweihan modelingandanalysisofnetworkedfinitestatemachinesubjecttorandomcommunicationlosses AT zhipengzhang modelingandanalysisofnetworkedfinitestatemachinesubjecttorandomcommunicationlosses AT chengyixia modelingandanalysisofnetworkedfinitestatemachinesubjecttorandomcommunicationlosses |