# ETHZ/FSM

< ETHZ(Difference between revisions)
 Revision as of 22:25, 24 October 2007 (view source)← Older edit Latest revision as of 14:26, 26 October 2007 (view source) (4 intermediate revisions not shown) Line 1: Line 1: - [[Image:Eth_zh_logo_4.png|830px]] + [[Image:ETHZ_banner.png|830px]] Line 41: Line 41:
- Introduction Section + Introduction - Model Overview Section + Model Overview - Detailed Model Section + Detailed Model - Final Model Section + Final Model Modeling Basics Page Modeling Basics Page - Mathematical Model Section + Mathematical Model FSM View Page FSM View Page Flip-Flop View Page Flip-Flop View Page Line 54: Line 54:
- Introduction Section + Introduction - The Complete System Section + The Complete System - System Phases Section + System Phases + Current Cloning Status System Parts Page System Parts Page Lab Notes Page Lab Notes Page Line 98: Line 99: {| class="wikitable" border="1" cellspacing="0" cellpadding="2" style="text-align:left; margin: 1em 1em 1em 0; background: #f9f9f9; border: 1px #aaa solid; border-collapse: collapse;" {| class="wikitable" border="1" cellspacing="0" cellpadding="2" style="text-align:left; margin: 1em 1em 1em 0; background: #f9f9f9; border: 1px #aaa solid; border-collapse: collapse;" |- align="center" |- align="center" - ! inputs/states !! ''q''0 !! ''q''1 !! ''q''2 !! width="50" | + ! ''δ'' : ''Q'' × Σ → ''Q'' !! ''q''0 !! ''q''1 !! ''q''2 !! width="50" | - ! inputs/states !! ''q''0 !! ''q''1 !! ''q''2 + ! ''Ω'' : ''Q'' × Σ → Λ !! ''q''0 !! ''q''1 !! ''q''2 |- align="center" |- align="center" ! A+L          || ''q''1 || ''q''1 || ''q''1 || ! A+L          || ''q''1 || ''q''1 || ''q''1 ||

# Finite State Machine View on the System

Fig. 1: Graph representing the finite state machine.

The proposed system is best described by a Mealy machine, a special type of finite state machines (FSM). Mealy machines are defined by a 6-tuple, (Q, q0, Σ, Λ, δ, Ω), with:

• Q - a set of states, for the proposed system we use three different states (q0 - not yet trained, q1 - trained to recognize chemical A, q2 - trained to recognize chemical B)
• q0 - a start state, here we assume we start in a state where the system is not yet trained
• Σ = {A+L, A, B+L, B} - an input alphabet
• Λ = {green, red, blue, yellow} - an output alphabet
• δ : Q × Σ → Q - a state transition function
• Ω : Q × Σ → Λ - an output function

In detail, the transition function δ and the output function Ω look as follows:

δ : Q × Σ → Q q0 q1 q2 Ω : Q × Σ → Λ q0 q1 q2
A+L q1 q1 q1 A+L cyan cyan green
A q0 q0 q0 A cyan cyan cyan
B+L q2 q2 q2 B+L yellow red yellow
B q0 q0 q0 B yellow yellow yellow

The resulting automaton is shown in Fig. 1.
In its native state (q0), the system reacts on the presence of either chemical A or B by fluorescing cyan or yellow, respectively. The system itself remains in state q0. Only when the input chemical is combined with a learning signal (chemical L), it changes its state either to q1 (in presence of chemical A) or q2 (in presence of chemical B). In these two states, the system is able to distinguish between changing input: while the system is in state q1, the system starts fluorescing red if confronted with chemical B and vice versa when the system is in state q2 and confronted with chemical A (it fluoresces green). In order to maintain the states q1 and q2, the learning signal L has to be present all the time.