Synthesis of reconfigurable hierarchical finite state machines

2Citations
Citations of this article
4Readers
Mendeley users who have this article in their library.
Get full text

Abstract

The paper suggests design methods for reconfigurable hierarchical finite state machines (RHFSM), which possess two following important features: (1) they enable the control algorithms to be divided in modules providing direct support for "divide and conquer" strategy; (2) they allow for static and dynamic reconfiguration. Run-time reconfiguration permits virtual control systems to be constructed, including systems that are more complex than capabilities of available hardware. It is shown that RHFSM can be synthesised from specification in form of hierarchical graph-schemes with the aid of the considered in the paper VHDL templates. The results of experiments show correctness of the proposed methods and their applicability for the design of engineering systems. © 2007 Springer-Verlag Berlin Heidelberg.

Cite

CITATION STYLE

APA

Sklyarov, V., & Skliarova, I. (2007). Synthesis of reconfigurable hierarchical finite state machines. Studies in Computational Intelligence, 76, 259–265. https://doi.org/10.1007/978-3-540-73424-6_30

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free