Discrete Event Control

Slides:



Advertisements
Similar presentations
Computer Science 210 Computer Organization Introduction to Logic Circuits.
Advertisements

Programmable Logic Controllers.
Digital Electronics Lecture 2 Logic Gates. Lecture 2 outline Announcement:
Sahar Mosleh PageCalifornia State University San Marcos 1 Introductory Concepts This section of the course introduces the concept of digital circuits and.
Boolean rules for simplification Dr. Ahmed Telba.
Cosc 2150: Computer Organization Chapter 3: Boolean Algebra and Digital Logic.
1 Discrete Event Control Concept Representation DEC controller design DEC controller implementation.
Lecture 2 Dr Richard Reilly Dept. of Electronic & Electrical Engineering Room 153, Engineering Building To insert your company logo on this slide From.
Chapter 4 Gates and Circuits.
1 Boolean Algebra & Logic Design. 2 Developed by George Boole in the 1850s Mathematical theory of logic. Shannon was the first to use Boolean Algebra.
Chapter 4 Logic Gates and Boolean Algebra. Introduction Logic gates are the actual physical implementations of the logical operators. These gates form.

Propositional Calculus Math Foundations of Computer Science.
Lecture 3. Boolean Algebra, Logic Gates Prof. Sin-Min Lee Department of Computer Science 2x.
Chapter 4 Gates and Circuits. 4–2 Chapter Goals Identify the basic gates and describe the behavior of each Describe how gates are implemented using transistors.
Chapter 4 Gates and Circuits.
Logical Circuit Design
Chapter 2 Combinational Systems And / Or / Not. TRIAD PRINCIPLE: Combinational is about And / Or / Not combinations As well as equivalent functions. It.
Systems Architecture I1 Propositional Calculus Objective: To provide students with the concepts and techniques from propositional calculus so that they.
Digital Logic Chapter 4 Presented by Prof Tim Johnson
CSC 107 – Programming For Science. Follow-Up From Last Lecture.
Lecture 7 Topics –Boolean Algebra 1. Logic and Bits Operation Computers represent information by bit A bit has two possible values, namely zero and one.
Variables Tutorial 3c variable A variable is any symbol that can be replaced with a number to solve a math problem. An open sentence has at least one.
1 Boolean Algebra & Logic Gates. 2 Objectives Understand the relationship between Boolean logic and digital computer circuits. Learn how to design simple.
Chap 4. Sequential Circuits
Discrete Mathematics and Its Applications.  The English mathematician George Boole ( ) sought to give symbolic form to Aristotle's system of.
Week 6: Gates and Circuits: PART I READING: Chapter 4.
Linear Algebra. Circuits The circuits in computers and other input devices have inputs, each of which is either a 0 or 1, the output is also 0s and 1s.
Propositional Calculus CS 270: Mathematical Foundations of Computer Science Jeremy Johnson.
June 10, 2002© Howard Huang1 Number systems To get started, we’ll discuss one of the fundamental concepts underlying digital computer design:
LECTURE 4 Logic Design. LOGIC DESIGN We already know that the language of the machine is binary – that is, sequences of 1’s and 0’s. But why is this?
ECE DIGITAL LOGIC LECTURE 6: BOOLEAN ALGEBRA Assistant Prof. Fareena Saqib Florida Institute of Technology Fall 2016, 02/01/2016.
MECH 1500 Chapter 4. MECH 1500 The Binary Concept 4.1.
Lecture 21: Combinatorial Circuits II Discrete Mathematical Structures: Theory and Applications.
1 Lesson 6 – Introduction to Functions: Concepts and Notations Math 2 Honors - Santowski 6/12/2016 Math 2 Honors - Santowski.
UNIT 4 APPLICATIONS OF BOOLEAN ALGEBRA MINTERM AND MAXTERM EXPANSIONS Click the mouse to move to the next page. Use the ESC key to exit this chapter. This.
Computer Organization CS345 David Monismith Based upon notes by Dr. Bill Siever and notes from the Patternson and Hennessy Text.
CS231: Computer Architecture I Laxmikant Kale Fall 2002.
Week 1: Introduction and Logic gates IT3002 – Computer Architecture
Logic gates.
Boolean Algebra & Logic Gates
CSIS-110 Introduction to Computer Science
Digital Logic.
Morgan Kaufmann Publishers
Logic Gates and Boolean Algebra
Chapter 3 Notes – Part II Review Questions
Computer Science 210 Computer Organization
Unit 2 Boolean Algebra.
Boolean Algebra & De Morgan's Theorems
CHAPTER 2 Boolean Algebra
Doing some Boolean: On/Off
CS105 Introduction to Computer Concepts GATES and CIRCUITS
Computer Science 210 Computer Organization
Basic Logic Gates 1.
BASIC & COMBINATIONAL LOGIC CIRCUIT
Week 7: Gates and Circuits: PART II
Functions Computers take inputs and produce outputs, just like functions in math! Mathematical functions can be expressed in two ways: We can represent.
Lecture 20: Combinatorial Circuits I
Chapter 10.1 and 10.2: Boolean Algebra
Chapter 10.1 and 10.2: Boolean Algebra
Boolean Logic Boolean Logic is considered to be the basic of digital electronics. We know that a computer’s most basic operation is based on digital electronics.
A-level Computer Science
Chapter 10.3 and 10.4: Combinatorial Circuits
Dr. Clincy Professor of CS
From now on: Combinatorial Circuits:
Lecture 5 Binary Operation Boolean Logic. Binary Operations Addition Subtraction Multiplication Division.
Chapter 10.1 and 10.2: Boolean Algebra
Component 1 – 2A, B, C Binary Logic
DIGITAL ELECTRONICS AND LOGIC GATES. ANALOG SIGNAL:- Analog signal is continuous time varying current or voltage signal.
Example of a Combinatorial Circuit: A Multiplexer (MUX)
Presentation transcript:

