Finite State Machines Control Circuits Example: Vending Machine Takes only quarters and dollar bills Won't hold more than $1.00 Sodas cost $.75 Possible.

Slides:



Advertisements
Similar presentations
Modeling Computation Chapter 13.
Advertisements

NFA: Vending Machine Simulation
§12.2 – Finite State Machines with Output. Giving credit where credit is due: Most slides based on lecture notes created byMost slides based on lecture.
Computer ArchitectureFall 2007 © October 1st, 2007 Majd F. Sakr CS-447– Computer Architecture.
Advanced Digital Circuits ECET 146 Week 9 Professor Iskandar Hack ET 221B,
INTRODUCTION COMPUTATIONAL MODELS. 2 What is Computer Science Sciences deal with building and studying models of real world objects /systems. What is.
Basic Register A register is a sequential component that can store multiple bits.
Give qualifications of instructors: DAP
Contemporary Logic Design Finite State Machine Design © R.H. Katz Transparency No Chapter #8: Finite State Machine Design Finite State.
Computer ArchitectureFall 2008 © September 17th, 2008 Majd F. Sakr CS-447– Computer Architecture.
COMS 3261, Lecture 2 Strings, Languages, Automata September 6, 2001.
Costas Busch - RPI1 CSCI-2400 Models of Computation.
Midterm Wednesday Chapter 1-3: Number /character representation and conversion Number arithmetic CMOS logic elements Combinational logic elements and design.
Auto - Drive An Automated Driving Range. Team Members Mike Loiselle Jared Beland Jeremy Paradee.
Reviewing the Definitional Issues of ROMI Ted Mitchell.
I wonder who has more money…. 1 dollar, 3 nickels, 5 dimes 6 dimes, 3 pennies, 5 quarters 8 pennies, 6 nickels, 3 dimes 2 half dollars, 5 pennies, 8 nickels.
Sequential Networks Two major classes of Sequential Circuits 1.Fundamental Mode – A sequential circuit where: Only one input is allowed to change at any.
Finite State Machines – Page 1CSCI 1900 – Discrete Structures CSCI 1900 Discrete Structures Graphs and Finite State Machines Reading: Kolman, Sections.
State Machines.
Finite-State Machines with Output
1 An Introduction to Formal Languages and Automata Provided by : Babak Salimi webAdd:
ECE2030 Introduction to Computer Engineering Lecture 16: Finite State Machines Prof. Hsien-Hsin Sean Lee School of Electrical and Computer Engineering.
Use Case Diagram: Exercise 5 and 6 Yong Choi BPA CSUB.
Working with Money Grade 3 Math Lesson Mrs. Frederico.
Procedures for managing workflow components Workflow components: A workflow can usually be described using formal or informal flow diagramming techniques,
Who uses it?. We all use money to buy what we need to function in our world. Money Vocabulary Bills Dollars Coins Sliver Dollar Half Dollar Fifty Cent.
Counting Coins. The Basics Quarter 25 cents Dime 10 cents.
Canadian Money. Coins Penny 1 cent 1¢ Nickel 5 cents 5¢
Charlie Cards Save Money & Time Daily & Monthly Passes Save Even More.
Relations A relation is a set of ordered pairs. Let's take a look at a couple of examples:
Vending Machine Using FSM Aalapee Patel Seth Martin.
§12.2 – Finite State Machines with Output. Giving credit where credit is due: Most slides based on lecture notes created byMost slides based on lecture.
Lesson 5-2 Domain and Range.
How to Really Be A Millionaire Council for Economic Education.
CSIE.NCTU, DL-6-1 Basic Design Approach of FSM Six Step Process 1. Understand the statement of the Specification 2. Obtain an abstract specification of.
DLD Lecture 26 Finite State Machine Design Procedure.
1 Finite State Machines (FSMs) Now that we understand sequential circuits, we can use them to build: Synchronous (Clocked) Finite State Machines Finite.
1 ENGG 1203 Tutorial Combinational Logic (II) and Sequential Logic (I) 8 Feb Learning Objectives  Apply Karnaugh map for logic simplification  Design.
Models of Computation. Computation: Computation is a general term for any type of information processing information processing CPU memory.
Adding and Subtracting Money! Click on the dollar sign to begin!
© 2009 Pearson Education, Upper Saddle River, NJ All Rights ReservedFloyd, Digital Fundamentals, 10 th ed Digital Logic Design Dr. Oliver Faust.

§12.2 – Finite State Machines with Output
Click the pictures to advance to next slide Use the left arrow to go back.
© 2009 Pearson Education, Upper Saddle River, NJ All Rights ReservedFloyd, Digital Fundamentals, 10 th ed Digital Logic Design Dr. Oliver Faust.
Function or not a Function. What do you deposit? Input: A nickel A dime A quarter Output: Yumm y candy.
State Machine Design State Machine Design Digital Electronics
>> y1 = input('Please enter a number'); >> y2 = input('Please enter a letter'); >> y3 = input('Please enter a letter','s'); >> y4 = input('Please enter.
1 (c) W. J. Dally Digital Design: A Systems Approach Lecture 7: Data Path State Machines.
HOW CAN I CONVERT MONEY? MCC.4.MD.1 Money. Conversions ____ pennies = 1 nickel ____ nickels = 1 dime ____ dimes = 1 dollar ____ quarters = 1 dollar.
1.3 Finite State Machines.
Concurrent Systems Modeling using Petri Nets
Introduction to Advanced Digital Design (14 Marks)
Discrete Mathematics and its Applications
BIS 261 Innovative Education-- snaptutorial.com
Evaluation in Engineering Design Process Modeling and FSM
Finite State Machines.
CSE 140L Discussion Finite State Machines.
Discrete Mathematics and its Applications
§11.2 – Finite State Machines with Output
CSCI-2400 Models of Computation Costas Busch - RPI.
Discrete Mathematics and its Applications
Finite State Machines (FSMs)
Exercise Solution First questions What's output What's input
FINITE STATE MACHINES.
Discrete Mathematics and its Applications
§11.2 – Finite State Machines with Output
EXPLICIT RULES: INPUT-OUTPUT FORMULAS
Finite State Machine Continued
Discrete Mathematics and its Applications
Presentation transcript:

Finite State Machines Control Circuits

Example: Vending Machine Takes only quarters and dollar bills Won't hold more than $1.00 Sodas cost $.75 Possible actions (inputs) –deposit $.25 (25) –deposit $1.00 ($) –push button to get soda (soda) –push button to get money returned (ret)

State: description of the internal settings of the machine, e.g. how much money has been depositied and not spent Finite states: 0, 25, 50, 75, 100, Rules: determine how inputs can change state Example: Vending Machine

ret soda Inputs 25 = = 01 soda = 10 ret = 11

Example: Vending Machine state input new state S2 S1 S0 I0 I1 S2 S1 S state input new state S2 S1 S0 I0 I1 S2 S1 S

Example: Vending Machine state input new state S2 S1 S0 I0 I1 S2 S1 S X state input new state S2 S1 S0 I0 I1 S2 S1 S X X X

Example: Vending Machine S0 S1 S2 I0 I1 Clock S0 S1 S2