Results 231 to 240 of about 74,615 (275)
Some of the next articles are maybe not open access.
Algebraic method of simplifying Boolean networks using semi‐tensor product of Matrices
Asian Journal of Control, 2019AbstractThe huge state space of large Boolean networks makes analysis and synthesis difficult. This paper, using a new matrix analysis tool called semi‐tensor product of matrices, to explain a simplification method of Boolean networks in a mathematical manner. The idea consists of two steps.
Yongyi Yan, Jumei Yue, Zengqiang Chen
openaire +2 more sources
Semi-tensor Product of Matrices
2011This chapter provides a basic introduction to the semi-tensor product of matrices. We will emphasize concepts, geometric interpretations, and some fundamental properties. All proofs are omitted as we refer to Cheng and Qi (Semi-tensor Product of Matrices—Theory and Applications, Science Press, Beijing, 2007) for them.
Daizhan Cheng, Hongsheng Qi, Zhiqiang Li
openaire +1 more source
Transactions of the Institute of Measurement and Control, 2020
As a fundamental subject, the state estimation of deterministic finite automata has received considerable attention. Especially, it is increasingly necessary to study various problems based on more complex systems. In this paper, the observability of three kinds of combining automata, structured in parallel, serial and feedback manners, are ...
Zengqiang Chen +3 more
openaire +1 more source
As a fundamental subject, the state estimation of deterministic finite automata has received considerable attention. Especially, it is increasingly necessary to study various problems based on more complex systems. In this paper, the observability of three kinds of combining automata, structured in parallel, serial and feedback manners, are ...
Zengqiang Chen +3 more
openaire +1 more source
Language acceptability of finite automata based on theory of semi‐tensor product of matrices
Asian Journal of Control, 2019AbstractUsing the theories of many‐valued logic and semi‐tensor product of matrices (STP), this paper investigates how to mathematically determine whether or not a regular language is recognized by finite automata (FA). To this end, the dynamic behaviour of FA is first formulated as bilinear dynamic equations, which provides a uniform model for ...
Jumei Yue, Yongyi Yan, Zengqiang Chen
openaire +1 more source
Verification analysis of self-verifying automata via semi-tensor product of matrices
The Journal of China Universities of Posts and Telecommunications, 2014Abstract The semi-tensor product (STP) of matrices was used in the article, as a new matrix analysis tool, to investigate the problem of verification of self-verifying automata (SVA). SVA is a special variant of finite automata which is essential to nondeterministic communication with a limited number of advice bits.
Yong-yi YAN +2 more
openaire +1 more source
Physica A: Statistical Mechanics and its Applications, 2022
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Tang, Yu, Li, Lulu, Lu, Jianquan
openaire +1 more source
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Tang, Yu, Li, Lulu, Lu, Jianquan
openaire +1 more source
Matrix approach to simplification of finite state machines using semi‐tensor product of matrices
Asian Journal of Control, 2019AbstractIn this paper, we use a new mathematical tool, semi‐tensor product of matrices, to investigate the problem of simplification of finite state machines (FSMs) in a mathematical manner. First, based on the dynamic equations of state transition and output behavior which are developed recently, an algebraic criterion of k‐difference states is ...
Jumei Yue, Yongyi Yan, Zengqiang Chen
openaire +1 more source
Solving type-2 fuzzy relation equations via semi-tensor product of matrices
Control Theory and Technology, 2014zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Yan, Yongyi +2 more
openaire +1 more source
Control Theory and Technology, 2021
This paper deals with the dynamic output feedback stabilization problem of deterministic finite automata (DFA). The static form of this problem is defined and solved in previous studies via a set of equivalent conditions. In this paper, the dynamic output feedback (DOF) stabilization of DFAs is defined in which the controller is supposed to be another ...
Roozbeh Abolpour +2 more
openaire +1 more source
This paper deals with the dynamic output feedback stabilization problem of deterministic finite automata (DFA). The static form of this problem is defined and solved in previous studies via a set of equivalent conditions. In this paper, the dynamic output feedback (DOF) stabilization of DFAs is defined in which the controller is supposed to be another ...
Roozbeh Abolpour +2 more
openaire +1 more source
Calculating basis siphons of Petri nets based on semi-tensor product of matrices
2016 35th Chinese Control Conference (CCC), 2016In this paper, we address the problem of calculating basis siphons in Petri nets (PNs) by resorting to the semi-tensor product (STP) of matrices. The proposed appraoch is based on our previous results on the calculation of siphons and minimal siphons in PNs, whose key notion is that of the siphon equation (SE) of PNs.
Xiaoguang Han +3 more
openaire +1 more source