Discrete Event Control 11/04/2017 Discrete Event Control CONTENTS 1. Introduction 2. State Diagram 3. Boolean Logical Equation Lecture note 7 discrete event control

Discrete Event Control 11/04/2017 Discrete Event Control Concept Representation DEC controller design DEC controller implementation Lecture note 7 discrete event control

Discrete Event Control: introduction 11/04/2017 Discrete Event Control: introduction DEC: All control variables are discrete variables, and their change is as a result of the occurrence of events. Multiple-input/multiple-output (MIMO) discrete logical controller, see Figure 1, where Ii is discrete value-based input variable, and Yi discrete value-based output. Ii and Yi only take value 0 (off) or 1 (on). Input and output devices are usually located at a distance from the controller. Discrete Logic Control system Y1 I2 Ip I1 Y2 Ym Discrete Event Control system Figure 1 Lecture note 7 discrete event control

Lecture note 7 discrete event control 11/04/2017 Introduction Figure 2 Level Limit Switch LLS Controller Input valve Level of Water Tank Figure 3 Lecture note 7 discrete event control

Lecture note 7 discrete event control 11/04/2017 Introduction We need a method to represent system dynamics, i.e. control system (including both plant and controller). However, in a discrete event driven system, plant (transient) dynamics is ignored. This means that when the valve is open, the water level seems to rise to a level instantly. Therefore, the control system for a discrete event driven system reduces to the controller only. goal  controller  plant  plant output State and state diagram is the method to represent system dynamics. Lecture note 7 discrete event control

Lecture note 7 discrete event control 11/04/2017 State Diagram States: indicators that system changes State Variables: assign a name to each independent class of states. EX 1: Switch. The switch is a state variable. It has two states (1, 0), where 1=on and 0=off. State change has a cause. State diagram (Fig. 4, Fig. 5) represents the state change with cause;I n particular, node: state; edge: cause. In this example, we define: LLS=0 for the level of liquid is below L LLS=1 for the level of liquid is above L Is LLS state variable? NO Lecture note 7 discrete event control

Lecture note 7 discrete event control State diagram 11/04/2017 Figure 4 Example system Figure 5 Lecture note 7 discrete event control

Lecture note 7 discrete event control 11/04/2017 State Diagram System has input, output, and itself. Fluid is a part of the system or total system. System itself includes components, e.g., valve, pump. System itself is represented by a set of state variables. The total system has fluid and device, and the device manipulates the fluid. Level of the fluid in the tank is the output of the plant (e.g., tank) or the plant control system (including both the plant and controller) and the input to the controller. In the time continuous system, the goal or reference variable such as L (in the tank example) is an input to the control system, while the level of the fluid is the output of the control system. Lecture note 7 discrete event control

State Diagram: how to identify the state variable 11/04/2017 State Diagram: how to identify the state variable Remain to see what is X and what is the output (to controller). Level of fluid: LLS Control system (X: state variable) Lecture note 7 discrete event control

