Bisimulation, Games & Hennessy Milner logic p.1/32
|
|
- Elwin Jennings
- 5 years ago
- Views:
Transcription
1 Clil lnguge heory Biimulion, Gme & Henney Milner logi Leure 1 of Modelli Memii dei Proei Conorreni Pweł Sooińki Univeriy of Souhmon, UK I onerned rimrily wih lnguge, eg finie uom regulr lnguge; uhdown uom onex-free lnguge; uring mhine reurively enumerle lnguge; Thi i fine when we hink of n uomon/tm euenil roe whih h no inerion wih he ouide world during i omuion However, uom whih e he me lnguge n ehve very differenly o n ouide oerver Biimulion, Gme & Henney Milner logi 1/32 Biimulion, Gme & Henney Milner logi 2/32 The fmou offee mhine exmle Lelled rniion yem A lelled rniion yem (LTS) L i rile S, A, T where: Inerire oldi Cffè Bevnd l guo di è l limone S i e of e; A i e of ion; T S A S i he rniion relion We will normlly wrie for (,, ) T Lelled rniion yem generlie oh uom nd ree They re enrl rion of onurreny heory We will diu he oervion one n mke ou uh yem Biimulion, Gme & Henney Milner logi 3/32 Biimulion, Gme & Henney Milner logi 4/32 Tre reorder Given e of n LTS L, he word σ = α 1 α 2 α k A i re of when rniion α1 α2 αk 1 k 1 We will ue σ horhnd Suoe h L 1 nd L 2 re LTS The re reorder r S 1 S 2 i defined follow: Tre euivlene Tre euivlene i defined r = r r, ie r def = r r I i immedie h when L 1 = L 2, r i n euivlene relion on he e of n LTS Bu re re no enough: re euivlene i very ore, ine he offee mhine hve he me re r σ A σ σ Oervion 1 r i reflexive nd rniive r Biimulion, Gme & Henney Milner logi 5/32 Biimulion, Gme & Henney Milner logi 6/32
2 Simulion Suoe h L 1 nd L 2 re LTS A relion R S L1 S L2 i lled imulion whenever: Simulion exmle 1 Simulion i more eniive o rnhing (ie non-deerminim) hn re: if R nd hen here exi uh h nd R Oervion 2 The emy relion i imulion nd rirry union of imulion re imulion Similriy S 1 S 2 i defined he lrge imulion Euivlenly, iff here exi imulion R uh h (, ) R Oervion 3 Similriy i reflexive nd rniive Oervion 4 Simulion euivlene def = Biimulion, Gme & Henney Milner logi 7/32 Biimulion, Gme & Henney Milner logi 8/32 Simulion exmle 2 Bu i i no enirely ifory 1 2 Biimulion Suoe h L 1 nd L 2 re LTS A relion R S L1 S L2 i lled iimulion whenever: (i) if R nd hen here exi uh h nd R ; (ii) if R nd hen here exi uh h nd R Lemm 5 R i iimulion iff R nd R o re imulion r 1 r 2 r 1 r 2 r 1 Biimulion, Gme & Henney Milner logi 9/32 Biimulion, Gme & Henney Milner logi 10/32 Proerie of iimulion Exmle of iimulion, 1 Lemm 6 i iimulion Proof Vouly rue Lemm 7 If {R i } i I re fmily of iimulion hen i I R i i iimulion Proof Le R = i I R i Suoe R hen here exi k uh h R k In riulr, R k nd o R, hu R i ymmeri If hen here exi uh h nd R k Bu R k imlie R Corollry 8 There exi lrge iimulion I i lled iimilriy If L 1 = L 2 hen iimilriy i n euivlene relion Lemm Proof R = { (, i ) i N } i iimulion Biimulion, Gme & Henney Milner logi 11/32 Biimulion, Gme & Henney Milner logi 12/32
3 Exmle of iimulion, 2 Reoning ou iimilriy To how h e, re iimilr i uffie o find iimulion R whih rele nd ; I i le ler how o how h nd re no iimilr, one n: enumere ll he relion whih onin (, ) nd how h none of hem re iimulion; enumere ll he iimulion nd how h none of hem onin (, ); orrow ome ehiniue from gme heory Biimulion, Gme & Henney Milner logi 13/32 Biimulion, Gme & Henney Milner logi 14/32 Biimulion gme, 1 Biimulion gme, 2 We re given wo LTS L 1, L 2 The onfigurion i ir of e (, ), L 1, L 2 The iimulion gme h wo lyer: P nd R A round of he gme roeed follow: (i) R hooe eiher or ; (ii) uming i hoe, i nex hooe rniion ; (iii) P mu hooe rniion wih he me lel in he oher LTS, ie uming R hoe, i mu find rniion ; (iv) he round i reeed, reling (, ) wih (, ) Rule: An infinie gme i win for P R win iff he gme ge ino round where P nno reond wih rniion in e (iii) Oervion 10 For eh onfigurion (, ), eiher P or R h winning regy Theorem 11 iff P h winning regy ( iff R h winning regy) Biimulion, Gme & Henney Milner logi 15/32 Biimulion, Gme & Henney Milner logi 16/32 P h winning regy P h winning regy Le GE def = { (, ) P h winning regy } Suoe h (, ) GE nd Suoe h here doe no exi rniion uh h (, ) GE Then R n hooe he rniion nd P nno reond in wy whih kee him in winnle oiion Bu hi onrdi he f h h P h winning regy for he gme ring wih (, ) Thu GE i iimulion Biimulion re winning regie: If hen here exi iimulion R uh h (, ) R Whever move R mke, P n lwy mke move uh h he reul i in R Clerly, hi i winning regy for P Biimulion, Gme & Henney Milner logi 17/32 Biimulion, Gme & Henney Milner logi 18/32
4 Exmle of non iimilr e Similriy nd iimilriy Biimilriy i rnhing-eniive Theorem 12 nd in generl he inluion i ri Proof Any iimulion nd i ooie re lerly imulion On he oher hnd, he following exmle how h iimilriy i finer hn imulion euivlene 1 2 r 1 r 2 r 1 r r 1 r 2 r 1 r 1 r 2 Biimulion, Gme & Henney Milner logi 19/32 Biimulion, Gme & Henney Milner logi 20/32 Re: euivlene Henney Milner logi r Biimilriy i he fine (=eue le) euivlene we hve onidered Clim 13 Biimilriy i he fine reonle euivlene, where reonle men h we n oerve only he ehviour nd no he e-e We will give lnguge, he o-lled Henney Milner logi, whih derie oervion/exerimen on LTS Biimulion, Gme & Henney Milner logi 21/32 Suoe h A i e of ion Le L ::= []L L L L L L L Given n LTS we define he emni y ruurl induion over he formul ϕ: [A]ϕ if for ll uh h we hve ϕ; A ϕ if here exi uh h nd ϕ; ϕ if i i no he e h ϕ; ϕ 1 ϕ 2 if ϕ 1 or ϕ 2 ; ϕ 1 ϕ 2 if ϕ 1 nd ϕ 2 ; lwy; never; Biimulion, Gme & Henney Milner logi 22/32 HM logi exmle formul Bi roerie of HM logi n erform rniion lelled wih ; [] nno erform rniion lelled wih ; [] n erform rniion lelled wih o e from whih here re no lelled rniion ([] )? Lemm 14 ( De Morgn lw for HM logi) [] = ; = [] ; = ( ); = ( ); = ; = In riulr, o ge he full logi i uffie o onider ju he ue {,,, } or {[],,, } or {, [],,,, } Biimulion, Gme & Henney Milner logi 23/32 Biimulion, Gme & Henney Milner logi 24/32
5 Diinguihing formul Logil euivlene Definiion 15 The logil reorder L i relion on he e of n LTS defined follow: 1 2 < L iff ϕ ϕ ϕ r1 r2 r1 r2 ( ) ( ) 1 2 r1 r2 r1 r 1 r2 I i lerly reflexive nd rniive Definiion 16 Logil euivlene i L def = L L I i n euivlene relion Oervion 17 Aully, for HM, L = L = L Thi i oneuene of hving negion Proof Suoe L nd ϕ If ϕ hen ϕ, hene ϕ hene ϕ, onrdiion Hene ϕ ( ) ( ) Biimulion, Gme & Henney Milner logi 25/32 Biimulion, Gme & Henney Milner logi 26/32 Henney Milner & Biimulion Soundne Definiion 18 An LTS i id o hve finie imge when from ny e, he numer of e rehle i finie Theorem 19 (Henney Milner) Le L e n LTS wih finie imge Then L = To rove hi, we need o how: Soundne ( L ): If wo e ify he me formul hen hey re iimilr Comleene ( L ): If wo e re iimilr hen hey ify he me formul Remrk 20 Comleene hold in generl The finie imge umion i needed only for oundne L (Soundne) I uffie o how h L i iimulion We will rely on imge finiene Suoe h L nd Then nd o hu here i le one uh h The e of ll uh i lo finie y he exr umion le hi e e { 1,, k } Suoe h for ll i we hve h L i Then ϕ i uh h ϕ i nd i ϕ i Thu while i k ϕ i we mu hve i k ϕ i, onrdiion Hene here exi i uh h i nd L i Biimulion, Gme & Henney Milner logi 27/32 Biimulion, Gme & Henney Milner logi 28/32 Comleene 1 Comleene 2 L (Comleene) We will how hi < L y ruurl induion on formul Be: hen Alo, hen Induion: Modliie ( nd []): If ϕ hen nd ϕ By umion, here exi uh h nd By induive hyohei ϕ nd o ϕ If []ϕ hen whenever hen ϕ Fir, noie h imlie h if hen here exi uh h wih Sine ϕ, lo ϕ Hene []ϕ Prooiionl onneive ( nd ): if ϕ 1 ϕ 2 hen ϕ 1 or ϕ 2 If i i he fir hen y he induive hyohei ϕ 1, if he eond hen ϕ 2 ; hu ϕ 1 ϕ 2 if ϕ 2 ϕ 2 i imilr Noe h omleene doe no need he finie imge umion hu iimilr e lwy ify he me formul In he roof, we ued he f h {, [],,,, } i enough for ll of HM logi Biimulion, Gme & Henney Milner logi 29/32 Biimulion, Gme & Henney Milner logi 30/32
6 Imge finiene Sulogi of HM The heorem rek down wihou hi umion: 1 } k ime 2 } k ime L r ::= L r Theorem 21 Logil reorder on L r oinide wih he re reorder L ::= L L L Theorem 22 Logil reorder on L oniide wih he imulion reorder Ey o hek, uing he iimulion gme, h 1 2 Soluion: Inrodue infinie onjunion o he logi Biimulion, Gme & Henney Milner logi 31/32 Biimulion, Gme & Henney Milner logi 32/32
Bisimulation, Games & Hennessy Milner logic
Bisimultion, Gmes & Hennessy Milner logi Leture 1 of Modelli Mtemtii dei Proessi Conorrenti Pweł Soboiński Univeristy of Southmpton, UK Bisimultion, Gmes & Hennessy Milner logi p.1/32 Clssil lnguge theory
More informationSolutions to assignment 3
D Sruure n Algorihm FR 6. Informik Sner, Telikeplli WS 03/04 hp://www.mpi-.mpg.e/~ner/oure/lg03/inex.hml Soluion o ignmen 3 Exerie Arirge i he ue of irepnie in urreny exhnge re o rnform one uni of urreny
More informationCSC 373: Algorithm Design and Analysis Lecture 9
CSC 373: Algorihm Deign n Anlyi Leure 9 Alln Boroin Jnury 28, 2013 1 / 16 Leure 9: Announemen n Ouline Announemen Prolem e 1 ue hi Friy. Term Te 1 will e hel nex Mony, Fe in he uoril. Two nnounemen o follow
More informationMaximum Flow. Flow Graph
Mximum Flow Chper 26 Flow Grph A ommon enrio i o ue grph o repreen flow nework nd ue i o nwer queion ou meril flow Flow i he re h meril move hrough he nework Eh direed edge i ondui for he meril wih ome
More informationBipartite Matching. Matching. Bipartite Matching. Maxflow Formulation
Mching Inpu: undireced grph G = (V, E). Biprie Mching Inpu: undireced, biprie grph G = (, E).. Mching Ern Myr, Hrld äcke Biprie Mching Inpu: undireced, biprie grph G = (, E). Mflow Formulion Inpu: undireced,
More information4.8 Improper Integrals
4.8 Improper Inegrls Well you ve mde i hrough ll he inegrion echniques. Congrs! Unforunely for us, we sill need o cover one more inegrl. They re clled Improper Inegrls. A his poin, we ve only del wih inegrls
More informatione t dt e t dt = lim e t dt T (1 e T ) = 1
Improper Inegrls There re wo ypes of improper inegrls - hose wih infinie limis of inegrion, nd hose wih inegrnds h pproch some poin wihin he limis of inegrion. Firs we will consider inegrls wih infinie
More informationLAPLACE TRANSFORMS. 1. Basic transforms
LAPLACE TRANSFORMS. Bic rnform In hi coure, Lplce Trnform will be inroduced nd heir properie exmined; ble of common rnform will be buil up; nd rnform will be ued o olve ome dierenil equion by rnforming
More informationGraduate Algorithms CS F-18 Flow Networks
Grue Algorihm CS673-2016F-18 Flow Nework Dvi Glle Deprmen of Compuer Siene Univeriy of Sn Frnio 18-0: Flow Nework Diree Grph G Eh ege weigh i piy Amoun of wer/eon h n flow hrough pipe, for inne Single
More informationChapter Introduction. 2. Linear Combinations [4.1]
Chper 4 Inrouion Thi hper i ou generlizing he onep you lerne in hper o pe oher n hn R Mny opi in hi hper re heoreil n MATLAB will no e le o help you ou You will ee where MATLAB i ueful in hper 4 n how
More informationCS3510 Design & Analysis of Algorithms Fall 2017 Section A. Test 3 Solutions. Instructor: Richard Peng In class, Wednesday, Nov 15, 2017
Uer ID (NOT he 9 igi numer): gurell4 CS351 Deign & Anlyi of Algorihm Fll 17 Seion A Te 3 Soluion Inruor: Rihr Peng In l, Weney, Nov 15, 17 Do no open hi quiz ookle unil you re iree o o o. Re ll he inruion
More informationEECE 301 Signals & Systems Prof. Mark Fowler
EECE 31 Signal & Syem Prof. Mark Fowler Noe Se #27 C-T Syem: Laplace Tranform Power Tool for yem analyi Reading Aignmen: Secion 6.1 6.3 of Kamen and Heck 1/18 Coure Flow Diagram The arrow here how concepual
More informationLaplace Transform. Inverse Laplace Transform. e st f(t)dt. (2)
Laplace Tranform Maoud Malek The Laplace ranform i an inegral ranform named in honor of mahemaician and aronomer Pierre-Simon Laplace, who ued he ranform in hi work on probabiliy heory. I i a powerful
More informationRandomized Perfect Bipartite Matching
Inenive Algorihm Lecure 24 Randomized Perfec Biparie Maching Lecurer: Daniel A. Spielman April 9, 208 24. Inroducion We explain a randomized algorihm by Ahih Goel, Michael Kapralov and Sanjeev Khanna for
More informationTutorial 2 Euler Lagrange ( ) ( ) In one sentence: d dx
Tutoril 2 Euler Lgrnge In one entene: d Fy = F d Importnt ft: ) The olution of EL eqution i lled eterml. 2) Minmum / Mimum of the "Mot Simple prolem" i lo n eterml. 3) It i eier to olve EL nd hek if we
More informationALG 5.3 Flow Algorithms:
ALG 5. low Algorihm: () Mx-flow, min-u Theorem () Augmening Ph () 0 - flow (d) Verex Conneiviy (e) Plnr low Min Reding Seleion: CLR, Chper 7 Algorihm Profeor John Reif Auxillry Reding Seleion: Hndou: "Nework
More informationIntroduction to SLE Lecture Notes
Inroducion o SLE Lecure Noe May 13, 16 - The goal of hi ecion i o find a ufficien condiion of λ for he hull K o be generaed by a imple cure. I urn ou if λ 1 < 4 hen K i generaed by a imple curve. We will
More information1 The Network Flow Problem
5-5/65: Deign & Anlyi of Algorihm Ooer 5, 05 Leure #0: Nework Flow I l hnged: Ooer 5, 05 In hee nex wo leure we re going o lk ou n imporn lgorihmi prolem lled he Nework Flow Prolem. Nework flow i imporn
More informationTransformations. Ordered set of numbers: (1,2,3,4) Example: (x,y,z) coordinates of pt in space. Vectors
Trnformion Ordered e of number:,,,4 Emple:,,z coordine of p in pce. Vecor If, n i i, K, n, i uni ecor Vecor ddiion +w, +, +, + V+w w Sclr roduc,, Inner do roduc α w. w +,.,. The inner produc i SCLR!. w,.,
More informationENGR 1990 Engineering Mathematics The Integral of a Function as a Function
ENGR 1990 Engineering Mhemics The Inegrl of Funcion s Funcion Previously, we lerned how o esime he inegrl of funcion f( ) over some inervl y dding he res of finie se of rpezoids h represen he re under
More informationFlow networks. Flow Networks. A flow on a network. Flow networks. The maximum-flow problem. Introduction to Algorithms, Lecture 22 December 5, 2001
CS 545 Flow Nework lon Efra Slide courey of Charle Leieron wih mall change by Carola Wenk Flow nework Definiion. flow nework i a direced graph G = (V, E) wih wo diinguihed verice: a ource and a ink. Each
More informationREAL ANALYSIS I HOMEWORK 3. Chapter 1
REAL ANALYSIS I HOMEWORK 3 CİHAN BAHRAN The quesions re from Sein nd Shkrchi s e. Chper 1 18. Prove he following sserion: Every mesurble funcion is he limi.e. of sequence of coninuous funcions. We firs
More informationPrimal and Weakly Primal Sub Semi Modules
Aein Inenionl Jounl of Conepoy eeh Vol 4 No ; Jnuy 204 Pil nd Wekly Pil ub ei odule lik Bineh ub l hei Depen Jodn Univeiy of iene nd Tehnology Ibid 220 Jodn Ab Le be ouive eiing wih ideniy nd n -ei odule
More informationHadamard-Type Inequalities for s-convex Functions
Interntionl Mthemtil Forum, 3, 008, no. 40, 965-975 Hdmrd-Type Inequlitie or -Convex Funtion Mohmmd Alomri nd Mlin Dru Shool o Mthemtil Siene Fulty o Siene nd Tehnology Univeriti Kebngn Mlyi Bngi 43600
More informationMax Flow, Min Cut COS 521. Kevin Wayne Fall Soviet Rail Network, Cuts. Minimum Cut Problem. Flow network.
Sovie Rail Nework, Max Flow, Min u OS Kevin Wayne Fall Reference: On he hiory of he ranporaion and maximum flow problem. lexander Schrijver in Mah Programming, :,. Minimum u Problem u Flow nework.! Digraph
More informationSeptember 20 Homework Solutions
College of Engineering nd Compuer Science Mechnicl Engineering Deprmen Mechnicl Engineering A Seminr in Engineering Anlysis Fll 7 Number 66 Insrucor: Lrry Creo Sepember Homework Soluions Find he specrum
More informationIntroduction to Congestion Games
Algorihmic Game Theory, Summer 2017 Inroducion o Congeion Game Lecure 1 (5 page) Inrucor: Thoma Keelheim In hi lecure, we ge o know congeion game, which will be our running example for many concep in game
More informationANSWERS TO EVEN NUMBERED EXERCISES IN CHAPTER 2
ANSWERS TO EVEN NUMBERED EXERCISES IN CHAPTER Seion Eerise -: Coninuiy of he uiliy funion Le λ ( ) be he monooni uiliy funion defined in he proof of eisene of uiliy funion If his funion is oninuous y hen
More informationON DIFFERENTIATION OF A LEBESGUE INTEGRAL WITH RESPECT TO A PARAMETER
Mh. Appl. 1 (2012, 91 116 ON DIFFERENTIATION OF A LEBESGUE INTEGRAL WITH RESPECT TO A PARAMETER JIŘÍ ŠREMR Abr. The im of hi pper i o diu he bolue oninuiy of erin ompoie funion nd differeniion of Lebegue
More informationCS 573 Automata Theory and Formal Languages
Non-determinism Automt Theory nd Forml Lnguges Professor Leslie Lnder Leture # 3 Septemer 6, 2 To hieve our gol, we need the onept of Non-deterministi Finite Automton with -moves (NFA) An NFA is tuple
More informationWhen analyzing an object s motion there are two factors to consider when attempting to bring it to rest. 1. The object s mass 2. The object s velocity
SPH4U Momenum LoRuo Momenum i an exenion of Newon nd law. When analyzing an ojec moion here are wo facor o conider when aeming o ring i o re.. The ojec ma. The ojec velociy The greaer an ojec ma, he more
More informationMath 2142 Exam 1 Review Problems. x 2 + f (0) 3! for the 3rd Taylor polynomial at x = 0. To calculate the various quantities:
Mah 4 Eam Review Problems Problem. Calculae he 3rd Taylor polynomial for arcsin a =. Soluion. Le f() = arcsin. For his problem, we use he formula f() + f () + f ()! + f () 3! for he 3rd Taylor polynomial
More informationAlgorithmic Discrete Mathematics 6. Exercise Sheet
Algorihmic Dicree Mahemaic. Exercie Shee Deparmen of Mahemaic SS 0 PD Dr. Ulf Lorenz 7. and 8. Juni 0 Dipl.-Mah. David Meffer Verion of June, 0 Groupwork Exercie G (Heap-Sor) Ue Heap-Sor wih a min-heap
More informationFall 2014 David Wagner 10/31 Notes. The min-cut problem. Examples
CS 7 Algorihm Fll 24 Dvid Wgner /3 Noe The min-u problem Le G = (V,E) be direed grph, wih oure verex V nd ink verex V. Aume h edge re lbelled wih o, whih n be modelled o funion : E N h oie non-negive inegrl
More informationINTEGRALS. Exercise 1. Let f : [a, b] R be bounded, and let P and Q be partitions of [a, b]. Prove that if P Q then U(P ) U(Q) and L(P ) L(Q).
INTEGRALS JOHN QUIGG Eercise. Le f : [, b] R be bounded, nd le P nd Q be priions of [, b]. Prove h if P Q hen U(P ) U(Q) nd L(P ) L(Q). Soluion: Le P = {,..., n }. Since Q is obined from P by dding finiely
More informationContraction Mapping Principle Approach to Differential Equations
epl Journl of Science echnology 0 (009) 49-53 Conrcion pping Principle pproch o Differenil Equions Bishnu P. Dhungn Deprmen of hemics, hendr Rn Cmpus ribhuvn Universiy, Khmu epl bsrc Using n eension of
More informationLecture 2: Network Flow. c 14
Comp 260: Avne Algorihms Tufs Universiy, Spring 2016 Prof. Lenore Cowen Srie: Alexner LeNil Leure 2: Nework Flow 1 Flow Neworks s 16 12 13 10 4 20 14 4 Imgine some nework of pipes whih rry wer, represene
More informationFlow Networks Alon Efrat Slides courtesy of Charles Leiserson with small changes by Carola Wenk. Flow networks. Flow networks CS 445
CS 445 Flow Nework lon Efr Slide corey of Chrle Leieron wih mll chnge by Crol Wenk Flow nework Definiion. flow nework i direced grph G = (V, E) wih wo diingihed erice: orce nd ink. Ech edge (, ) E h nonnegie
More informationSome basic notation and terminology. Deterministic Finite Automata. COMP218: Decision, Computation and Language Note 1
COMP28: Decision, Compuion nd Lnguge Noe These noes re inended minly s supplemen o he lecures nd exooks; hey will e useful for reminders ou noion nd erminology. Some sic noion nd erminology An lphe is
More informationOn a problem of Graham By E. ERDŐS and E. SZEMERÉDI (Budapest) GRAHAM stated the following conjecture : Let p be a prime and a 1,..., ap p non-zero re
On a roblem of Graham By E. ERDŐS and E. SZEMERÉDI (Budaes) GRAHAM saed he following conjecure : Le be a rime and a 1,..., a non-zero residues (mod ). Assume ha if ' a i a i, ei=0 or 1 (no all e i=0) is
More informationCS4445/9544 Analysis of Algorithms II Solution for Assignment 1
Conider he following flow nework CS444/944 Analyi of Algorihm II Soluion for Aignmen (0 mark) In he following nework a minimum cu ha capaciy 0 Eiher prove ha hi aemen i rue, or how ha i i fale Uing he
More informationA Kalman filtering simulation
A Klmn filering simulion The performnce of Klmn filering hs been esed on he bsis of wo differen dynmicl models, ssuming eiher moion wih consn elociy or wih consn ccelerion. The former is epeced o beer
More informationGuest Lectures for Dr. MacFarlane s EE3350 Part Deux
Gues Lecures for Dr. MacFarlane s EE3350 Par Deux Michael Plane Mon., 08-30-2010 Wrie name in corner. Poin ou his is a review, so I will go faser. Remind hem o go lisen o online lecure abou geing an A
More informationDiscussion Session 2 Constant Acceleration/Relative Motion Week 03
PHYS 100 Dicuion Seion Conan Acceleraion/Relaive Moion Week 03 The Plan Today you will work wih your group explore he idea of reference frame (i.e. relaive moion) and moion wih conan acceleraion. You ll
More informationFlow Networks. Ma/CS 6a. Class 14: Flow Exercises
0/0/206 Ma/CS 6a Cla 4: Flow Exercie Flow Nework A flow nework i a digraph G = V, E, ogeher wih a ource verex V, a ink verex V, and a capaciy funcion c: E N. Capaciy Source 7 a b c d e Sink 0/0/206 Flow
More informationBiol. 356 Lab 8. Mortality, Recruitment, and Migration Rates
Biol. 356 Lab 8. Moraliy, Recruimen, and Migraion Raes (modified from Cox, 00, General Ecology Lab Manual, McGraw Hill) Las week we esimaed populaion size hrough several mehods. One assumpion of all hese
More informationf(x) dx with An integral having either an infinite limit of integration or an unbounded integrand is called improper. Here are two examples dx x x 2
Impope Inegls To his poin we hve only consideed inegls f() wih he is of inegion nd b finie nd he inegnd f() bounded (nd in fc coninuous ecep possibly fo finiely mny jump disconinuiies) An inegl hving eihe
More informationPositive and negative solutions of a boundary value problem for a
Invenion Journl of Reerch Technology in Engineering & Mngemen (IJRTEM) ISSN: 2455-3689 www.ijrem.com Volume 2 Iue 9 ǁ Sepemer 28 ǁ PP 73-83 Poiive nd negive oluion of oundry vlue prolem for frcionl, -difference
More informationThe Covenant Renewed. Family Journal Page. creation; He tells us in the Bible.)
i ell orie o go ih he picure. L, up ng i gro ve el ur Pren, ho phoo picure; u oher ell ee hey (T l. chi u b o on hi pge y ur ki kn pl. (We ee Hi i H b o b o kn e hem orie.) Compre h o ho creion; He ell
More informationAnatoly A. Kilbas. tn 1. t 1 a. dt 2. a t. log x
J. Koren Mh. So. 38 200) No. 6. 9 204 HADAMARD-TYPE FRACTIONAL CALCULUS Anoly A. Kilbs Absr. The er is devoed o he sudy of frionl inegrion nd differeniion on finie inervl [ b] of he rel xis in he frme
More informationHennessy-Milner Logic 1.
Hennessy-Milner Logic 1. Colloquium in honor of Robin Milner. Crlos Olrte. Pontifici Universidd Jverin 28 April 2010. 1 Bsed on the tlks: [1,2,3] Prof. Robin Milner (R.I.P). LIX, Ecole Polytechnique. Motivtion
More informationChapter 3 Common Families of Distributions
Chaer 3 Common Families of Disribuions Secion 31 - Inroducion Purose of his Chaer: Caalog many of common saisical disribuions (families of disribuions ha are indeed by one or more arameers) Wha we should
More informationSection 3.5 Nonhomogeneous Equations; Method of Undetermined Coefficients
Secion 3.5 Nonhomogeneous Equaions; Mehod of Undeermined Coefficiens Key Terms/Ideas: Linear Differenial operaor Nonlinear operaor Second order homogeneous DE Second order nonhomogeneous DE Soluion o homogeneous
More informationNotes on cointegration of real interest rates and real exchange rates. ρ (2)
Noe on coinegraion of real inere rae and real exchange rae Charle ngel, Univeriy of Wiconin Le me ar wih he obervaion ha while he lieraure (mo prominenly Meee and Rogoff (988) and dion and Paul (993))
More information1 Review of Zero-Sum Games
COS 5: heoreical Machine Learning Lecurer: Rob Schapire Lecure #23 Scribe: Eugene Brevdo April 30, 2008 Review of Zero-Sum Games Las ime we inroduced a mahemaical model for wo player zero-sum games. Any
More informationBernoulli numbers. Francesco Chiatti, Matteo Pintonello. December 5, 2016
UNIVERSITÁ DEGLI STUDI DI PADOVA, DIPARTIMENTO DI MATEMATICA TULLIO LEVI-CIVITA Bernoulli numbers Francesco Chiai, Maeo Pinonello December 5, 206 During las lessons we have proved he Las Ferma Theorem
More informationLinear Quadratic Regulator (LQR) - State Feedback Design
Linear Quadrai Regulaor (LQR) - Sae Feedbak Design A sysem is expressed in sae variable form as x = Ax + Bu n m wih x( ) R, u( ) R and he iniial ondiion x() = x A he sabilizaion problem using sae variable
More informationPrice Discrimination
My 0 Price Dicriminion. Direc rice dicriminion. Direc Price Dicriminion uing wo r ricing 3. Indirec Price Dicriminion wih wo r ricing 4. Oiml indirec rice dicriminion 5. Key Inigh ge . Direc Price Dicriminion
More informationEXERCISES FOR SECTION 1.5
1.5 Exisence and Uniqueness of Soluions 43 20. 1 v c 21. 1 v c 1 2 4 6 8 10 1 2 2 4 6 8 10 Graph of approximae soluion obained using Euler s mehod wih = 0.1. Graph of approximae soluion obained using Euler
More informationMonochromatic Infinite Sumsets
Monochromaic Infinie Sumses Imre Leader Paul A. Russell July 25, 2017 Absrac WeshowhahereisaraionalvecorspaceV suchha,whenever V is finiely coloured, here is an infinie se X whose sumse X+X is monochromaic.
More informatione 2t u(t) e 2t u(t) =?
EE : Signals, Sysems, and Transforms Fall 7. Skech he convoluion of he following wo signals. Tes No noes, closed book. f() Show your work. Simplify your answers. g(). Using he convoluion inegral, find
More informationLanguages That Are and Are Not Context-Free
Languages Tha re and re No Conex-Free Read K & S 3.5, 3.6, 3.7. Read Supplemenary Maerials: Conex-Free Languages and Pushdown uomaa: Closure Properies of Conex-Free Languages Read Supplemenary Maerials:
More informationReminder: Flow Networks
0/0/204 Ma/CS 6a Cla 4: Variou (Flow) Execie Reminder: Flow Nework A flow nework i a digraph G = V, E, ogeher wih a ource verex V, a ink verex V, and a capaciy funcion c: E N. Capaciy Source 7 a b c d
More informationCSCI565 - Compiler Design
CSCI565 - Compiler Deign Spring 6 Due Dte: Fe. 5, 6 t : PM in Cl Prolem [ point]: Regulr Expreion nd Finite Automt Develop regulr expreion (RE) tht detet the longet tring over the lphet {-} with the following
More informationThe Residual Graph. 12 Augmenting Path Algorithms. Augmenting Path Algorithm. Augmenting Path Algorithm
Augmening Pah Algorihm Greedy-algorihm: ar wih f (e) = everywhere find an - pah wih f (e) < c(e) on every edge augmen flow along he pah repea a long a poible The Reidual Graph From he graph G = (V, E,
More informationLecture Notes 2. The Hilbert Space Approach to Time Series
Time Series Seven N. Durlauf Universiy of Wisconsin. Basic ideas Lecure Noes. The Hilber Space Approach o Time Series The Hilber space framework provides a very powerful language for discussing he relaionship
More informationPhysics 240: Worksheet 16 Name
Phyic 4: Workhee 16 Nae Non-unifor circular oion Each of hee proble involve non-unifor circular oion wih a conan α. (1) Obain each of he equaion of oion for non-unifor circular oion under a conan acceleraion,
More informationEECE 301 Signals & Systems Prof. Mark Fowler
EECE 30 Signal & Syem Prof. ark Fowler oe Se #34 C-T Tranfer Funcion and Frequency Repone /4 Finding he Tranfer Funcion from Differenial Eq. Recall: we found a DT yem Tranfer Funcion Hz y aking he ZT of
More informationMath 334 Fall 2011 Homework 11 Solutions
Dec. 2, 2 Mah 334 Fall 2 Homework Soluions Basic Problem. Transform he following iniial value problem ino an iniial value problem for a sysem: u + p()u + q() u g(), u() u, u () v. () Soluion. Le v u. Then
More informationGraphs III - Network Flow
Graph III - Nework Flow Flow nework eup graph G=(V,E) edge capaciy w(u,v) 0 - if edge doe no exi, hen w(u,v)=0 pecial verice: ource verex ; ink verex - no edge ino and no edge ou of Aume every verex v
More informationINSTANTANEOUS VELOCITY
INSTANTANEOUS VELOCITY I claim ha ha if acceleraion is consan, hen he elociy is a linear funcion of ime and he posiion a quadraic funcion of ime. We wan o inesigae hose claims, and a he same ime, work
More informationPredator - Prey Model Trajectories and the nonlinear conservation law
Predaor - Prey Model Trajecories and he nonlinear conservaion law James K. Peerson Deparmen of Biological Sciences and Deparmen of Mahemaical Sciences Clemson Universiy Ocober 28, 213 Ouline Drawing Trajecories
More informationThe Residual Graph. 11 Augmenting Path Algorithms. Augmenting Path Algorithm. Augmenting Path Algorithm
Augmening Pah Algorihm Greedy-algorihm: ar wih f (e) = everywhere find an - pah wih f (e) < c(e) on every edge augmen flow along he pah repea a long a poible The Reidual Graph From he graph G = (V, E,
More informationNotes 04 largely plagiarized by %khc
Noes 04 largely plagiarized by %khc Convoluion Recap Some ricks: x() () =x() x() (, 0 )=x(, 0 ) R ț x() u() = x( )d x() () =ẋ() This hen ells us ha an inegraor has impulse response h() =u(), and ha a differeniaor
More information0 for t < 0 1 for t > 0
8.0 Sep nd del funcions Auhor: Jeremy Orloff The uni Sep Funcion We define he uni sep funcion by u() = 0 for < 0 for > 0 I is clled he uni sep funcion becuse i kes uni sep = 0. I is someimes clled he Heviside
More informationPHYSICS 1210 Exam 1 University of Wyoming 14 February points
PHYSICS 1210 Em 1 Uniersiy of Wyoming 14 Februry 2013 150 poins This es is open-noe nd closed-book. Clculors re permied bu compuers re no. No collborion, consulion, or communicion wih oher people (oher
More informationThree Dimensional Coordinate Geometry
HKCWCC dvned evel Pure Mhs. / -D Co-Geomer Three Dimensionl Coordine Geomer. Coordine of Poin in Spe Z XOX, YOY nd ZOZ re he oordine-es. P,, is poin on he oordine plne nd is lled ordered riple. P,, X Y
More informationProperties of Logarithms. Solving Exponential and Logarithmic Equations. Properties of Logarithms. Properties of Logarithms. ( x)
Properies of Logrihms Solving Eponenil nd Logrihmic Equions Properies of Logrihms Produc Rule ( ) log mn = log m + log n ( ) log = log + log Properies of Logrihms Quoien Rule log m = logm logn n log7 =
More informationt is a basis for the solution space to this system, then the matrix having these solutions as columns, t x 1 t, x 2 t,... x n t x 2 t...
Mah 228- Fri Mar 24 5.6 Marix exponenials and linear sysems: The analogy beween firs order sysems of linear differenial equaions (Chaper 5) and scalar linear differenial equaions (Chaper ) is much sronger
More information22.615, MHD Theory of Fusion Systems Prof. Freidberg Lecture 9: The High Beta Tokamak
.65, MHD Theory of Fusion Sysems Prof. Freidberg Lecure 9: The High e Tokmk Summry of he Properies of n Ohmic Tokmk. Advnges:. good euilibrium (smll shif) b. good sbiliy ( ) c. good confinemen ( τ nr )
More informationAverage & instantaneous velocity and acceleration Motion with constant acceleration
Physics 7: Lecure Reminders Discussion nd Lb secions sr meeing ne week Fill ou Pink dd/drop form if you need o swich o differen secion h is FULL. Do i TODAY. Homework Ch. : 5, 7,, 3,, nd 6 Ch.: 6,, 3 Submission
More informationAnd I Saw a New Heaven
n I Sw New Heven NTHEM For Choir (STB) n Orgn John Kilprik 2008 John Kilprik This work my freely uplie, performe n reore. Copies shoul no sol exep o over prining oss. rev: 06/03/2010 prin: 02/07/2013 2
More informationUSA Mathematical Talent Search Round 1 Solutions Year 25 Academic Year
1/1/5. Alex is trying to oen lock whose code is sequence tht is three letters long, with ech of the letters being one of A, B or C, ossibly reeted. The lock hs three buttons, lbeled A, B nd C. When the
More informationChapter 2. First Order Scalar Equations
Chaper. Firs Order Scalar Equaions We sar our sudy of differenial equaions in he same way he pioneers in his field did. We show paricular echniques o solve paricular ypes of firs order differenial equaions.
More informationChapter 7: Solving Trig Equations
Haberman MTH Secion I: The Trigonomeric Funcions Chaper 7: Solving Trig Equaions Le s sar by solving a couple of equaions ha involve he sine funcion EXAMPLE a: Solve he equaion sin( ) The inverse funcions
More informationChapter 9 - The Laplace Transform
Chaper 9 - The Laplace Tranform Selece Soluion. Skech he pole-zero plo an region of convergence (if i exi) for hee ignal. ω [] () 8 (a) x e u = 8 ROC σ ( ) 3 (b) x e co π u ω [] ( ) () (c) x e u e u ROC
More information22.615, MHD Theory of Fusion Systems Prof. Freidberg Lecture 10: The High Beta Tokamak Con d and the High Flux Conserving Tokamak.
.615, MHD Theory of Fusion Sysems Prof. Freidberg Lecure 1: The High Be Tokmk Con d nd he High Flux Conserving Tokmk Proeries of he High Tokmk 1. Evlue he MHD sfey fcor: ψ B * ( ) 1 3 ρ 1+ ν ρ ρ cosθ *
More informationEchocardiography Project and Finite Fourier Series
Echocardiography Projec and Finie Fourier Series 1 U M An echocardiagram is a plo of how a porion of he hear moves as he funcion of ime over he one or more hearbea cycles If he hearbea repeas iself every
More informationdt = C exp (3 ln t 4 ). t 4 W = C exp ( ln(4 t) 3) = C(4 t) 3.
Mah Rahman Exam Review Soluions () Consider he IVP: ( 4)y 3y + 4y = ; y(3) = 0, y (3) =. (a) Please deermine he longes inerval for which he IVP is guaraneed o have a unique soluion. Soluion: The disconinuiies
More informationProblem Set 9 Due December, 7
EE226: Random Proesses in Sysems Leurer: Jean C. Walrand Problem Se 9 Due Deember, 7 Fall 6 GSI: Assane Gueye his problem se essenially reviews Convergene and Renewal proesses. No all exerises are o be
More informationTo become more mathematically correct, Circuit equations are Algebraic Differential equations. from KVL, KCL from the constitutive relationship
Laplace Tranform (Lin & DeCarlo: Ch 3) ENSC30 Elecric Circui II The Laplace ranform i an inegral ranformaion. I ranform: f ( ) F( ) ime variable complex variable From Euler > Lagrange > Laplace. Hence,
More informationThe following report makes use of the process from Chapter 2 in Dr. Cumming s thesis.
Zaleski 1 Joseph Zaleski Mah 451H Final Repor Conformal Mapping Mehods and ZST Hele Shaw Flow Inroducion The Hele Shaw problem has been sudied using linear sabiliy analysis and numerical mehods, bu a novel
More informationOptimality of Myopic Policy for a Class of Monotone Affine Restless Multi-Armed Bandit
Univeriy of Souhern Cliforni Opimliy of Myopic Policy for Cl of Monoone Affine Rele Muli-Armed Bndi Pri Mnourifrd USC Tr Jvidi UCSD Bhkr Krihnmchri USC Dec 0, 202 Univeriy of Souhern Cliforni Inroducion
More informationHamilton- J acobi Equation: Explicit Formulas In this lecture we try to apply the method of characteristics to the Hamilton-Jacobi equation: u t
M ah 5 2 7 Fall 2 0 0 9 L ecure 1 0 O c. 7, 2 0 0 9 Hamilon- J acobi Equaion: Explici Formulas In his lecure we ry o apply he mehod of characerisics o he Hamilon-Jacobi equaion: u + H D u, x = 0 in R n
More informationSolutions for Assignment 2
Faculy of rs and Science Universiy of Torono CSC 358 - Inroducion o Compuer Neworks, Winer 218 Soluions for ssignmen 2 Quesion 1 (2 Poins): Go-ack n RQ In his quesion, we review how Go-ack n RQ can be
More informationAn integral having either an infinite limit of integration or an unbounded integrand is called improper. Here are two examples.
Improper Inegrls To his poin we hve only considered inegrls f(x) wih he is of inegrion nd b finie nd he inegrnd f(x) bounded (nd in fc coninuous excep possibly for finiely mny jump disconinuiies) An inegrl
More informationControl Systems -- Final Exam (Spring 2006)
6.5 Conrol Syem -- Final Eam (Spring 6 There are 5 prolem (inluding onu prolem oal poin. (p Given wo marie: (6 Compue A A e e. (6 For he differenial equaion [ ] ; y u A wih ( u( wha i y( for >? (8 For
More informationChapter 2: Evaluative Feedback
Chper 2: Evluive Feedbck Evluing cions vs. insrucing by giving correc cions Pure evluive feedbck depends olly on he cion ken. Pure insrucive feedbck depends no ll on he cion ken. Supervised lerning is
More informationToday: Max Flow Proofs
Today: Max Flow Proof COSC 58, Algorihm March 4, 04 Many of hee lide are adaped from everal online ource Reading Aignmen Today cla: Chaper 6 Reading aignmen for nex cla: Chaper 7 (Amorized analyi) In-Cla
More informationAnd I Saw a New Heaven
n Sw New Heven NTHEM For Choir (STB) n Orgn John Kilprik (VERSON FOR KEYBORD) 2008 John Kilprik This work my freely uplie, performe n reore. Copies shoul sol exep o over prining oss. rev: 23/08/2010 prin:
More information