Using semi-tensor product of matrices, the controllability and stabilizability of finite automata are investigated. By expressing the states, inputs, and outputs in vector forms, the transition and output functions ar...Using semi-tensor product of matrices, the controllability and stabilizability of finite automata are investigated. By expressing the states, inputs, and outputs in vector forms, the transition and output functions are represented in matrix forms.Based on this algebraic description, a necessary and sufficient condition is proposed for checking whether a state is controllable to another one. By this condition, an algorithm is established to find all the control sequences of an arbitrary length. Moreover, the stabilizability of finite automata is considered, and a necessary and sufficient condition is presented to examine whether some states can be stabilized. Finally, the study of illustrative examples verifies the correctness of the presented results/algorithms.展开更多
分析了目前服务计算的研究现状和存在的问题,在D Berardi和A Wombacher的基础上提出了一种带条件的有限状态自动机模型cFSA(Finite State Automata with condition),并给出了基于cFSA的服务理论模型.在该服务理论模型的基础上提出了一...分析了目前服务计算的研究现状和存在的问题,在D Berardi和A Wombacher的基础上提出了一种带条件的有限状态自动机模型cFSA(Finite State Automata with condition),并给出了基于cFSA的服务理论模型.在该服务理论模型的基础上提出了一种基于有限状态自动机的服务组合形式化模型,并给出了该模型的代数性质和实现方法.展开更多
基金supported by the National Natural Science Foundation of China(61174094)the Tianjin Natural Science Foundation of China(13JCYBJC1740014JCYBJC18700)
文摘Using semi-tensor product of matrices, the controllability and stabilizability of finite automata are investigated. By expressing the states, inputs, and outputs in vector forms, the transition and output functions are represented in matrix forms.Based on this algebraic description, a necessary and sufficient condition is proposed for checking whether a state is controllable to another one. By this condition, an algorithm is established to find all the control sequences of an arbitrary length. Moreover, the stabilizability of finite automata is considered, and a necessary and sufficient condition is presented to examine whether some states can be stabilized. Finally, the study of illustrative examples verifies the correctness of the presented results/algorithms.
文摘分析了目前服务计算的研究现状和存在的问题,在D Berardi和A Wombacher的基础上提出了一种带条件的有限状态自动机模型cFSA(Finite State Automata with condition),并给出了基于cFSA的服务理论模型.在该服务理论模型的基础上提出了一种基于有限状态自动机的服务组合形式化模型,并给出了该模型的代数性质和实现方法.