Lecture note 7 discrete event control 11/04/2017 State Diagram Level of fluid: LLS Control system (X: state variable) X: state variable: valve. Output (for controller): X as well. So we have: output = state variable of the system Lecture note 7 discrete event control

Lecture note 7 discrete event control 11/04/2017 State Diagram It is noted that the two circles represent different states of one state variable (i.e., valve). The system in EX 1 has only one state variable. EX 2: In EX 1, if we introduce also the pump in the system. In particular, there is a piece of knowledge: when the valve is closed the pump must be off. We can sum up the desired control actions as follows: Pump Lecture note 7 discrete event control

Lecture note 7 discrete event control 11/04/2017 State Diagram State variables: X1: pump; X2: valve. X1: X1=0: pump off X1=1: pump on X2: X2=0: valve is closed X2=1: valve is open Lecture note 7 discrete event control

State Diagram (for controller) 11/04/2017 State Diagram (for controller) Open the valve if it is closed and the level of liquid in the tank is less than the desired level L (LLS=0), or keep the valve open if LLS=0. Close the valve if it is open and the level of liquid in the tank is equal to or greater than the desired level L (LLS=1), or keep the valve closed if LLS=1. Turn the pump on if it is off and the valve is open and LLS=0, or keep the pump on if it is already on and the valve is open and LLS=0. Turn the pump off if it is on and LLS=1, or keep the pump off if LLS=1. Lecture note 7 discrete event control

Lecture note 7 discrete event control 11/04/2017 State Diagram The above expressions of control action can be represented by two state variables, namely X1 (for pump) and X2 (for valve). X1=0, X2=0 (pump off, valve closed) X1=0, X2=1 (pump off, valve open) X1=1, X2=1 (pump on, valve open) Fig.6 shows the state diagram for EX 2. Lecture note 7 discrete event control

Lecture note 7 discrete event control 11/04/2017 State Diagram Figure 6 Put all state variables of the system in one circle Lecture note 7 discrete event control

Lecture note 7 discrete event control 11/04/2017 State Diagram Fig. 7 shows another way to represent the state diagram for EX 2. The features of Fig. 7 are: Each node represents one state variable with its value or state. A state variable can be the cause of changes for other state variables. Lecture note 7 discrete event control

Lecture note 7 discrete event control 11/04/2017 State Diagram Fig. 7 Remark: The meaning that the pump can never be on if the valve is closed is not represented by the state diagram. This shows a limitation of the state diagram Lecture note 7 discrete event control

Lecture note 7 discrete event control 11/04/2017 State Diagram Level of fluid: LLS Control system (X: state variable) X1: state variable: pump X2: state variable: valve Output (for controller): X1, X2 So we have: output = state variable Lecture note 7 discrete event control

State Diagram: Summary 11/04/2017 State Diagram: Summary I O Control system (X: state variable) I: a vector of inputs (for controller) O: a vector of outputs (for controller) X: a vector of state variables I and O are in general function of X. In a special case, O=X or I=X. Lecture note 7 discrete event control

State Diagram: Summary 11/04/2017 State Diagram: Summary State diagram involves logical variables that take 0 or 1 as their values. State diagram has nodes and edges. Each edge represents one cause or event for the state change in the corresponding nodes. The cause is also a representation of the logical variables. For instance, in Fig. 7, the cause can be written as: X2=1 and LLS =0. The state diagram has some limitation to express the meaning of the desired control action. A formal way or mathematical way to represent the meaning: If X2=1 AND LLS=0, X1 changes from 0 to 1. This desire leads us to think of Boolean algebra. The idea is to think of another way to represent the controller or control system. Lecture note 7 discrete event control

Boolean Logic Equations 11/04/2017 Boolean Logic Equations Let A and B be binary variables; that is, A, B=0, or 1. When A =1 (B=1) means that A is true (resp., B is true). A =0 (B=0) means that A is false (resp., B is false). Lecture note 7 discrete event control

Boolean Logic Equation – operational property 11/04/2017 Boolean Logic Equation – operational property A+B means that either A or B is true. Examples: A+B=0 when A=0 and B=0. A+B=1 otherwise. AB means that both A and B are true. Examples: AB=1 when A=1 and B=1. AB=0 otherwise. Not operation, by when A=0 when A=1 Lecture note 7 discrete event control