Performance evaluation of manufacturing systems

Slides:



Advertisements
Similar presentations
Language and Automata Theory
Advertisements

CS 367: Model-Based Reasoning Lecture 2 (01/15/2002)
Computer Architecture CS 215
Sequential Circuits1 DIGITAL LOGIC DESIGN by Dr. Fenghui Yao Tennessee State University Department of Computer Science Nashville, TN.
Overview Part 1 - Storage Elements and Analysis
Charles Kime & Thomas Kaminski © 2008 Pearson Education, Inc. (Hyperlinks are active in View Show mode) Chapter 5 – Sequential Circuits Part 1 – Storage.
Modeling & Simulation. System Models and Simulation Framework for Modeling and Simulation The framework defines the entities and their Relationships that.
1 Chapter 5 Continuous time Markov Chains Learning objectives : Introduce continuous time Markov Chain Model manufacturing systems using Markov Chain Able.
ECE 877-J Discrete Event Systems 224 McKinley Hall.
Classification of Simulation Models
Spring semester 2006 ESE 601: Hybrid Systems Review material on continuous systems I.
Charles Kime & Thomas Kaminski © 2008 Pearson Education, Inc. (Hyperlinks are active in View Show mode) Chapter 5 – Sequential Circuits Part 1 – Storage.
Models of Computation for Embedded System Design Alvise Bonivento.
Lab 01 Fundamentals SE 405 Discrete Event Simulation
Digital Logic Design CHAPTER 5 Sequential Logic. 2 Sequential Circuits Combinational circuits – The outputs are entirely dependent on the current inputs.
Lecture 11 – Stochastic Processes
1 Performance Evaluation of Computer Networks: Part II Objectives r Simulation Modeling r Classification of Simulation Modeling r Discrete-Event Simulation.
Modeling & Simulation: An Introduction Some slides in this presentation have been copyrighted to Dr. Amr Elmougy.
Benjamin Gamble. What is Time?  Can mean many different things to a computer Dynamic Equation Variable System State 2.
1 Chapter 1 Fundamental Concepts. 2 signalpattern of variation of a physical quantity,A signal is a pattern of variation of a physical quantity, often.
1 Part 2 & 3 Performance evaluation. 2 Goals Understand the complex behavior of systems subject to "random phenomena" Develop intuitive understanding.
ECE 466/658: Performance Evaluation and Simulation Introduction Instructor: Christos Panayiotou.
President UniversityErwin SitompulModern Control 1/1 Dr.-Ing. Erwin Sitompul President University Lecture 1 Modern Control
Chapter 2 Fundamental Simulation Concepts
CIS 540 Principles of Embedded Computation Spring Instructor: Rajeev Alur
EE102 – SYSTEMS & SIGNALS Fall Quarter, Instructor: Fernando Paganini.
Analysis and Synthesis of Synchronous Sequential Circuits A “synchronizing” pulse/edge signal (clock) controls the operation of the memory portion of the.
Introduction to discrete event systems
Queuing Theory.  Queuing Theory deals with systems of the following type:  Typically we are interested in how much queuing occurs or in the delays at.
Textbook and Syllabus Textbook: Syllabus:
Review n System dynamics : A sequence of state transition n model : A set of rules for state transition System S X Y Discrete event system FSM (Automata)
Modeling & Simulation of Dynamic Systems (MSDS)
State Equations BIOE Processes A process transforms input to output States are variables internal to the process that determine how this transformation.
Introduction The objective of simulation – Analysis the system (Model) Analytically the model – a description of some system intended to predict the behavior.
Simulation Examples And General Principles Part 2
1 Chapter 5 Continuous time Markov Chains Learning objectives : Introduce continuous time Markov Chain Model manufacturing systems using Markov Chain Able.
TOPIC : Introduction to Sequential Circuits UNIT 1: Modeling and Simulation Module 4 : Modeling Sequential Circuits.
Modern Control TheoryLecture 1, written by Xiaodong Zhao1 Modern Control Theory Syllabus Course Coordinator: Dr. Xiaodong Zhao – Room: Building Lab 2,
Modelling & Simulation of Semiconductor Devices Lecture 1 & 2 Introduction to Modelling & Simulation.
Introduction to Simulation What is a simulation? A system that represents or emulates the behavior of another system over time; a computer simulation is.
EE611 Deterministic Systems System Descriptions, State, Convolution Kevin D. Donohue Electrical and Computer Engineering University of Kentucky.
Overview Part 1 - Storage Elements and Sequential Circuit Analysis
Lecture #17: Clocked Synchronous State-Machine Analysis
Analogue and digital techniques in closed loop regulation applications
Textbook and Syllabus Textbook: Syllabus:
OPERATING SYSTEMS CS 3502 Fall 2017
4.
Automatic Control Theory
MESB374 System Modeling and Analysis
Prepared by Lloyd R. Jaisingh
EE611 Deterministic Systems
State Space Representation
Introduction to Advanced Digital Design (14 Marks)
Modeling and Simulation (An Introduction)
Simulation Examples STOCHASTIC PROCESSES.
Language and Automata Theory
State Space Representation
Modern Control Systems (MCS)
World-Views of Simulation
Chapter 1 Fundamental Concepts
State Space Analysis UNIT-V.
Homing sequence: to identify the final state.
Queueing Theory Chapter 1
Performance evaluation
Sequential Circuits UNIT- IV
MECH 3550 : Simulation & Visualization
Signals and Systems Lecture 2
CS M51A/EE M16 Winter’05 Section 1 Logic Design of Digital Systems Lecture 11 February 23 W’05 Yutao He 4532B Boelter Hall
SEQUENTIAL CIRCUITS __________________________________________________
Lecture 11 – Stochastic Processes
Presentation transcript:

Performance evaluation of manufacturing systems Instructor : Prof. Xiaolan Xie Schedule : Date Time Where 18-oct 08:15 - 11:30 A104, Espace Fauriel 25-oct 15-nov S129, Espace Fauriel 22-nov 29-nov 17-janv 08:15 - 12:00 exam Master Course support on: http://www.emse.fr/~xie/master

Introduction to discrete event systems Chapter I Introduction to discrete event systems Learning objectives : Introduce fundamental concepts of system theory Understand features of event-driven dynamic systems Textbook : C. Cassandras and S. Lafortune, Introduction to Discrete Event Systems, Springer, 2007

Discrete-event system by an example of a queueing system Plan System basics Discrete-event system by an example of a queueing system Discrete event systems

System basics 4

Interacting components Function the system is supposed to perform The concept of system •System: A combination of components that act together to perform a function not possible with any of the individual parts (IEEE) •Salient features : Interacting components Function the system is supposed to perform

The Input-Output Modeling process Define a set of measurable variables Select a subset of variables that can be changed over time (Input variables) Select another set of variables directly measurable (Output variables, responses, stimulus) Derive the Input-Output relation

The Input-Output Modeling process Example 1 : An electric circuit with two resistances r and R y(t)/u(t)= R/(r+R) Example 2 : An electric circuit with a resistance R and a capacitor (condensateur) C u(t) = vR(t) + y(t) vR(t) = iR i=C.dy(t)/dt Y(s)/U(s) = 1/(1+CRs)

Static and dynamic systems Static systems : Output y(t) independent of the past values of the input u(t), for t < t. The IO relation is a function : y(t) = g(u(t)) Dynamic systems : Output y(t) depends on past values of the input u(t), for t < t. Memory of the input history is needed to determine y(t) The IO relation is a differential equation. 8

Static and dynamic systems y(K) depends only on u(K) Dynamic Case u(t) = K & y(0) = K: y(K) = K Case u(t) = K & y(0) = 0 : y(K) = K – Ke-K/RC Case u(t) = t & y(0) = 0 : y(K) = K – (1-e-K/R)/RC y(K) depends on past u(t) and y(0)

The concept of state Definition : The state of a system at time t0 is the information required at t0 such that the output y(t), for all t ≥ t0 is uniquely determined from this information and from u(t), t ≥ t0. The state is generally a vector of state variables x(t). 10

System dynamics State equation : The set of equations required to specify the state x(t) for all t≥ t0, given x(t0) and the function u(t), t≥ t0. State space : The state space of a system is a set of all possible values that the state may take. Output equation : 11

System dynamics : sample path 12

Discrete system The system is observed at regular intervals at time t = nD for all constant elementary period D. 13

A queueing system 14

x(t) = number of customers in the system Random customer arrivals State of the system : x(t) = number of customers in the system Random customer arrivals Random service times FIFO service 15

arrival times t of customers where x(t+0) = x(t0) +1 System dynamic The state of the system remains unchanged except at the following instants (events) arrival times t of customers where x(t+0) = x(t0) +1 departure times t of customers where x(t+0) = x(t0)  1 Sample path 16

Discrete event systems 17

The concept of event An event occurs instantaneously and causes transitions from one discrete state to another An event can be a specific action taken (press a button) a spontaneous occurrence dictated by nature (failures) sudden fulfillment of some conditions (buffer full). Notation : e = event, E = set of event. Queueing system: E = {a, d} with a = arrival, d = departure 18

Time-driven and event-driven systems Time-driven systems Continuous time systems Discrete systems (driven by regular clock ticks) State transitions are synchronized by the clock Event-driven systems State changes at various time instants (may not known in advance) with some event e announcing that it is occurring State transitions as a result of combining asynchronous and concurrent event processes. 19

Characteristics of discrete event systems Definition. A Discrete Event Systems (DES) is a discrete-state, event-driven system, that is, its state evolution depends entirely on the occurrence of asynchronous discrete events over time. Essential defining elements: E : a discrete-event set X : a discrete state space 20

Two Points of Views Untimed models (logical behavior) event sequence {e1, e2, ...} without information about the occurrence times. Sample path: sequence of states resulting from {s1, s2, ...} Timed models (quantitative behavior) timed event sequence {(e1, t1), (e2, t2), ...}. Sample path : the entire sample path over time. Also called a realization. e1 e2 e3 e4 e5 e1 e2 e3 e4 e5 s1 s2 s3 s4 s5 s6 t1 t2 t3 t4 t5 21

A manufacturing system 1 2 part departures part arrivals A two-machine transfer line with an intermediate buffer of capacity 3. Essential defining elements: E = {a, d1, d2} X = {(x1, x2) : x1 ≥ 0, x2  {0, 1, 2, 3, B}} 22

System classifications Static vs dynamic systems Time-varying vs time-invariant systems Linear vs nonlinear systems continuous-state vs discrete state systems time-drived vs event-driven systems deterministic vs stochastic systems discrete-time vs continuous-time systems 23

Goals of system theory Modeling and analysis Design and synthesis Control Performance evaluation Optimization 24