Synthesis from Quantitative Specifications
|
|
- Miles Shields
- 6 years ago
- Views:
Transcription
1 This reserch ws supported in prt by the Europen Reserch Council (ERC) Advnced Investigtor Grnt QUAREM nd by the Austrin Science Fund (FWF) project S11402-N23. Synthesis from Quntittive Specifictions Arjun Rdhkrishn Institute of Science nd Technology, Austri Mrch 11, 2012 Joint work with Pvol Černý, Thoms A. Henzinger, Sivknth Gopi, nd Nishnth Totl
2 Boolen Specifictions vs. Quntittive Specifictions Boolen Specifictions Bd Good
3 Boolen Specifictions vs. Quntittive Specifictions Boolen Specifictions Quntittive Specifictions Bd Good Preference
4 Boolen Specifictions vs. Quntittive Specifictions Boolen Specifictions Quntittive Specifictions Bd Good Preference Yes/No vs. Preference Order
5 Boolen Specifictions vs. Quntittive Specifictions Boolen Specifictions Quntittive Specifictions Bd Good Yes/No vs. Preference Order Preference Mny formlisms: Weighted Automt, Quntittive logics, Cost-Register Automt, Softwre Metrics, etc
6 Boolen Specifictions vs. Quntittive Specifictions Boolen Specifictions Quntittive Specifictions Bd Good Yes/No vs. Preference Order Preference Mny formlisms: Weighted Automt, Quntittive logics, Cost-Register Automt, Softwre Metrics, etc In this tlk: Rective systems + Behviourl metrics
7 Our formlism: Simultion distnces Specifiction: Idel boolen specifiction 1 [R. Milner. 1971]
8 Our formlism: Simultion distnces Specifiction: Idel boolen specifiction + Error Model 1 [R. Milner. 1971]
9 Our formlism: Simultion distnces Specifiction: Idel boolen specifiction + Error Model Extend the clssicl Simultion reltion 1 to Simultion distnces 1 [R. Milner. 1971]
10 Our formlism: Simultion distnces Specifiction: Idel boolen specifiction + Error Model Extend the clssicl Simultion reltion 1 to Simultion distnces Written s d E (I, S) if d E (I 1, S) < d E (I 2, S), then I 1 is preferred over I 2 1 [R. Milner. 1971]
11 Our formlism: Simultion distnces Idel Specifiction b b Implementtion Specifiction Error Penlty b (1) Error Model (0) 0 b b (0) b (1) Implementtion b b b
12 Our formlism: Simultion distnces Idel Specifiction b b b (1) Error Model (0) 0 b b (0) b (1) Implementtion b b b Implementtion Specifiction Error Penlty b
13 Our formlism: Simultion distnces Idel Specifiction b b Implementtion b Specifiction b Error Penlty 0 b (1) Error Model (0) 0 b b (0) b (1) Implementtion b b b
14 Our formlism: Simultion distnces Idel Specifiction b b b (1) Error Model (0) 0 b b (0) b (1) Implementtion b b b Implementtion b b Specifiction b b Error Penlty 0 0
15 Our formlism: Simultion distnces Idel Specifiction b b b (1) Error Model (0) 0 b b (0) b (1) Implementtion b b b Implementtion b b b Specifiction b b Error Penlty 0 0 1
16 Our formlism: Simultion distnces Idel Specifiction b b b (1) Error Model (0) 0 b b (0) b (1) Implementtion b b b Implementtion b b b Specifiction b b Error Penlty
17 Our formlism: Simultion distnces Idel Specifiction b b b (1) Error Model (0) 0 b b (0) b (1) Implementtion b b b Implementtion b b b... Specifiction b b... Error Penlty Limit-Averge Simultion Distnce = 1 / 4 = 0.25
18 Error Models nd Properties Boolen Error Model (0) b ( ) 0 b b (0) b ( )
19 Error Models nd Properties Delyed Grnt Model penlizes dely in grnt g/g(0) g/ g(0) g/g(1) g/ (0) g/ (1)
20 Error Models nd Properties Grnt Efficiency Error Model penlizes spurious grnts g g (1) g (0) 0 g g (0)
21 Why use quntittive specifictions? Exmple Every request req to be eventully grnted with gr. Φ = G(req = Fgr). 2 Tken from [I. Pill, S. Semprini, R. Cvd, M. Roveri, R. Bloem, nd A. Cimtti. FMCAD 2009] Arjun Rdhkrishn (IST Austri) Synthesis from Quntittive Specifictions Mrch / 13
22 Why use quntittive specifictions? Exmple Every request req to be eventully grnted with gr. Φ = G(req = Fgr). Additionl desire D 1 : We wnt to minimize spurious grnts 2. D 1 = gr W req G(gr = X( gr W req)). Simple requirement, but complicted to specify. 2 Tken from [I. Pill, S. Semprini, R. Cvd, M. Roveri, R. Bloem, nd A. Cimtti. FMCAD 2009] Arjun Rdhkrishn (IST Austri) Synthesis from Quntittive Specifictions Mrch / 13
23 Why use quntittive specifictions? Exmple Every request req to be eventully grnted with gr. Φ = G(req = Fgr). Additionl desire D 1 : We wnt to minimize spurious grnts 2. D 1 = gr W req G(gr = X( gr W req)). Simple requirement, but complicted to specify. Chnging requirement Φ to Φ GF (gr) full rewriting of D 1. 2 Tken from [I. Pill, S. Semprini, R. Cvd, M. Roveri, R. Bloem, nd A. Cimtti. FMCAD 2009] Arjun Rdhkrishn (IST Austri) Synthesis from Quntittive Specifictions Mrch / 13
24 Why use quntittive specifictions? Exmple Every request req to be eventully grnted with gr. Φ = G(req = Fgr). Additionl desire D 1 : We wnt to minimize spurious grnts 2. D 1 = gr W req G(gr = X( gr W req)). Simple requirement, but complicted to specify. Chnging requirement Φ to Φ GF (gr) full rewriting of D 1. Quntittive cse: dd one idel specifiction sying no grnts, nd error model penlizing ech grnt. No chnge is Φ chnges Specifying Wht insted of How 2 Tken from [I. Pill, S. Semprini, R. Cvd, M. Roveri, R. Bloem, nd A. Cimtti. FMCAD 2009] Arjun Rdhkrishn (IST Austri) Synthesis from Quntittive Specifictions Mrch / 13
25 Composing Requirements Synthesis on the Preto Curve Given specifiction-error model pirs (S i, E i ) nd weights µ i (0, 1), find (ɛ-)optiml implementtion I such tht mx i {µ i d Ei (I, S i )} is minimized.
26 Composing Requirements Synthesis on the Preto Curve Given specifiction-error model pirs (S i, E i ) nd weights µ i (0, 1), find (ɛ-)optiml implementtion I such tht mx i {µ i d Ei (I, S i )} is minimized. µ 1 = µ 2 S 2 µ 2 I µ 1 S 1
27 Composing Requirements Synthesis on the Preto Curve Given specifiction-error model pirs (S i, E i ) nd weights µ i (0, 1), find (ɛ-)optiml implementtion I such tht mx i {µ i d Ei (I, S i )} is minimized. µ 1 < µ 2 S 2 µ 2 I µ 1 S 1
28 Composing Requirements Synthesis on the Preto Curve Given specifiction-error model pirs (S i, E i ) nd weights µ i (0, 1), find (ɛ-)optiml implementtion I such tht mx i {µ i d Ei (I, S i )} is minimized. µ 1 > µ 2 µ 2 S 2 I µ 1 S 1
29 Composing Requirements Synthesis on the Preto Curve Given specifiction-error model pirs (S i, E i ) nd weights µ i (0, 1), find (ɛ-)optiml implementtion I such tht mx i {µ i d Ei (I, S i )} is minimized. S 2 µ 2 µ 1 S 1 I µ 3 S 3
30 Composing Requirements Synthesis on the Preto Curve Given specifiction-error model pirs (S i, E i ) nd weights µ i (0, 1), find (ɛ-)optiml implementtion I such tht mx i {µ i d Ei (I, S i )} is minimized. S 2 µ 2 µ 1 S 1 I µ 3 S 3 Solution: I is the (ɛ-)optiml finite memory strtegy in multi-dimensionl men-pyoff gme [K. Chtterjee. 30 minutes go.]
31 Protocol Trde-offs: Forwrd Error Correcting Codes FECs re protocols for error control in noisy chnnels. Our problem Send 3 bit integers over network Sy one bit-flip during trnsmission. Additionl complexity: Error in the MSB is worse thn n error in LSB.
32 Protocol Trde-offs: Forwrd Error Correcting Codes FECs re protocols for error control in noisy chnnels. Our problem Send 3 bit integers over network Sy one bit-flip during trnsmission. Additionl complexity: Error in the MSB is worse thn n error in LSB. Two conflicting quntittive requirements: Efficiency: Use lest bndwidth. Idel Specifiction: Only 3 bits trnsferred. Error model: Penlty 1 per dditionl bit.
33 Protocol Trde-offs: Forwrd Error Correcting Codes FECs re protocols for error control in noisy chnnels. Our problem Send 3 bit integers over network Sy one bit-flip during trnsmission. Additionl complexity: Error in the MSB is worse thn n error in LSB. Two conflicting quntittive requirements: Efficiency: Use lest bndwidth. Idel Specifiction: Only 3 bits trnsferred. Error model: Penlty 1 per dditionl bit. Robustness: Decode the integer right. Idel Specifiction: All bits re decoded properly Error model: Penlty of 4, 2 nd 1 for getting first, second nd third bits wrong.
34 Protocol Trde-offs: Forwrd Error Correcting Codes FECs re protocols for error control in noisy chnnels. Our problem Send 3 bit integers over network Sy one bit-flip during trnsmission. Additionl complexity: Error in the MSB is worse thn n error in LSB. Two conflicting quntittive requirements: Efficiency: Use lest bndwidth. Idel Specifiction: Only 3 bits trnsferred. Error model: Penlty 1 per dditionl bit. Robustness: Decode the integer right. Idel Specifiction: All bits re decoded properly Error model: Penlty of 4, 2 nd 1 for getting first, second nd third bits wrong. Additionl boolen specifictions for ensuring soundness
35 Synthesis of FECs: Results Vrying efficiency weight µ eff nd robustness weight µ rob.
36 Synthesis of FECs: Results Vrying efficiency weight µ eff nd robustness weight µ rob. Cse µrob >>> µ eff. Inefficient, but fully robust.
37 Synthesis of FECs: Results Vrying efficiency weight µ eff nd robustness weight µ rob. Cse µrob >>> µ eff. Inefficient, but fully robust. Cse µeff >>> µ rob. Fully efficient, but non-robust.
38 Synthesis of FECs: Results Vrying efficiency weight µ eff nd robustness weight µ rob. Cse µrob >>> µ eff. Inefficient, but fully robust. Cse µeff >>> µ rob. Fully efficient, but non-robust. Cse µ eff µ rob. In-between efficiency, nd gets MSB correct. Domin Generted protocol Correctness gurntee Overhed µ rob >> µ eff Hmming code full error correction 4 bits µ rob << µ eff Plin no error correction 0 bits µ rob µ eff TMR for MSB MSB is correct 2 bits Completely different protocols just by vrying weights. Key properties: Requirements re kept seprte. Bsic functionlity specified exctly. Advnced functionlity through preferences.
39 Incomptible Specifictions Specifictions rrely monolithic. Designer reconciles multiple requirements. Writes more detiled specifictions resolving corner cses nd contrdictions whole field of requirements engineering nd trcbility
40 Incomptible Specifictions... Continued Every request req 1 must be immeditely grnted with gr 1. Every request req 2 must be immeditely grnted with gr 2. Grnts gr 1 nd gr 2 cnnot occur t the sme time.
41 Incomptible Specifictions... Continued Every request req 1 must be immeditely grnted with gr 1. Every request req 2 must be immeditely grnted with gr 2. Grnts gr 1 nd gr 2 cnnot occur t the sme time. Designer resolution = (sy) by lternting between requests. G(r 1 r 2 = (g 1 g 2 )) G(r 1 r 2 g 1 = ( r 1 r 2 g 1 W r 1 r 2 g 2 )) G(r1 r 2 g 2 = ( r 1 r 2 g 2 W r 1 r 2 g 1 )).
42 Incomptible Specifictions... Continued Every request req 1 must be immeditely grnted with gr 1. Every request req 2 must be immeditely grnted with gr 2. Grnts gr 1 nd gr 2 cnnot occur t the sme time. Designer resolution = (sy) by lternting between requests. G(r 1 r 2 = (g 1 g 2 )) G(r 1 r 2 g 1 = ( r 1 r 2 g 1 W r 1 r 2 g 2 )) G(r1 r 2 g 2 = ( r 1 r 2 g 2 W r 1 r 2 g 1 )). How insted of Wht
43 Continued... Requirements now entngled. Chnging G(req 1 = gr 1 ) to G(req 1 = (gr 1 Xgr 1 )) Lots of rewriting.
44 Continued... Requirements now entngled. Chnging G(req 1 = gr 1 ) to G(req 1 = (gr 1 Xgr 1 )) Lots of rewriting. In quntittive cse, dd error models with equl penlties. Cn chnge one independently without chnging nything else.
45 Continued... Requirements now entngled. Chnging G(req 1 = gr 1 ) to G(req 1 = (gr 1 Xgr 1 )) Lots of rewriting. In quntittive cse, dd error models with equl penlties. Cn chnge one independently without chnging nything else. Chnging request priorities = vry specifiction weights
46 Conclusion Quntittive specifiction formlism Simultion Distnces Cn led to more compct specifictions specifying functionlity through preferences Synthesis from multiple quntittive specifictions Trde-offs in protocol synthesis Resolving corner-cse incomptibilities
CS415 Compilers. Lexical Analysis and. These slides are based on slides copyrighted by Keith Cooper, Ken Kennedy & Linda Torczon at Rice University
CS415 Compilers Lexicl Anlysis nd These slides re sed on slides copyrighted y Keith Cooper, Ken Kennedy & Lind Torczon t Rice University First Progrmming Project Instruction Scheduling Project hs een posted
More informationCS 275 Automata and Formal Language Theory
CS 275 Automt nd Forml Lnguge Theory Course Notes Prt II: The Recognition Problem (II) Chpter II.5.: Properties of Context Free Grmmrs (14) Anton Setzer (Bsed on book drft by J. V. Tucker nd K. Stephenson)
More informationMath 4310 Solutions to homework 1 Due 9/1/16
Mth 4310 Solutions to homework 1 Due 9/1/16 1. Use the Eucliden lgorithm to find the following gretest common divisors. () gcd(252, 180) = 36 (b) gcd(513, 187) = 1 (c) gcd(7684, 4148) = 68 252 = 180 1
More informationChapter 0. What is the Lebesgue integral about?
Chpter 0. Wht is the Lebesgue integrl bout? The pln is to hve tutoril sheet ech week, most often on Fridy, (to be done during the clss) where you will try to get used to the ides introduced in the previous
More informationFinite Automata Theory and Formal Languages TMV027/DIT321 LP4 2018
Finite Automt Theory nd Forml Lnguges TMV027/DIT321 LP4 2018 Lecture 10 An Bove April 23rd 2018 Recp: Regulr Lnguges We cn convert between FA nd RE; Hence both FA nd RE ccept/generte regulr lnguges; More
More informationDATA Search I 魏忠钰. 复旦大学大数据学院 School of Data Science, Fudan University. March 7 th, 2018
DATA620006 魏忠钰 Serch I Mrch 7 th, 2018 Outline Serch Problems Uninformed Serch Depth-First Serch Bredth-First Serch Uniform-Cost Serch Rel world tsk - Pc-mn Serch problems A serch problem consists of:
More informationMore on automata. Michael George. March 24 April 7, 2014
More on utomt Michel George Mrch 24 April 7, 2014 1 Automt constructions Now tht we hve forml model of mchine, it is useful to mke some generl constructions. 1.1 DFA Union / Product construction Suppose
More informationUNIFORM CONVERGENCE. Contents 1. Uniform Convergence 1 2. Properties of uniform convergence 3
UNIFORM CONVERGENCE Contents 1. Uniform Convergence 1 2. Properties of uniform convergence 3 Suppose f n : Ω R or f n : Ω C is sequence of rel or complex functions, nd f n f s n in some sense. Furthermore,
More informationFarey Fractions. Rickard Fernström. U.U.D.M. Project Report 2017:24. Department of Mathematics Uppsala University
U.U.D.M. Project Report 07:4 Frey Frctions Rickrd Fernström Exmensrete i mtemtik, 5 hp Hledre: Andres Strömergsson Exmintor: Jörgen Östensson Juni 07 Deprtment of Mthemtics Uppsl University Frey Frctions
More informationp-adic Egyptian Fractions
p-adic Egyptin Frctions Contents 1 Introduction 1 2 Trditionl Egyptin Frctions nd Greedy Algorithm 2 3 Set-up 3 4 p-greedy Algorithm 5 5 p-egyptin Trditionl 10 6 Conclusion 1 Introduction An Egyptin frction
More informationKNOWLEDGE-BASED AGENTS INFERENCE
AGENTS THAT REASON LOGICALLY KNOWLEDGE-BASED AGENTS Two components: knowledge bse, nd n inference engine. Declrtive pproch to building n gent. We tell it wht it needs to know, nd It cn sk itself wht to
More informationIntermediate Math Circles Wednesday, November 14, 2018 Finite Automata II. Nickolas Rollick a b b. a b 4
Intermedite Mth Circles Wednesdy, Novemer 14, 2018 Finite Automt II Nickols Rollick nrollick@uwterloo.c Regulr Lnguges Lst time, we were introduced to the ide of DFA (deterministic finite utomton), one
More informationProblem Set 7: Monopoly and Game Theory
ECON 000 Problem Set 7: Monopoly nd Gme Theory. () The monopolist will choose the production level tht mximizes its profits: The FOC of monopolist s problem is: So, the monopolist would set the quntity
More informationCS 330 Formal Methods and Models
CS 330 Forml Methods nd Models Dn Richrds, George Mson University, Spring 2017 Quiz Solutions Quiz 1, Propositionl Logic Dte: Ferury 2 1. Prove ((( p q) q) p) is tutology () (3pts) y truth tle. p q p q
More informationCS 188: Artificial Intelligence Spring 2007
CS 188: Artificil Intelligence Spring 2007 Lecture 3: Queue-Bsed Serch 1/23/2007 Srini Nrynn UC Berkeley Mny slides over the course dpted from Dn Klein, Sturt Russell or Andrew Moore Announcements Assignment
More information5. (±±) Λ = fw j w is string of even lengthg [ 00 = f11,00g 7. (11 [ 00)± Λ = fw j w egins with either 11 or 00g 8. (0 [ ffl)1 Λ = 01 Λ [ 1 Λ 9.
Regulr Expressions, Pumping Lemm, Right Liner Grmmrs Ling 106 Mrch 25, 2002 1 Regulr Expressions A regulr expression descries or genertes lnguge: it is kind of shorthnd for listing the memers of lnguge.
More informationChapter 14. Matrix Representations of Linear Transformations
Chpter 4 Mtrix Representtions of Liner Trnsformtions When considering the Het Stte Evolution, we found tht we could describe this process using multipliction by mtrix. This ws nice becuse computers cn
More information1 Nondeterministic Finite Automata
1 Nondeterministic Finite Automt Suppose in life, whenever you hd choice, you could try oth possiilities nd live your life. At the end, you would go ck nd choose the one tht worked out the est. Then you
More informationCS 330 Formal Methods and Models Dana Richards, George Mason University, Spring 2016 Quiz Solutions
CS 330 Forml Methods nd Models Dn Richrds, George Mson University, Spring 2016 Quiz Solutions Quiz 1, Propositionl Logic Dte: Ferury 9 1. (4pts) ((p q) (q r)) (p r), prove tutology using truth tles. p
More informationLecture 3: Equivalence Relations
Mthcmp Crsh Course Instructor: Pdric Brtlett Lecture 3: Equivlence Reltions Week 1 Mthcmp 2014 In our lst three tlks of this clss, we shift the focus of our tlks from proof techniques to proof concepts
More informationfractions Let s Learn to
5 simple lgebric frctions corne lens pupil retin Norml vision light focused on the retin concve lens Shortsightedness (myopi) light focused in front of the retin Corrected myopi light focused on the retin
More informationUninformed Search Lecture 4
Lecture 4 Wht re common serch strtegies tht operte given only serch problem? How do they compre? 1 Agend A quick refresher DFS, BFS, ID-DFS, UCS Unifiction! 2 Serch Problem Formlism Defined vi the following
More information4. GREEDY ALGORITHMS I
4. GREEDY ALGORITHMS I coin chnging intervl scheduling scheduling to minimize lteness optiml cching Lecture slides by Kevin Wyne Copyright 2005 Person-Addison Wesley http://www.cs.princeton.edu/~wyne/kleinberg-trdos
More informationCS 275 Automata and Formal Language Theory
CS 275 Automt nd Forml Lnguge Theory Course Notes Prt II: The Recognition Problem (II) Chpter II.6.: Push Down Automt Remrk: This mteril is no longer tught nd not directly exm relevnt Anton Setzer (Bsed
More informationReinforcement Learning
Reinforcement Lerning Tom Mitchell, Mchine Lerning, chpter 13 Outline Introduction Comprison with inductive lerning Mrkov Decision Processes: the model Optiml policy: The tsk Q Lerning: Q function Algorithm
More informationChapters 4 & 5 Integrals & Applications
Contents Chpters 4 & 5 Integrls & Applictions Motivtion to Chpters 4 & 5 2 Chpter 4 3 Ares nd Distnces 3. VIDEO - Ares Under Functions............................................ 3.2 VIDEO - Applictions
More informationAssignment 1 Automata, Languages, and Computability. 1 Finite State Automata and Regular Languages
Deprtment of Computer Science, Austrlin Ntionl University COMP2600 Forml Methods for Softwre Engineering Semester 2, 206 Assignment Automt, Lnguges, nd Computility Smple Solutions Finite Stte Automt nd
More informationRiemann is the Mann! (But Lebesgue may besgue to differ.)
Riemnn is the Mnn! (But Lebesgue my besgue to differ.) Leo Livshits My 2, 2008 1 For finite intervls in R We hve seen in clss tht every continuous function f : [, b] R hs the property tht for every ɛ >
More informationp(t) dt + i 1 re it ireit dt =
Note: This mteril is contined in Kreyszig, Chpter 13. Complex integrtion We will define integrls of complex functions long curves in C. (This is bit similr to [relvlued] line integrls P dx + Q dy in R2.)
More informationFault Modeling. EE5375 ADD II Prof. MacDonald
Fult Modeling EE5375 ADD II Prof. McDonld Stuck At Fult Models l Modeling of physicl defects (fults) simplify to logicl fult l stuck high or low represents mny physicl defects esy to simulte technology
More informationFirst Midterm Examination
Çnky University Deprtment of Computer Engineering 203-204 Fll Semester First Midterm Exmintion ) Design DFA for ll strings over the lphet Σ = {,, c} in which there is no, no nd no cc. 2) Wht lnguge does
More informationThe graphs of Rational Functions
Lecture 4 5A: The its of Rtionl Functions s x nd s x + The grphs of Rtionl Functions The grphs of rtionl functions hve severl differences compred to power functions. One of the differences is the behvior
More informationCOMPUTER SCIENCE TRIPOS
CST.2011.2.1 COMPUTER SCIENCE TRIPOS Prt IA Tuesdy 7 June 2011 1.30 to 4.30 COMPUTER SCIENCE Pper 2 Answer one question from ech of Sections A, B nd C, nd two questions from Section D. Submit the nswers
More informationexpression simply by forming an OR of the ANDs of all input variables for which the output is
2.4 Logic Minimiztion nd Krnugh Mps As we found ove, given truth tle, it is lwys possile to write down correct logic expression simply y forming n OR of the ANDs of ll input vriles for which the output
More informationQUADRATIC RESIDUES MATH 372. FALL INSTRUCTOR: PROFESSOR AITKEN
QUADRATIC RESIDUES MATH 37 FALL 005 INSTRUCTOR: PROFESSOR AITKEN When is n integer sure modulo? When does udrtic eution hve roots modulo? These re the uestions tht will concern us in this hndout 1 The
More informationAlgebra Readiness PLACEMENT 1 Fraction Basics 2 Percent Basics 3. Algebra Basics 9. CRS Algebra 1
Algebr Rediness PLACEMENT Frction Bsics Percent Bsics Algebr Bsics CRS Algebr CRS - Algebr Comprehensive Pre-Post Assessment CRS - Algebr Comprehensive Midterm Assessment Algebr Bsics CRS - Algebr Quik-Piks
More informationMATH 101A: ALGEBRA I PART B: RINGS AND MODULES 35
MATH 101A: ALGEBRA I PART B: RINGS AND MODULES 35 9. Modules over PID This week we re proving the fundmentl theorem for finitely generted modules over PID, nmely tht they re ll direct sums of cyclic modules.
More informationThe Regulated and Riemann Integrals
Chpter 1 The Regulted nd Riemnn Integrls 1.1 Introduction We will consider severl different pproches to defining the definite integrl f(x) dx of function f(x). These definitions will ll ssign the sme vlue
More informationState space systems analysis (continued) Stability. A. Definitions A system is said to be Asymptotically Stable (AS) when it satisfies
Stte spce systems nlysis (continued) Stbility A. Definitions A system is sid to be Asymptoticlly Stble (AS) when it stisfies ut () = 0, t > 0 lim xt () 0. t A system is AS if nd only if the impulse response
More informationLecture Notes PH 411/511 ECE 598 A. La Rosa Portland State University INTRODUCTION TO QUANTUM MECHANICS
Lecture Notes PH 4/5 ECE 598. L Ros Portlnd Stte University INTRODUCTION TO QUNTUM MECHNICS Underlying subject of the PROJECT ssignment: QUNTUM ENTNGLEMENT Fundmentls: EPR s view on the completeness of
More informationdt. However, we might also be curious about dy
Section 0. The Clculus of Prmetric Curves Even though curve defined prmetricly my not be function, we cn still consider concepts such s rtes of chnge. However, the concepts will need specil tretment. For
More informationGeometric Sequences. Geometric Sequence a sequence whose consecutive terms have a common ratio.
Geometric Sequences Geometric Sequence sequence whose consecutive terms hve common rtio. Geometric Sequence A sequence is geometric if the rtios of consecutive terms re the sme. 2 3 4... 2 3 The number
More informationW. We shall do so one by one, starting with I 1, and we shall do it greedily, trying
Vitli covers 1 Definition. A Vitli cover of set E R is set V of closed intervls with positive length so tht, for every δ > 0 nd every x E, there is some I V with λ(i ) < δ nd x I. 2 Lemm (Vitli covering)
More informationExtended nonlocal games from quantum-classical games
Extended nonlocl gmes from quntum-clssicl gmes Theory Seminr incent Russo niversity of Wterloo October 17, 2016 Outline Extended nonlocl gmes nd quntum-clssicl gmes Entngled vlues nd the dimension of entnglement
More informationLecture 1: Introduction to integration theory and bounded variation
Lecture 1: Introduction to integrtion theory nd bounded vrition Wht is this course bout? Integrtion theory. The first question you might hve is why there is nything you need to lern bout integrtion. You
More informationCS S-12 Turing Machine Modifications 1. When we added a stack to NFA to get a PDA, we increased computational power
CS411-2015S-12 Turing Mchine Modifictions 1 12-0: Extending Turing Mchines When we dded stck to NFA to get PDA, we incresed computtionl power Cn we do the sme thing for Turing Mchines? Tht is, cn we dd
More informationChapter 4 State-Space Planning
Leture slides for Automted Plnning: Theory nd Prtie Chpter 4 Stte-Spe Plnning Dn S. Nu CMSC 722, AI Plnning University of Mrylnd, Spring 2008 1 Motivtion Nerly ll plnning proedures re serh proedures Different
More information12.1 Nondeterminism Nondeterministic Finite Automata. a a b ε. CS125 Lecture 12 Fall 2016
CS125 Lecture 12 Fll 2016 12.1 Nondeterminism The ide of nondeterministic computtions is to llow our lgorithms to mke guesses, nd only require tht they ccept when the guesses re correct. For exmple, simple
More informationTheoretical foundations of Gaussian quadrature
Theoreticl foundtions of Gussin qudrture 1 Inner product vector spce Definition 1. A vector spce (or liner spce) is set V = {u, v, w,...} in which the following two opertions re defined: (A) Addition of
More informationStrong Bisimulation. Overview. References. Actions Labeled transition system Transition semantics Simulation Bisimulation
Strong Bisimultion Overview Actions Lbeled trnsition system Trnsition semntics Simultion Bisimultion References Robin Milner, Communiction nd Concurrency Robin Milner, Communicting nd Mobil Systems 32
More informationFrom LTL to Symbolically Represented Deterministic Automata
Motivtion nd Prolem Setting Determinizing Non-Confluent Automt Det. vi Automt Hierrchy From LTL to Symoliclly Represented Deterministic Automt Andres Morgenstern Klus Schneider Sven Lmerti Mnuel Gesell
More informationSolution for Assignment 1 : Intro to Probability and Statistics, PAC learning
Solution for Assignment 1 : Intro to Probbility nd Sttistics, PAC lerning 10-701/15-781: Mchine Lerning (Fll 004) Due: Sept. 30th 004, Thursdy, Strt of clss Question 1. Bsic Probbility ( 18 pts) 1.1 (
More informationEECS 141 Due 04/19/02, 5pm, in 558 Cory
UIVERSITY OF CALIFORIA College of Engineering Deprtment of Electricl Engineering nd Computer Sciences Lst modified on April 8, 2002 y Tufn Krlr (tufn@eecs.erkeley.edu) Jn M. Rey, Andrei Vldemirescu Homework
More informationCS 301. Lecture 04 Regular Expressions. Stephen Checkoway. January 29, 2018
CS 301 Lecture 04 Regulr Expressions Stephen Checkowy Jnury 29, 2018 1 / 35 Review from lst time NFA N = (Q, Σ, δ, q 0, F ) where δ Q Σ P (Q) mps stte nd n lphet symol (or ) to set of sttes We run n NFA
More informationA recursive construction of efficiently decodable list-disjunct matrices
CSE 709: Compressed Sensing nd Group Testing. Prt I Lecturers: Hung Q. Ngo nd Atri Rudr SUNY t Bufflo, Fll 2011 Lst updte: October 13, 2011 A recursive construction of efficiently decodble list-disjunct
More informationTemporal logic CTL : syntax. Communication and Concurrency Lecture 6. Φ ::= tt ff Φ 1 Φ 2 Φ 1 Φ 2 [K]Φ K Φ AG Φ EF Φ AF Φ EG Φ A formula can be
Temporl logic CTL : syntx Communiction nd Concurrency Lecture 6 Colin Stirling (cps) Φ ::= tt ff Φ 1 Φ Φ 1 Φ [K]Φ K Φ A formul cn be School of Informtics 7th October 013 Temporl logic CTL : syntx Temporl
More informationLinear Inequalities. Work Sheet 1
Work Sheet 1 Liner Inequlities Rent--Hep, cr rentl compny,chrges $ 15 per week plus $ 0.0 per mile to rent one of their crs. Suppose you re limited y how much money you cn spend for the week : You cn spend
More informationNotes on specifying systems in EST
Robert Meolic, Ttjn Kpus: Notes on specifying systems in EST 1 Notes on specifying systems in EST Robert Meolic, Ttjn Kpus Fculty of EE & CS University of Mribor Robert Meolic, Ttjn Kpus: Notes on specifying
More informationWe will see what is meant by standard form very shortly
THEOREM: For fesible liner progrm in its stndrd form, the optimum vlue of the objective over its nonempty fesible region is () either unbounded or (b) is chievble t lest t one extreme point of the fesible
More informationMath 8 Winter 2015 Applications of Integration
Mth 8 Winter 205 Applictions of Integrtion Here re few importnt pplictions of integrtion. The pplictions you my see on n exm in this course include only the Net Chnge Theorem (which is relly just the Fundmentl
More informationSection 6: Area, Volume, and Average Value
Chpter The Integrl Applied Clculus Section 6: Are, Volume, nd Averge Vlue Are We hve lredy used integrls to find the re etween the grph of function nd the horizontl xis. Integrls cn lso e used to find
More informationReinforcement learning II
CS 1675 Introduction to Mchine Lerning Lecture 26 Reinforcement lerning II Milos Huskrecht milos@cs.pitt.edu 5329 Sennott Squre Reinforcement lerning Bsics: Input x Lerner Output Reinforcement r Critic
More informationChapter Five: Nondeterministic Finite Automata. Formal Language, chapter 5, slide 1
Chpter Five: Nondeterministic Finite Automt Forml Lnguge, chpter 5, slide 1 1 A DFA hs exctly one trnsition from every stte on every symol in the lphet. By relxing this requirement we get relted ut more
More informationGlobal Session Types for Dynamic Checking of Protocol Conformance of Multi-Agent Systems
Globl Session Types for Dynmic Checking of Protocol Conformnce of Multi-Agent Systems (Extended Abstrct) Dvide Ancon, Mtteo Brbieri, nd Vivin Mscrdi DIBRIS, University of Genov, Itly emil: dvide@disi.unige.it,
More informationHarvard University Computer Science 121 Midterm October 23, 2012
Hrvrd University Computer Science 121 Midterm Octoer 23, 2012 This is closed-ook exmintion. You my use ny result from lecture, Sipser, prolem sets, or section, s long s you quote it clerly. The lphet is
More informationMinimal DFA. minimal DFA for L starting from any other
Miniml DFA Among the mny DFAs ccepting the sme regulr lnguge L, there is exctly one (up to renming of sttes) which hs the smllest possile numer of sttes. Moreover, it is possile to otin tht miniml DFA
More information#6A&B Magnetic Field Mapping
#6A& Mgnetic Field Mpping Gol y performing this lb experiment, you will: 1. use mgnetic field mesurement technique bsed on Frdy s Lw (see the previous experiment),. study the mgnetic fields generted by
More informationIndividual Contest. English Version. Time limit: 90 minutes. Instructions:
Elementry Mthemtics Interntionl Contest Instructions: Individul Contest Time limit: 90 minutes Do not turn to the first pge until you re told to do so. Write down your nme, your contestnt numer nd your
More informationMath 6455 Oct 10, Differential Geometry I Fall 2006, Georgia Tech
Mth 6455 Oct 10, 2006 1 Differentil Geometry I Fll 2006, Georgi Tech Lecture Notes 12 Riemnnin Metrics 0.1 Definition If M is smooth mnifold then by Riemnnin metric g on M we men smooth ssignment of n
More informationFormal Methods in Software Engineering
Forml Methods in Softwre Engineering Lecture 09 orgniztionl issues Prof. Dr. Joel Greenyer Decemer 9, 2014 Written Exm The written exm will tke plce on Mrch 4 th, 2015 The exm will tke 60 minutes nd strt
More informationQuantum Nonlocality Pt. 2: No-Signaling and Local Hidden Variables May 1, / 16
Quntum Nonloclity Pt. 2: No-Signling nd Locl Hidden Vriles My 1, 2018 Quntum Nonloclity Pt. 2: No-Signling nd Locl Hidden Vriles My 1, 2018 1 / 16 Non-Signling Boxes The primry lesson from lst lecture
More informationBases for Vector Spaces
Bses for Vector Spces 2-26-25 A set is independent if, roughly speking, there is no redundncy in the set: You cn t uild ny vector in the set s liner comintion of the others A set spns if you cn uild everything
More informationExam 2, Mathematics 4701, Section ETY6 6:05 pm 7:40 pm, March 31, 2016, IH-1105 Instructor: Attila Máté 1
Exm, Mthemtics 471, Section ETY6 6:5 pm 7:4 pm, Mrch 1, 16, IH-115 Instructor: Attil Máté 1 17 copies 1. ) Stte the usul sufficient condition for the fixed-point itertion to converge when solving the eqution
More informationPart 5 out of 5. Automata & languages. A primer on the Theory of Computation. Last week was all about. a superset of Regular Languages
Automt & lnguges A primer on the Theory of Computtion Lurent Vnbever www.vnbever.eu Prt 5 out of 5 ETH Zürich (D-ITET) October, 19 2017 Lst week ws ll bout Context-Free Lnguges Context-Free Lnguges superset
More informationNUMERICAL INTEGRATION
NUMERICAL INTEGRATION How do we evlute I = f (x) dx By the fundmentl theorem of clculus, if F (x) is n ntiderivtive of f (x), then I = f (x) dx = F (x) b = F (b) F () However, in prctice most integrls
More informationRiemann Sums and Riemann Integrals
Riemnn Sums nd Riemnn Integrls Jmes K. Peterson Deprtment of Biologicl Sciences nd Deprtment of Mthemticl Sciences Clemson University August 26, 2013 Outline 1 Riemnn Sums 2 Riemnn Integrls 3 Properties
More informationReversals of Signal-Posterior Monotonicity for Any Bounded Prior
Reversls of Signl-Posterior Monotonicity for Any Bounded Prior Christopher P. Chmbers Pul J. Hely Abstrct Pul Milgrom (The Bell Journl of Economics, 12(2): 380 391) showed tht if the strict monotone likelihood
More information1.4 Nonregular Languages
74 1.4 Nonregulr Lnguges The number of forml lnguges over ny lphbet (= decision/recognition problems) is uncountble On the other hnd, the number of regulr expressions (= strings) is countble Hence, ll
More information10. AREAS BETWEEN CURVES
. AREAS BETWEEN CURVES.. Ares etween curves So res ove the x-xis re positive nd res elow re negtive, right? Wrong! We lied! Well, when you first lern out integrtion it s convenient fiction tht s true in
More informationSTRUCTURE OF CONCURRENCY Ryszard Janicki. Department of Computing and Software McMaster University Hamilton, ON, L8S 4K1 Canada
STRUCTURE OF CONCURRENCY Ryszrd Jnicki Deprtment of Computing nd Softwre McMster University Hmilton, ON, L8S 4K1 Cnd jnicki@mcmster.c 1 Introduction Wht is concurrency? How it cn e modelled? Wht re the
More informationExercises with (Some) Solutions
Exercises with (Some) Solutions Techer: Luc Tesei Mster of Science in Computer Science - University of Cmerino Contents 1 Strong Bisimultion nd HML 2 2 Wek Bisimultion 31 3 Complete Lttices nd Fix Points
More informationQuadratic Forms. Quadratic Forms
Qudrtic Forms Recll the Simon & Blume excerpt from n erlier lecture which sid tht the min tsk of clculus is to pproximte nonliner functions with liner functions. It s ctully more ccurte to sy tht we pproximte
More informationset is not closed under matrix [ multiplication, ] and does not form a group.
Prolem 2.3: Which of the following collections of 2 2 mtrices with rel entries form groups under [ mtrix ] multipliction? i) Those of the form for which c d 2 Answer: The set of such mtrices is not closed
More informationNondeterminism and Nodeterministic Automata
Nondeterminism nd Nodeterministic Automt 61 Nondeterminism nd Nondeterministic Automt The computtionl mchine models tht we lerned in the clss re deterministic in the sense tht the next move is uniquely
More informationProperties of Integrals, Indefinite Integrals. Goals: Definition of the Definite Integral Integral Calculations using Antiderivatives
Block #6: Properties of Integrls, Indefinite Integrls Gols: Definition of the Definite Integrl Integrl Clcultions using Antiderivtives Properties of Integrls The Indefinite Integrl 1 Riemnn Sums - 1 Riemnn
More informationReliable Optimal Production Control with Cobb-Douglas Model
Relible Computing 4: 63 69, 998. 63 c 998 Kluwer Acdemic Publishers. Printed in the Netherlnds. Relible Optiml Production Control with Cobb-Dougls Model ZHIHUI HUEY HU Texs A&M University, College Sttion,
More informationRiemann Sums and Riemann Integrals
Riemnn Sums nd Riemnn Integrls Jmes K. Peterson Deprtment of Biologicl Sciences nd Deprtment of Mthemticl Sciences Clemson University August 26, 203 Outline Riemnn Sums Riemnn Integrls Properties Abstrct
More informationGeneralized Fano and non-fano networks
Generlized Fno nd non-fno networks Nildri Ds nd Brijesh Kumr Ri Deprtment of Electronics nd Electricl Engineering Indin Institute of Technology Guwhti, Guwhti, Assm, Indi Emil: {d.nildri, bkri}@iitg.ernet.in
More informationLCM AND HCF. Type - I. Type - III. Type - II
LCM AND HCF Type - I. The HCF nd LCM of two numbers re nd 9 respectively. Then the number of such pirs () 0 () () (SSC CGL Tier-I Exm. 0 Second Sitting). The product of two numbers 08 nd their HCF. The
More informationHomework Assignment 9 Solution Set
Homework Assignment 9 Solution Set PHYCS 44 3 Mrch, 4 Problem (Griffiths 77) The mgnitude of the current in the loop is loop = ε induced = Φ B = A B = π = π µ n (µ n) = π µ nk According to Lense s Lw this
More informationList all of the possible rational roots of each equation. Then find all solutions (both real and imaginary) of the equation. 1.
Mth Anlysis CP WS 4.X- Section 4.-4.4 Review Complete ech question without the use of grphing clcultor.. Compre the mening of the words: roots, zeros nd fctors.. Determine whether - is root of 0. Show
More informationMath 1B, lecture 4: Error bounds for numerical methods
Mth B, lecture 4: Error bounds for numericl methods Nthn Pflueger 4 September 0 Introduction The five numericl methods descried in the previous lecture ll operte by the sme principle: they pproximte the
More informationCS 188 Introduction to Artificial Intelligence Fall 2018 Note 7
CS 188 Introduction to Artificil Intelligence Fll 2018 Note 7 These lecture notes re hevily bsed on notes originlly written by Nikhil Shrm. Decision Networks In the third note, we lerned bout gme trees
More information1 Probability Density Functions
Lis Yn CS 9 Continuous Distributions Lecture Notes #9 July 6, 28 Bsed on chpter by Chris Piech So fr, ll rndom vribles we hve seen hve been discrete. In ll the cses we hve seen in CS 9, this ment tht our
More informationRelating logic to formal languages
Relting logic to forml lnguges Kml Lody The Institute of Mthemticl Sciences, Chenni October 2018 Reding 1. Howrd Strubing: Forml lnguges, finite utomt nd circuit complexity, birkhäuser. 2. Wolfgng Thoms:
More informationMath 120 Answers for Homework 13
Mth 12 Answers for Homework 13 1. In this problem we will use the fct tht if m f(x M on n intervl [, b] (nd if f is integrble on [, b] then (* m(b f dx M(b. ( The function f(x = 1 + x 3 is n incresing
More informationPreparation for A Level Wadebridge School
Preprtion for A Level Mths @ Wdebridge School Bridging the gp between GCSE nd A Level Nme: CONTENTS Chpter Removing brckets pge Chpter Liner equtions Chpter Simultneous equtions 6 Chpter Fctorising 7 Chpter
More informationAdvanced Calculus: MATH 410 Uniform Convergence of Functions Professor David Levermore 11 December 2015
Advnced Clculus: MATH 410 Uniform Convergence of Functions Professor Dvid Levermore 11 December 2015 12. Sequences of Functions We now explore two notions of wht it mens for sequence of functions {f n
More informationJDEP 384H: Numerical Methods in Business
BT 3.4: Solving Nonliner Systems Chpter 4: Numericl Integrtion: Deterministic nd Monte Crlo Methods Instructor: Thoms Shores Deprtment of Mthemtics Lecture 20, Februry 29, 2007 110 Kufmnn Center Instructor:
More information7.1 Integral as Net Change and 7.2 Areas in the Plane Calculus
7.1 Integrl s Net Chnge nd 7. Ares in the Plne Clculus 7.1 INTEGRAL AS NET CHANGE Notecrds from 7.1: Displcement vs Totl Distnce, Integrl s Net Chnge We hve lredy seen how the position of n oject cn e
More information