207
Views
18
CrossRef citations to date
0
Altmetric
Original Articles

The detection and stabilisation of limit cycle for deterministic finite automata

ORCID Icon, , &
Pages 874-886 | Received 09 Jul 2016, Accepted 11 Feb 2017, Published online: 06 Mar 2017
 

ABSTRACT

In this paper, the topological structure properties of deterministic finite automata (DFA), under the framework of the semi-tensor product of matrices, are investigated. First, the dynamics of DFA are converted into a new algebraic form as a discrete-time linear system by means of Boolean algebra. Using this algebraic description, the approach of calculating the limit cycles of different lengths is given. Second, we present two fundamental concepts, namely, domain of attraction of limit cycle and prereachability set. Based on the prereachability set, an explicit solution of calculating domain of attraction of a limit cycle is completely characterised. Third, we define the globally attractive limit cycle, and then the necessary and sufficient condition for verifying whether all state trajectories of a DFA enter a given limit cycle in a finite number of transitions is given. Fourth, the problem of whether a DFA can be stabilised to a limit cycle by the state feedback controller is discussed. Criteria for limit cycle-stabilisation are established. All state feedback controllers which implement the minimal length trajectories from each state to the limit cycle are obtained by using the proposed algorithm. Finally, an illustrative example is presented to show the theoretical results.

Acknowledgment

The authors would like to express sincere gratitude to the anonymous referees for their helpful comments and suggestins which improved the quality and readability of this paper, and also would like to thank the Editor-in-Chief and editors for their support in handling this paper.

Disclosure statement

No potential conflict of interest was reported by the authors.

Notes

1. A complete introduction about Boolean algebra can be found in Ross and Wright (Citation2003).

Additional information

Funding

This work was supported in part by the National Natural Science Foundation of China [grant number 61573199], [grant number 61573200]; the Natural Science Foundation of Tianjin City [grant number 14JCYBJC18700], [grant number 13JCYBJC17400].

Log in via your institution

Log in to Taylor & Francis Online

PDF download + Online access

  • 48 hours access to article PDF & online version
  • Article PDF can be downloaded
  • Article PDF can be printed
USD 61.00 Add to cart

Issue Purchase

  • 30 days online access to complete issue
  • Article PDFs can be downloaded
  • Article PDFs can be printed
USD 1,709.00 Add to cart

* Local tax will be added as applicable

Related Research

People also read lists articles that other readers of this article have read.

Recommended articles lists articles that we recommend and is powered by our AI driven recommendation engine.

Cited by lists all citing articles based on Crossref citations.
Articles with the Crossref icon will open in a new tab.