Self-modifying finite automata: an introduction
Information Processing Letters
Adaptive protocols for information dissemination in wireless sensor networks
MobiCom '99 Proceedings of the 5th annual ACM/IEEE international conference on Mobile computing and networking
Tamper Resistant Software: An Implementation
Proceedings of the First International Workshop on Information Hiding
(Self-)reconfigurable Finite State Machines: Theory and Implementation
Proceedings of the conference on Design, automation and test in Europe
Adaptive Agent Architecture Inspired by Human Behavior
IAT '04 Proceedings of the IEEE/WIC/ACM International Conference on Intelligent Agent Technology
Hi-index | 0.00 |
Many embedded systems exhibit temporally and behaviorally disjoint behavior slices. When such behaviors are captured by state machines, the current design flow will capture it as a union of all the behavior slices, and map it using traditional state assignment followed by logic synthesis. Such implementations costs are proportional to the union of all the behavior slices (in area, energy and delay). We propose to use self-modifying finite automata (SMFA), that have been studied from complexity-theoretic perspective, for expressing and implementing such adaptive behaviors in embedded systems. Towards this end, we present an implementation architecture for SMFAs. We compare the area, time and energy costs of SMFA implementations with the classical logic space (FSM) implementations for four adaptive behaviors.