Targil 1- Vending Machine

Slides:



Advertisements
Similar presentations
ACM/JETT Workshop - August 4-5, :Design of Classes using CRC cards.
Advertisements

Modeling Computation Chapter 13.
NFA: Vending Machine Simulation
From use cases to classes (in UML). A use case for writing use cases Use case: writing a use case Actors: analyst, client(s) Client identifies and write.
Overview of a Simple Development Method. Background Before discussing some specific methods we will consider a simple method that doesnt have a name but.
Chapter 11 Describing Process Specifications and Structured Decisions
Lecture 20 Finite State Machines CSCI – 1900 Mathematics for Computer Science Fall 2014 Bill Pine.
Draw the context and level 0 DFD
Copyright © 2010 Pearson Education, Inc. All rights reserved. 4.4 – Slide 1.
Finite state machines.
Information System Design IT60105
Sequential Circuit Design
Pohang University of Science and Technology (POSTECH) Copyright © 2003 SE Lab. Dept. of CSE POSTECH, R.O. Korea Vending Machine Modeling 2003 Fall Software.
Object Interaction Models - Review The use case and its scenarios serve as a vehicle for organizing the object interactions that take place. Each scenario.
Sequential Circuit Design
Overview of a Simple Development Method. Background Before discussing some specific methods we will consider a simple method that doesn’t have a name.
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.
Lesson 7.11 One Dollar.
Events & Messages Paul Ard Ales v2.0. Generic Exceptions  HardwareFail – the device does not respond  HardwareMalfunction – some part of the device.
INTERACTION DIAGRAMS Example Kingdom of Saudi Arabia Ministry of Higher Education Princess Noura bint Abdulrahman University College of Computer & Information.
Computer Science & Engineering 2111 Introduction to Database Management Systems Relationships and Database Creation 1 CSE 2111 Introduction to Database.
Linear System Word Problems
The University of New Hampshire InterOperability Laboratory Serial ATA (SATA) Protocol Chapter 10 – Transport Layer.
Use Cases Yonglei Tao.
DEMIGUISE STORAGE An Anonymous File Storage System VIJAY KUMAR RAVI PRAGATHI SEGIREDDY COMP 512.
What is Sure BDCs? BDC stands for Batch Data Communication and is also known as Batch Input. It is a technique for mass input of data into SAP by simulating.
Functional Modeling Joseph Valacich, Joey George and Jeff Hoffer, Essentials of System Analysis and Design, 4 th edition, Prentice Hall, 2009.
Chapter 9 Describing Process Specifications and Structured Decisions
Glenn David Blank Computer Science & Engineering Department Lehigh University, Bethlehem, PA, USA With support from the National Science Foundation (Grants.
Interaction Modeling. Overview The class model describes the objects in a system and their relationships, the state model describes the life cycles of.
Online Car Rental System A customer can browse available cars. A customer can create a new car reservation. The system validates credit card information.
Finite-State Machines with Output
Management Information Systems MS Access MS Access is an application software that facilitates us to create Database Management Systems (DBMS)
Use Case Diagram: Exercise 5 and 6 Yong Choi BPA CSUB.
MS Access 2007 Management Information Systems 1. Overview 2  What is MS Access?  Access Terminology  Access Window  Database Window  Create New Database.
SFWR ENG 3KO4 Software Development for Computer/Electrical Engineering Fall 2009 Instructor: Dr. Kamran Sartipi Software Requirement Specification (SRS)
1 Inputs: q (quarter), d (dime) and n (nickel) Input can be two bit coded input or three bit not coded input –Two bit coded: 00 no coin, 01 nickel, 10.
Counting Coins. The Basics Quarter 25 cents Dime 10 cents.
MONEY! Pick the correct coin! Click here to get started!!
AS Computing Verification. Once sensible data has been entered, the second of method of ensuing data integrity can be employed. Verification is the process.
Let’s Learn About Money!
Name the United States Coins Count the Pennies 10 ¢
Coin Problems.
§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.
Types of Processing of Data www. ICT-Teacher.com.
State Table Problem #1 An electronic lock is controlled by a keypad, which has three buttons labeled A, B, and R. The keypad is restricted such that, at.
1 ENGG 1203 Tutorial Combinational Logic (II) and Sequential Logic (I) 8 Feb Learning Objectives  Apply Karnaugh map for logic simplification  Design.
Functional Modeling Joseph Valacich, Joey George and Jeff Hoffer, Essentials of System Analysis and Design, 4 th edition, Prentice Hall, 2009.
Check It Out When you receive a paycheck, you may want to have a checking account. Do you have a checking account?
ECE 353 Lab 2 Pipeline Simulator Additional Material.
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.
Context level (0) DFD to model the programming of a VCR TV guide Tape retailer VCR program VCR Visual program data New tape VCR program data tape VCR.

May07-02: Parking Meter Clint Hertz: Team Leader Austyn Trace: Communications Nick Hollander Christian Baldus.
Complete the new customer information and click Next. Adding a Reseller-of-record when creating a new customer.
Data Flow Diagrams Level 1 and Level 0 System Design.
1 (c) W. J. Dally Digital Design: A Systems Approach Lecture 7: Data Path State Machines.
Daar is geen woord Chinees bij. Follows the push model, messages are not initiated by the software 2.
KM SERIES VENDING MACHINES OPERATION MANUAL. ARM Main board & Driver Board DRIVING BOARD MAIN BOARD.
Finite-State Machines (FSM) Chuck Cusack Based partly on Chapter 11 of “Discrete Mathematics and its Applications,” 5 th edition, by Kenneth Rosen.
Coffeemar S500 See Brochure See Manual See credit acceptance
ECE 353 Lab 3 Pipeline Simulator
Continuation of Causeway Example
Lab 7: Business Process Modeling Notation (BPMN)
Victa, Charles Xue, Huan Tsang, Hubert.
$ $ $ $ $ $ $ $ $ $ $ $ $ $ $ $ $ $ $ $ $ $ $ $ $ $ $ $ $ $ $ $ $ $ $
Name the United States Coins
§11.2 – Finite State Machines with Output
Normal Calculations 1) Each member of the group should have answers and work shown. 2) Go at your own pace (Don’t show answer until your group has attempted.
Presentation transcript:

Targil 1- Vending Machine The problem   חברה רוצה לפתח מכונה אוטומטית למכירת שתייה (Vending Machine) לשוק בארה"ב. הציור המצורף, מתאר את נקודת המבט של הלקוח (Customer) לגבי המערכת. להלן תאור תכונות המערכת: 2005 Targil 1- Vending Machine

Targil 1- Vending Machine VM Characteristics Accept nickels, dimes and quarters from customers. Any other coins are to be treated as slugs and returned to the customer. Check each coin to make sure it is not a slug. This is to be done by validating the size and weight of each coin. Initiate payment computations only after detecting a valid coin. The system is to be difficult for people to trick. Accept product selection from the customer. Check to see whether the selected product is available in the dispenser. If not available, return coins and notify customer. A variety of products which will change from time to time shall be offered. The product prices should be changeable. Return the customer payment on request if he/she decides not to make a selection. Dispense the product if payment conditions are fulfilled and product is available. Return correct change to customer. Disable product selection after the product is dispensed and until the next validated coin is received. Make deposited coins available for change together with initial set of coins. 2005 Targil 1- Vending Machine

Targil 1- Vending Machine VM - Customer View 2005 Targil 1- Vending Machine

Targil 1- Vending Machine VM - Operator View 2005 Targil 1- Vending Machine

Targil 1- Vending Machine VM – Context diagram Objects Slugs Customer selection Returned coins Customer Customer Product Products in Vending Machine Coins in System Operator BIT information in Coins out Database information in Operator Database information out BIT status 2005 Targil 1- Vending Machine

VM – DFD-0 (Vending machine system) Product 1 Maintain Machine 2 Operator Customer Objects Customer selection Products in Coins in Database information in Slugs Returned coins Database information out Coins out BIT information in BIT status 2005 Targil 1- Vending Machine

VM – DFD-1 (Vend product) Get customer payments 1.1 Slugs Coins Inserted coins Extracted Dispense Change 1.2 Returned coins Validate payment 1.3 Payment Change due Products Price data Get product Price 1.4 Get valid selection 1.5 Customer selection product 1.6 Product data Valid selection Product Objects Price table 2005 Targil 1- Vending Machine

VM – DFD-1.1 (Get customer payment) 2005 Targil 1- Vending Machine

Targil 1- Vending Machine VM – PSPEC-1.1.1 – 1.1.5 Pspec 1.1.1: Validate coins Examine OBJECT to see if it matches any set of COIN PARAMETERS - If so: Accept OBJECT as COIN - Else: Return OBJECT as SLUG Pspec 1.1.2: Clear payment Issue PAYMENT = 0 Pspec 1.1.3: Accumulate payment Add COIN VALUE to PAYMENT Pspec 1.1.4: Accumulate coins Examine if HELD COINS .LE. HOLD CAPACITY then: - If so: Return COIN as SLUGS - Else: Add COIN to HELD COINS Pspec 1.1.5: Deposit coins Transfer HELD COINS to COINS 2005 Targil 1- Vending Machine

Targil 1- Vending Machine VM – Dictionary Sample Definition Term {Quarters, Dimes, Nickels} Coins {Soda, Candy, Gum, Cracker} Customer selection {Coins, Slugs} Objects Built-In-Test status results {OK, NOT-OK}, {Status} Status = {Computer, Keyboard, Display, Coins, Products, Mechanical} BIT status Display (reflect) “database information in” Database information out 2005 Targil 1- Vending Machine

Targil 1- Vending Machine The End 2005 Targil 1- Vending Machine