EECS 20 Lecture 36 (April 23, 2001) Tom Henzinger Safety Control.

Slides:



Advertisements
Similar presentations
The Geometry of a Tetrahedron
Advertisements

Supervisory Control of Hybrid Systems Written by X. D. Koutsoukos et al. Presented by Wu, Jian 04/16/2002.
Main Connectives The main connective of a sentence is the connective outside of any parentheses.
CSC401 – Analysis of Algorithms Lecture Notes 14 Graph Biconnectivity
Silberschatz, Galvin and Gagne  2002 Modified for CSCI 399, Royden, Operating System Concepts Operating Systems Lecture 30 Handling Deadlock.
EECS 20 Lecture 14 (February 16, 2001) Tom Henzinger Nondeterminism.
EECS 20 Lecture 38 (April 27, 2001) Tom Henzinger Review.
© Janice Regan, CMPT 102, Sept CMPT 102 Introduction to Scientific Computer Programming The software development method algorithms.
1 Introduction to Computability Theory Lecture15: Reductions Prof. Amos Israeli.
1 Introduction to Computability Theory Lecture12: Reductions Prof. Amos Israeli.
EECS 20 Lecture 15 (February 21, 2001) Tom Henzinger Simulation.
Interface-based Design of Embedded Systems Thomas A. Henzinger University of California, Berkeley.
EECS 20 Lecture 13 (February 14, 2001) Tom Henzinger Minimization.
Finite Automata Finite-state machine with no output. FA consists of States, Transitions between states FA is a 5-tuple Example! A string x is recognized.
1 On Generating Safe Controllers for Discrete-Time Linear Systems By Adam Cataldo EE 290N Project UC Berkeley December 10, 2004 unsafe state disable this.
EECS 20 Lecture 16 (February 26, 2001) Tom Henzinger Determinization.
Discrete Mathematics Lecture 7 Alexander Bukharovich New York University.
EECS 20 Lecture 1 (January 17, 2001) Tom Henzinger Motivation.
EECS 20 Lecture 8 (February 2, 2001) Tom Henzinger State Machines.
Dr. Muhammed Al-Mulhem 1ICS ICS 535 Design and Implementation of Programming Languages Part 1 Computability (Chapter 2) ICS 535 Design and Implementation.
Aho-Corasick String Matching An Efficient String Matching.
Memory. The logic and arithmetic circuits we’ve seen so far have no memory. They just transform input to output. Can we make circuits that remember? Memory.
September 17, 2009Theory of Computation Lecture 4: Programs and Computable Functions III 1 Macros Now we want to use macros of the form: W  f(V 1, …,
CS5371 Theory of Computation Lecture 8: Automata Theory VI (PDA, PDA = CFG)
Reflexive -- First sentence of proof is: (1) Let x  Z (2) Let (x,x)  R. (3) Let (x,x)  I (4) Let x  R.
EECS 20 Lecture 4 (January 24, 2001) Tom Henzinger Block Diagrams.
Grammars, Languages and Finite-state automata Languages are described by grammars We need an algorithm that takes as input grammar sentence And gives a.
EECS 20 Lecture 10 (February 7, 2001) Tom Henzinger Product Machines.
EECS 20 Lecture 37 (April 25, 2001) Tom Henzinger Progress Control.
EECS 20 Chapter 3 Sections State Machines Continued Last time we Introduced the deterministic finite state machine Discussed the concept of state.
EECS 20 Lecture 12 (February 12, 2001) Tom Henzinger Equivalence.
Finite State Machines Data Structures and Algorithms for Information Processing 1.
. PGM 2002/3 – Tirgul6 Approximate Inference: Sampling.
MATH 175: NUMERICAL ANALYSIS II Lecturer: Jomar Fajardo Rabajante IMSP, UPLB 2 nd Semester AY
Functions A B f( ) =. This Lecture We will define a function formally, and then in the next lecture we will use this concept in counting. We will also.
1-3 The Distance and Midpoint Formulas
MTH 104 Calculus and Analytical Geometry Lecture No. 2.
Ch. 9 Application to Control. 9.1 Introduction to Control Consider a causal linear time-invariant system with input x(t) and output y(t). Y(s) = Gp(s)X(s)
1 In this lecture we will compare two linearizing controller for a single-link robot: Linearization via Taylor Series Expansion Feedback Linearization.
Dina Workshop Analysing Properties of Hybrid Systems Rafael Wisniewski Aalborg University.
EE2420 – Digital Logic Summer II 2013 Hassan Salamy Ingram School of Engineering Texas State University Set 4: Other Gates.
Control Engineering Lecture# 10 & th April’2008.
Lines and angles Class-IX Prepared by: U. K, BAJPAI, TGT( Maths) K.V.,PITAMPURA.
12/13/20151 Computer Security Security Policies...
CSCI 115 Chapter 8 Topics in Graph Theory. CSCI 115 §8.1 Graphs.
1 Turing’s Thesis. 2 Turing’s thesis: Any computation carried out by mechanical means can be performed by a Turing Machine (1930)
CIS 540 Principles of Embedded Computation Spring Instructor: Rajeev Alur
Discrete Controller Design
January 20, 2016CS21 Lecture 71 CS21 Decidability and Tractability Lecture 7 January 20, 2016.
1 Simulation Scenarios. 2 Computer Based Experiments Systematically planning and conducting scientific studies that change experimental variables together.
Transparency No. 4-1 Formal Language and Automata Theory Chapter 4 Patterns, Regular Expressions and Finite Automata (include lecture 7,8,9) Transparency.
Binary Relations Definition: A binary relation R from a set A to a set B is a subset R ⊆ A × B. Example: Let A = { 0, 1,2 } and B = {a,b} {( 0, a), (
Prime and Composite Numbers A prime number is a natural number greater than 1 whose only factors are 1 and itself. The first few prime numbers are 2,
Turing Machine Model Are there computations that no “reasonable” computing machine can perform? –the machine should not store the answer to all possible.
Geometry 2.2 Segments. Silly Properties Reflexive Property –For any number a: a=a Symmetric Property –For any a and b: if a=b then b=a Transitive Property.
Theory of Computation Lecture 4: Programs and Computable Functions II
9.4(b) Notes: Triangle Midsegment Theorem
You found the relationship between the angle measures of a triangle. Recognize and apply properties of inequalities to the measures of the angles.
Intro to Theory of Computation
Motivation EECS 20 Lecture 1 (January 17, 2001) Tom Henzinger.
Theory Of Computer Science
The Programming Language L
State Machines EECS 20 Lecture 8 (February 2, 2001) Tom Henzinger.
Mathematics Unit 8: Triangles
Recap lecture 19 NFA corresponding to Closure of FA, Examples, Memory required to recognize a language, Example, Distinguishing one string from another,
Computer Vision Lecture 19: Object Recognition III
Theory of Computation Lecture 5: Programs and Computable Functions III
The Programming Language L
Theory of Computation Lecture 4: Programs and Computable Functions II
Group Members First Names
Presentation transcript:

EECS 20 Lecture 36 (April 23, 2001) Tom Henzinger Safety Control

The Control Problem Given Plant Objective

The Control Problem Find Plant Controller such that the composite (“closed-loop”) system satisfies the Objective

Simple Control Problems 1.LTI Plant 2.Finite-State Plant

Even Simple Linear Systems are Not Finite-State x: Nats 0  Realsy: Nats 0  Reals  z  Nats 0, y(z) = 0if z=0   (x(z-1) + x(z))if z>0 {

Even Simple Finite-State Systems are Not Linear x: Nats 0  Realsy: Nats 0  Reals  z  Nats 0, y(z) = x(z)if  z’  z, x(z’)  100 0if  z’  z, x(z’) > 100 {

i  100 / ii / 0 i > 100 / 0 ( “i” stands for any input value )

Simplest Finite-State Control Objective: SAFETY stay out of a set of undesirable plant states (the “error” states)

The Finite-State Safety Control Problem Given finite-state machine Plant set Error of states of Plant

The Finite-State Safety Control Problem Find finite-state machine Plant finite-state machine Controller such that the composite system never enters a state in Error

Step 1: Compute the “uncontrollable” states of Plant 1.Every state in Error is uncontrollable. 2.For all states s, if for all inputs i there exist an uncontrollable state s’ and an output o such that (s’,o)  possibleUpdates (s,i) then s is uncontrollable.

i/0 Error Plant 0/1 1/1 0/1 1/1 0/1 1/1 1/0 1/1 0/1 1/0 1/1 0/0

i/0 Error Plant 0/1 1/1 0/1 1/1 0/1 1/1 1/0 1/1 0/1 1/0 1/1 uncontrollable (cannot prevent error state from being entered in 1 transition) 0/0

i/0 Error Plant 0/1 1/1 0/1 1/1 0/1 1/1 1/0 1/1 0/1 1/0 1/1 uncontrollable (cannot prevent error state from being entered in 2 transitions) 0/0

i/0 Error Plant 0/1 1/1 0/1 1/1 0/1 1/1 1/0 1/1 0/1 1/0 1/1 Uncontrollable 0/0

i/0 Error Plant 0/1 1/1 0/1 1/1 0/1 1/1 1/0 1/1 0/1 1/0 1/1 Uncontrollable safe control inputs 0/0

Step 2: Design the Controller 1.For each controllable state s of the plant, choose one input i so that possibleUpdates (s,i) contains only controllable states.

r q p i/0 Plant 0/1 1/1 0/1 1/1 0/1 1/1 1/0 1/1 0/1 1/0 1/1 Uncontrollable chosen control inputs p : 1 q : 1 r : 0 0/0

Step 2: Design the Controller 1.For each controllable state s of the plant, choose one input i so that possibleUpdates (s,i) contains only controllable states. 2.Have the Controller keep track of the state of the Plant: If Plant is output-deterministic, then Controller looks exactly like the controllable part of Plant, with inputs and outputs swapped.

Plant r q p i/0 0/1 1/1 0/1 1/1 0/1 1/1 1/0 1/1 0/1 1/0 1/1 Uncontrollable Controller r q p 0/1 1/0 0/1 1/1 0/0

Plant r q p i/0 0/1 1/1 0/1 1/1 0/1 1/1 1/0 1/1 0/1 1/0 1/1 Uncontrollable Controller r q p 0/1 1/0 0/1 1/1 0/0 (the Controller can be made receptive in any way) 0/0

What if the Plant is not output-deterministic?

Plant r q p i/0 0/1 1/1 0/1 1/1 0/1 1/1 0/1 1/1 Uncontrollable Controller p,q p 1/1 0/1

Plant r q p i/0 0/1 1/1 0/1 1/1 0/1 1/1 0/1 1/1 Uncontrollable Controller p,q p 1/1 p,q,r 1/1 0/1

Plant r q p i/0 0/1 1/1 0/1 1/1 0/1 1/1 0/1 1/1 Uncontrollable Controller p,q p 1/1 p,q,r 1/1 Neither 0 nor 1 is safe ! 0/1

Plant r q p i/0 0/1 1/1 0/1 1/1 0/1 1/1 0/1 1/1 Uncontrollable 0/1

Plant r q p i/0 0/1 1/1 0/1 1/1 0/1 1/1 0/1 1/1 Uncontrollable 0/1 Controller p,r p 1/0

Plant r q p i/0 0/1 1/1 0/1 1/1 0/1 1/1 0/1 1/1 Uncontrollable 0/1 Controller p,r p 1/0

Step 2: Design the Controller 1.Let Controllable be the controllable states of the Plant. A subset S  Controllable is consistent if there is an input i such that for all states s  S, all states in possibleUpdates (s,i) are controllable. 2.Let M be the state machine whose states are the consistent subsets of Controllable. Prune from M the states that have no successor, until no more states can be pruned. 3.If the result contains possibleInitialStates (of the plant) as a state, then it is the desired Controller. Otherwise, no controller exists.

Plant r q p i/0 0/1 1/1 0/1 1/1 0/1 1/1 0/1 1/1 Uncontrollable 0/1 Consistent subsets {p} : 0, 1 {q} : 1 {r} : 0 {p,q} : 1 {p,r} : 0 {q,r}, {p,q,r} not consistent

Plant r q p i/0 0/1 1/1 0/1 1/1 0/1 1/1 0/1 1/1 Uncontrollable 0/1 pqr p,rp,q {p} : 0, 1 {q} : 1 {r} : 0 {p,q} : 1 {p,r} : 0

Plant r q p i/0 0/1 1/1 0/1 1/1 0/1 1/1 0/1 1/1 Uncontrollable 0/1 pqr p,rp,q {q} : 1 {r} : 0 {p,q} : 1 {p,r} : 0 1 0

Plant r q p i/0 0/1 1/1 0/1 1/1 0/1 1/1 0/1 1/1 Uncontrollable 0/1 pqr p,rp,q {r} : 0 {p,q} : 1 {p,r} :

Plant r q p i/0 0/1 1/1 0/1 1/1 0/1 1/1 0/1 1/1 Uncontrollable 0/1 pqr p,rp,q {p,q} : 1 {p,r} :

Plant r q p i/0 0/1 1/1 0/1 1/1 0/1 1/1 0/1 1/1 Uncontrollable 0/1 pqr p,r {p,r} : p,q

Plant r q p i/0 0/1 1/1 0/1 1/1 0/1 1/1 0/1 1/1 Uncontrollable 0/1 pqr p,r p,q 0

Plant r q p i/0 0/1 1/1 0/1 1/1 0/1 1/1 0/1 1/1 Uncontrollable 0/1 pqr p,r p,q 0

Plant r q p i/0 0/1 1/1 0/1 1/1 0/1 1/1 0/1 1/1 Uncontrollable 0/1 pqr p,r

Plant r q p i/0 0/1 1/1 0/1 1/1 0/1 1/1 0/1 1/1 Uncontrollable 0/1 p p,r 0 0

Plant r q p i/0 0/1 1/1 0/1 1/1 0/1 1/1 0/1 1/1 Uncontrollable 0/1 Controller p,r p i/0