ESE 380 Lecture Notes - Lecture 16: Finite-State Machine, Embedded System, Subroutine
25 May 2020
School
Department
Course
Professor
Document Summary
Finite state machines, fsms, provide a powerful basis for sequencing tasks (calling subroutines) in embedded systems. A table driven finite state machine provides even greater structure and allows the fsm to be modified by simply modifying its table. The software that uses the table and implements the fsm is not modified to modify the fsm, only the table. Once you have the correct software to implement a table driven fsm, you can use that same software to implement any fsm, simply by changing the table. A mealy or moore finite state machine (fsm) can be implemented in software in an embedded system as a table driven structure. A moore machine"s output is a function of its present state only. A mealy machine"s output is a function of its present state and its current input. Assume that there are two binary inputs to the fsm. The combination of input values can be represented by symbols:
