Introduction to discrete event systems

Slides:



Advertisements
Similar presentations
Language and Automata Theory
Advertisements

CS 367: Model-Based Reasoning Lecture 2 (01/15/2002)
Supervisory Control of Hybrid Systems Written by X. D. Koutsoukos et al. Presented by Wu, Jian 04/16/2002.
Computer Architecture CS 215
Sequential Circuits1 DIGITAL LOGIC DESIGN by Dr. Fenghui Yao Tennessee State University Department of Computer Science Nashville, TN.
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
AC modeling of quasi-resonant converters Extension of State-Space Averaging to model non-PWM switches Use averaged switch modeling technique: apply averaged.
Probabilistic Verification of Discrete Event Systems Håkan L. S. Younes.
1 Classification of Switching Signals 2 Operation on Switching Signals 3 Well-defined ness and Well-posed ness 4 Switching Sequences 5 Solution of.
1 Midterm statistics – On campus students only ECEN 5817 Midterm Exam, Spring 2008 On-campus students Average = 86.3 % Averages by problem: / 35.
CSE 221: Probabilistic Analysis of Computer Systems Topics covered: Stochastic processes Bernoulli and Poisson processes (Sec. 6.1,6.3.,6.4)
Analog Filters: Introduction Franco Maloberti. Analog Filters: Introduction2 Historical Evolution.
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
ECE 8443 – Pattern Recognition EE 3512 – Signals: Continuous and Discrete Objectives: Definition of a System Examples Causality Linearity Time Invariance.
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.
MESB374 System Modeling and Analysis Introduction.
1 Performance Evaluation of Computer Networks: Part II Objectives r Simulation Modeling r Classification of Simulation Modeling r Discrete-Event Simulation.
Generalized Semi-Markov Processes (GSMP)
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.
Signals and Systems Dr. Mohamed Bingabr University of Central Oklahoma
1 Part 2 & 3 Performance evaluation. 2 Goals Understand the complex behavior of systems subject to "random phenomena" Develop intuitive understanding.
Generalized Semi- Markov Processes (GSMP). Summary Some Definitions The Poisson Process Properties of the Poisson Process  Interarrival times  Memoryless.
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
Feedback Control Systems (FCS) Dr. Imtiaz Hussain URL :
Chapter 2 Fundamental Simulation Concepts
CIS 540 Principles of Embedded Computation Spring Instructor: Rajeev Alur
Signals and Systems Lecture # 7 System Properties (continued) Prepared by: Dr. Mohammed Refaey 1Signals and Systems Lecture # 7.
CS433 Modeling and Simulation Lecture 07 – Part 01 Continuous Markov Chains Dr. Anis Koubâa 14 Dec 2008 Al-Imam.
Signals and Systems 1 Lecture 7 Dr. Ali. A. Jalali September 4, 2002
1 Digital Signal Processing Lecture 3 – 4 By Dileep kumar
EE102 – SYSTEMS & SIGNALS Fall Quarter, Instructor: Fernando Paganini.
Lecture 7: State-Space Modeling 1.Introduction to state-space modeling Definitions How it relates to other modeling formalisms 2.State-space examples 3.Transforming.
Analysis and Synthesis of Synchronous Sequential Circuits A “synchronizing” pulse/edge signal (clock) controls the operation of the memory portion of the.
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:
CS433 Modeling and Simulation Lecture 11 Continuous Markov Chains Dr. Anis Koubâa 01 May 2009 Al-Imam Mohammad Ibn Saud University.
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.
Chapter 2. Signals and Linear Systems
TOPIC : Introduction to Sequential Circuits UNIT 1: Modeling and Simulation Module 4 : Modeling Sequential Circuits.
Instructor: Chen-Hsiung Yang Dynamic System Modeling Analysis and Control 動態系統建模分析與控制 Lecture1 Introduction to System Dynamics.
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.
MESB374 System Modeling and Analysis
EE611 Deterministic Systems
State Space Representation
Introduction to Advanced Digital Design (14 Marks)
Modeling and Simulation (An Introduction)
Simulation Examples STOCHASTIC PROCESSES.
Digital Control Systems (DCS)
State Space Analysis UNIT-V.
Synchronous sequential
Performance evaluation
MECH 3550 : Simulation & Visualization
Performance evaluation of manufacturing systems
CS M51A/EE M16 Winter’05 Section 1 Logic Design of Digital Systems Lecture 11 February 23 W’05 Yutao He 4532B Boelter Hall
Lecture 11 – Stochastic Processes
Presentation transcript:

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 Support en Français et en Anglais: http://www.emse.fr/~xie/master

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 3

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. 7

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). 8

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 : 9

System dynamics : sample path 10

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

A queueing system 12

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 13

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 14

Discrete event systems 15

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 16

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. 17

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 asyncrhonuous discrete events over time. Essential defining elements: E : a discrete-event set X : a discrete state space 18

Two Points of Views Untimed models (logical behavior) Input : event sequence {e1, e2, ...} without information about the occurrence times. Sample path: sequence of states resulting from {s1, s2, ...} Timed models (quantitative behavior) Input : 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 19

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}} 20

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 21

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