Reconfigurable models of finite state machines and their implementation in FPGAs
Journal of Systems Architecture: the EUROMICRO Journal
Hyperreconfigurable architectures and the partition into hypercontexts problem
Journal of Parallel and Distributed Computing
Proceedings of the 2005 Asia and South Pacific Design Automation Conference
State space reconfigurability: an implementation architecture for self modifying finite automata
CASES '06 Proceedings of the 2006 international conference on Compilers, architecture and synthesis for embedded systems
DR-TCP: Downloadable and reconfigurable TCP
Journal of Systems and Software
Design Aspects of Multi-level Reconfigurable Architectures
Journal of Signal Processing Systems
An extension of self-reconfigurable FSM with reduced reconfiguration sequences concept
IMCAS'06 Proceedings of the 5th WSEAS international conference on Instrumentation, measurement, circuits and systems
R-Charon, a modeling language for reconfigurable hybrid systems
HSCC'06 Proceedings of the 9th international conference on Hybrid Systems: computation and control
Hi-index | 0.00 |
In this paper, we introduce the concept of (self-)reconfigurablefinite state machines as a formal model to describestate-machines implemented in hardware that maybe reconfigured during operation. By the advent of reconfigurablelogic devices such as FPGAs, this model may becomeimportant to characterize and implement (self-)reconfigurablehardware. An FSM is called (self-)reconfigurableif reconfiguration of either output function or transitionfunction is initiated by the FSM itself and not based on externalreconfiguration events. We propose an efficient hard-warerealisation and give algorithmic solutions and boundsfor the reconfiguration overhead of migrating a given FSMspecification into a new target FSM.