Bisimulation, Games & Hennessy Milner logic
|
|
- Patience Bradford
- 5 years ago
- Views:
Transcription
1 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
2 Clssil lnguge theory Is onerned primrily with lnguges, eg. finite utomt regulr lnguges; pushdown utomt ontext-free lnguges; turing mhines reursively enumerble lnguges; This is fine when we think of n utomton/tm s sequentil proess whih hs no intertions with the outside world during its omputtion. However, utomt whih ept the sme lnguges n behve very differently to n outside observer. Bisimultion, Gmes & Hennessy Milner logi p.2/32
3 The fmous offee mhine exmple Inserire soldi Cffè s s s Bevnd l gusto di tè l limone t t We will disuss the observtions one n mke bout suh systems. Bisimultion, Gmes & Hennessy Milner logi p.3/32
4 Lbelled trnsition systems A lbelled trnsition system (LTS) L is triple S,A,T where: S is set of sttes; A is set of tions; T S A S is the trnsition reltion. We will normlly write p p for (p,,p ) T. Lbelled trnsition systems generlise both utomt nd trees. They re entrl bstrtion of onurreny theory. Bisimultion, Gmes & Hennessy Milner logi p.4/32
5 Tre preorder Given stte p of n LTS L, the word σ = α 1 α 2...α k A is tre of p when trnsitions p α 1 α p 2 α 1 k...pk 1 p We will use p σ p s shorthnd. Suppose tht L 1 nd L 2 re LTSs. The tre preorder tr S 1 S 2 is defined s follows: p tr q σ A. p σ p q. q σ q Observtion 1. tr is reflexive nd trnsitive. Bisimultion, Gmes & Hennessy Milner logi p.5/32
6 Tre equivlene Tre equivlene is defined tr = tr tr, ie p tr q def = p tr q q tr p It is immedite tht when L 1 = L 2, tr is n equivlene reltion on the sttes of n LTS But tres re not enough: tre equivlene is very orse, sine the offee mhines hve the sme tres. s s s t tr t Bisimultion, Gmes & Hennessy Milner logi p.6/32
7 Simultion Suppose tht L 1 nd L 2 re LTSs. A reltion R S L1 S L2 is lled simultion whenever: if prq nd p p then there exists q suh tht q q nd p Rq. Observtion 2. The empty reltion is simultion nd rbitrry unions of simultions re simultions. Similrity s S 1 S 2 is defined s the lrgest simultion. Equivlently, p s q iff there exists simultion R suh tht (p,q) R. Observtion 3. Similrity is reflexive nd trnsitive. Observtion 4. Simultion equivlene s def = s s. Bisimultion, Gmes & Hennessy Milner logi p.7/32
8 Simultion exmple 1 Simultion is more sensitive to brnhing (ie non-determinism) thn tres: s p 1 s s p 2 s q 1 q 2 q 3 t s t 1 t 1 2 t 2 Bisimultion, Gmes & Hennessy Milner logi p.8/32
9 Simultion exmple 2 But it is not entirely stisftory. p p q 1 q q 2 b b r 1 r 2 r 1 r 2 r 1 Bisimultion, Gmes & Hennessy Milner logi p.9/32
10 Bisimultion Suppose tht L 1 nd L 2 re LTSs. A reltion R S L1 S L2 is lled bisimultion whenever: (i) if prq nd p p then there exists q suh tht q q nd p Rq ; (ii) if qrp nd q q then there exists p suh tht p p nd p Rq. Lemm 5. R is bisimultion iff R nd R op re simultions. Bisimultion, Gmes & Hennessy Milner logi p.10/32
11 Properties of bisimultions Lemm 6. is bisimultion. Proof. Vously true. Lemm 7. If {R i } i I re fmily of bisimultions then i I R i is bisimultion. Proof. Let R = i I R i. Suppose prq then there exists k suh tht pr k q. In prtiulr, qr k p nd so qrp, thus R is symmetri. If p p then there exists q suh tht q q nd p R k q. But p R k q implies p Rq. Corollry 8. There exists lrgest bisimultion. It is lled bisimilrity. If L 1 = L 2 then bisimilrity is n equivlene reltion. Bisimultion, Gmes & Hennessy Milner logi p.11/32
12 Exmples of bisimultions, 1 p q 1 q 2 q 3 q 4 q 5.. Lemm 9. p q 1. Proof. R = { (p,q i ) i N } is bisimultion. Bisimultion, Gmes & Hennessy Milner logi p.12/32
13 Exmples of bisimultions, 2 p p 1 p 2 q q 1 p b p 1 q 3 q q 2 b b b b q 1 q 4 Bisimultion, Gmes & Hennessy Milner logi p.13/32
14 Resoning bout bisimilrity To show tht sttes p, q re bisimilr it suffies to find bisimulion R whih reltes p nd q; It is less ler how to show tht p nd q re not bisimilr, one n: enumerte ll the reltions whih ontin (p, q) nd show tht none of them re bisimultions; enumerte ll the bisimultion nd show tht none of them ontin (p, q); borrow some tehiniques from gme theory... Bisimultion, Gmes & Hennessy Milner logi p.14/32
15 Bisimultion gme, 1 We re given two LTSs L 1, L 2. The onfigurtion is pir of sttes (p,q), p L 1, q L 2. The bisimultion gme hs two plyers: P nd R. A round of the gme proeeds s follows: (i) R hooses either p or q; (ii) ssuming it hose p, it next hooses trnsition p p ; (iii) P must hoose trnsition with the sme lbel in the other LTS, ie ssuming R hose p, it must find trnsition q q ; (iv) the round is repeted, repling (p,q) with (p,q ). Bisimultion, Gmes & Hennessy Milner logi p.15/32
16 Bisimultion gme, 2 Rules: An infinite gme is win for P. R wins iff the gme gets into round where P nnot respond with trnsition in step (iii). Observtion 10. For eh onfigurtion (p,q), either P or R hs winning strtegy. Theorem 11. p q iff P hs winning strtegy. (p q iff R hs winning strtegy.) Bisimultion, Gmes & Hennessy Milner logi p.16/32
17 P hs winning strtegy p q Let GE def = { (p,q) P hs winning strtegy }. Suppose tht (p,q) GE nd p p. Suppose tht there does not exist trnsition q q suh tht (p,q ) GE. Then R n hoose the trnsition p p nd P nnot respond in wy whih keeps him in winnble position. But this ontrdits the ft tht tht P hs winning strtegy for the gme strting with (p,q). Thus GE is bisimultion. Bisimultion, Gmes & Hennessy Milner logi p.17/32
18 p q P hs winning strtegy Bisimultions re winning strtegies: If p q then there exists bisimultion R suh tht (p,q) R. Whtever move R mkes, P n lwys mke move suh tht the result is in R. Clerly, this is winning strtegy for P. Bisimultion, Gmes & Hennessy Milner logi p.18/32
19 Exmples of non bisimilr sttes Bisimilrity is brnhing-sensitive. p p b q 1 q q 2 b r 1 r 2 r 1 r 2 Bisimultion, Gmes & Hennessy Milner logi p.19/32
20 Similrity nd bisimilrity Theorem 12. nd in generl the inlusion is strit. Proof. Any bisimultion nd its opposite re lerly simultions. On the other hnd, the following exmple shows tht bisimilrity is finer thn simultion equivlene. p p b q 1 q q 2 b r 1 r 2 r 1 r 2 r 1 Bisimultion, Gmes & Hennessy Milner logi p.20/32
21 Rep: equivlenes s tr Bisimilrity is the finest (=equtes less) equivlene we hve onsidered. Clim 13. Bisimilrity is the finest resonble equivlene, where resonble mens tht we n observe only the behviour nd not the stte-spe. We will give lnguge, the so-lled Hennessy Milner logi, whih desribes observtions/experiments on LTSs. Bisimultion, Gmes & Hennessy Milner logi p.21/32
22 Hennessy Milner logi Suppose tht A is set of tions. Let L ::= []L L L L L L L Given n LTS we define the semntis by struturl indution over the formul ϕ: q [A]ϕ if for ll q suh tht q q we hve q ϕ; q A ϕ if there exists q suh tht q q nd q ϕ; q ϕ if it is not the se tht q ϕ; q ϕ 1 ϕ 2 if q ϕ 1 or q ϕ 2 ; q ϕ 1 ϕ 2 if q ϕ 1 nd q ϕ 2 ; q lwys; q never; Bisimultion, Gmes & Hennessy Milner logi p.22/32
23 HM logi exmple formuls n perform trnsition lbelled with ; [] nnot perform trnsition lbelled with ; [b] n perform trnsition lbelled with to stte from whih there re no b lbelled trnsitions. ([b] )? Bisimultion, Gmes & Hennessy Milner logi p.23/32
24 Bsi properties of HM logi Lemm 14 ( De Morgn lws for HM logi). [] = ; = [] ; = ( ); = ( ); = ; =. In prtiulr, to get the full logi it suffies to onsider just the subsets {,,, } or {[],,, } or {, [],,,, }. Bisimultion, Gmes & Hennessy Milner logi p.24/32
25 Distinguishing formuls p p b q 1 q q 2 b r 1 r 2 r 1 r 2 ( b ) ( b ) p p b q 1 q q 2 b r 1 r 2 r 1 r 2 r 1 ( b ) ( b ) Bisimultion, Gmes & Hennessy Milner logi p.25/32
26 Logil equivlene Definition 15. The logil preorder L is reltion on the sttes of n LTS defined s follows: p < L q iff ϕ. p ϕ q ϕ It is lerly reflexive nd trnsitive. Definition 16. Logil equivlene is L def = L L. It is n equivlene reltion. Observtion 17. Atully, for HM, L = L = L. This is onsequene of hving negtion. Proof. Suppose p L q nd q ϕ. If p ϕ then p ϕ, hene q ϕ hene q ϕ, ontrdition. Hene p ϕ. Bisimultion, Gmes & Hennessy Milner logi p.26/32
27 Hennessy Milner & Bisimultion Definition 18. An LTS is sid to hve finite imge when from ny stte, the number of sttes rehble is finite. Theorem 19 (Hennessy Milner). Let L be n LTS with finite imge. Then L =. To prove this, we need to show: Soundness ( L ): If two sttes stisfy the sme formuls then they re bisimilr. Completeness ( L ): If two sttes re bisimilr then they stisfy the sme formuls. Remrk 20. Completeness holds in generl. The finite imge ssumption is needed only for soundness. Bisimultion, Gmes & Hennessy Milner logi p.27/32
28 Soundness L (Soundness) It suffies to show tht L is bisimultion. We will rely on imge finiteness. Suppose tht p L q nd p p. Then p nd so q thus there is t lest one q suh tht q q. The set of ll suh q is lso finite by the extr ssumption let this set be {q 1,...,q k }. Suppose tht for ll q i we hve tht p L q i. Then ϕ i suh tht p ϕ i nd q i ϕ i. Thus while p i k ϕ i we must hve q i k ϕ i, ontrdition. Hene there exists q i suh tht q q i nd p L q i. Bisimultion, Gmes & Hennessy Milner logi p.28/32
29 Completeness 1 L (Completeness) We will show this p < L q by struturl indution on formuls. Bse: p then q. Also, p then q. Indution: Modlities ( nd []): If p ϕ then p p nd p ϕ. By ssumption, there exists q suh tht q q nd p q. By indutive hypothesis q ϕ nd so q ϕ. If p []ϕ then whenever p p then p ϕ. First, notie tht p q implies tht if q q then there exists p suh tht p p with p q. Sine p ϕ, lso q ϕ. Hene q []ϕ. Bisimultion, Gmes & Hennessy Milner logi p.29/32
30 Completeness 2 Propositionl onnetives ( nd ): if p ϕ 1 ϕ 2 then p ϕ 1 or p ϕ 2. If it is the first then by the indutive hypothesis q ϕ 1, if the seond then q ϕ 2 ; thus q ϕ 1 ϕ 2. if p ϕ 2 ϕ 2 is similr. Note tht ompleteness does not need the finite imge ssumption thus bisimilr sttes lwys stisfy the sme formuls. In the proof, we used the ft tht {, [],,,, } is enough for ll of HM logi. Bisimultion, Gmes & Hennessy Milner logi p.30/32
31 Imge finiteness The theorem breks down without this ssumption: p } k times p } k times Esy to hek, using the bisimultion gme, tht p 1 p 2. Solution: Introdue infinite onjuntion to the logi. Bisimultion, Gmes & Hennessy Milner logi p.31/32
32 Sublogis of HM L tr ::= L tr Theorem 21. Logil preorder on L tr oinides with the tre preorder. L s ::= L s L s L s Theorem 22. Logil preorder on L s oniides with the simultion preorder. Bisimultion, Gmes & Hennessy Milner logi p.32/32
Strong 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 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 informationBisimulation, Games & Hennessy Milner logic p.1/32
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
More informationSystem Validation (IN4387) November 2, 2012, 14:00-17:00
System Vlidtion (IN4387) Novemer 2, 2012, 14:00-17:00 Importnt Notes. The exmintion omprises 5 question in 4 pges. Give omplete explntion nd do not onfine yourself to giving the finl nswer. Good luk! Exerise
More informationTechnische Universität München Winter term 2009/10 I7 Prof. J. Esparza / J. Křetínský / M. Luttenberger 11. Februar Solution
Tehnishe Universität Münhen Winter term 29/ I7 Prof. J. Esprz / J. Křetínský / M. Luttenerger. Ferur 2 Solution Automt nd Forml Lnguges Homework 2 Due 5..29. Exerise 2. Let A e the following finite utomton:
More informationTransition systems (motivation)
Trnsition systems (motivtion) Course Modelling of Conurrent Systems ( Modellierung neenläufiger Systeme ) Winter Semester 2009/0 University of Duisurg-Essen Brr König Tehing ssistnt: Christoph Blume In
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 informationNondeterministic Automata vs Deterministic Automata
Nondeterministi Automt vs Deterministi Automt We lerned tht NFA is onvenient model for showing the reltionships mong regulr grmmrs, FA, nd regulr expressions, nd designing them. However, we know tht n
More informationArrow s Impossibility Theorem
Rep Fun Gme Properties Arrow s Theorem Arrow s Impossiility Theorem Leture 12 Arrow s Impossiility Theorem Leture 12, Slide 1 Rep Fun Gme Properties Arrow s Theorem Leture Overview 1 Rep 2 Fun Gme 3 Properties
More information1 PYTHAGORAS THEOREM 1. Given a right angled triangle, the square of the hypotenuse is equal to the sum of the squares of the other two sides.
1 PYTHAGORAS THEOREM 1 1 Pythgors Theorem In this setion we will present geometri proof of the fmous theorem of Pythgors. Given right ngled tringle, the squre of the hypotenuse is equl to the sum of the
More informationNon-Deterministic Finite Automata. Fall 2018 Costas Busch - RPI 1
Non-Deterministic Finite Automt Fll 2018 Costs Busch - RPI 1 Nondeterministic Finite Automton (NFA) Alphbet ={} q q2 1 q 0 q 3 Fll 2018 Costs Busch - RPI 2 Nondeterministic Finite Automton (NFA) Alphbet
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 informationCS311 Computational Structures Regular Languages and Regular Grammars. Lecture 6
CS311 Computtionl Strutures Regulr Lnguges nd Regulr Grmmrs Leture 6 1 Wht we know so fr: RLs re losed under produt, union nd * Every RL n e written s RE, nd every RE represents RL Every RL n e reognized
More informationSection 1.3 Triangles
Se 1.3 Tringles 21 Setion 1.3 Tringles LELING TRINGLE The line segments tht form tringle re lled the sides of the tringle. Eh pir of sides forms n ngle, lled n interior ngle, nd eh tringle hs three interior
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 informationArrow s Impossibility Theorem
Rep Voting Prdoxes Properties Arrow s Theorem Arrow s Impossiility Theorem Leture 12 Arrow s Impossiility Theorem Leture 12, Slide 1 Rep Voting Prdoxes Properties Arrow s Theorem Leture Overview 1 Rep
More informationNON-DETERMINISTIC FSA
Tw o types of non-determinism: NON-DETERMINISTIC FS () Multiple strt-sttes; strt-sttes S Q. The lnguge L(M) ={x:x tkes M from some strt-stte to some finl-stte nd ll of x is proessed}. The string x = is
More information18.06 Problem Set 4 Due Wednesday, Oct. 11, 2006 at 4:00 p.m. in 2-106
8. Problem Set Due Wenesy, Ot., t : p.m. in - Problem Mony / Consier the eight vetors 5, 5, 5,..., () List ll of the one-element, linerly epenent sets forme from these. (b) Wht re the two-element, linerly
More informationwhere the box contains a finite number of gates from the given collection. Examples of gates that are commonly used are the following: a b
CS 294-2 9/11/04 Quntum Ciruit Model, Solovy-Kitev Theorem, BQP Fll 2004 Leture 4 1 Quntum Ciruit Model 1.1 Clssil Ciruits - Universl Gte Sets A lssil iruit implements multi-output oolen funtion f : {0,1}
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 informationElectromagnetism Notes, NYU Spring 2018
Eletromgnetism Notes, NYU Spring 208 April 2, 208 Ation formultion of EM. Free field desription Let us first onsider the free EM field, i.e. in the bsene of ny hrges or urrents. To tret this s mehnil system
More informationT b a(f) [f ] +. P b a(f) = Conclude that if f is in AC then it is the difference of two monotone absolutely continuous functions.
Rel Vribles, Fll 2014 Problem set 5 Solution suggestions Exerise 1. Let f be bsolutely ontinuous on [, b] Show tht nd T b (f) P b (f) f (x) dx [f ] +. Conlude tht if f is in AC then it is the differene
More informationCoalgebra, Lecture 15: Equations for Deterministic Automata
Colger, Lecture 15: Equtions for Deterministic Automt Julin Slmnc (nd Jurrin Rot) Decemer 19, 2016 In this lecture, we will study the concept of equtions for deterministic utomt. The notes re self contined
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 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 informationMore Properties of the Riemann Integral
More Properties of the Riemnn Integrl Jmes K. Peterson Deprtment of Biologil Sienes nd Deprtment of Mthemtil Sienes Clemson University Februry 15, 2018 Outline More Riemnn Integrl Properties The Fundmentl
More informationAUTOMATA AND LANGUAGES. Definition 1.5: Finite Automaton
25. Finite Automt AUTOMATA AND LANGUAGES A system of computtion tht only hs finite numer of possile sttes cn e modeled using finite utomton A finite utomton is often illustrted s stte digrm d d d. d q
More informationMid-Term Examination - Spring 2014 Mathematical Programming with Applications to Economics Total Score: 45; Time: 3 hours
Mi-Term Exmintion - Spring 0 Mthemtil Progrmming with Applitions to Eonomis Totl Sore: 5; Time: hours. Let G = (N, E) e irete grph. Define the inegree of vertex i N s the numer of eges tht re oming into
More informationSummer School Verification Technology, Systems & Applications
VTSA 2011 Summer School Verifiction Technology, Systems & Applictions 4th edition since 2008: Liège (Belgium), Sep. 19 23, 2011 free prticiption, limited number of prticipnts ppliction dedline: July 22,
More informationFinite State Automata and Determinisation
Finite Stte Automt nd Deterministion Tim Dworn Jnury, 2016 Lnguges fs nf re df Deterministion 2 Outline 1 Lnguges 2 Finite Stte Automt (fs) 3 Non-deterministi Finite Stte Automt (nf) 4 Regulr Expressions
More informationLecture 1 - Introduction and Basic Facts about PDEs
* 18.15 - Introdution to PDEs, Fll 004 Prof. Gigliol Stffilni Leture 1 - Introdution nd Bsi Fts bout PDEs The Content of the Course Definition of Prtil Differentil Eqution (PDE) Liner PDEs VVVVVVVVVVVVVVVVVVVV
More informationFundamentals of Computer Science
Fundmentls of Computer Science Chpter 3: NFA nd DFA equivlence Regulr expressions Henrik Björklund Umeå University Jnury 23, 2014 NFA nd DFA equivlence As we shll see, it turns out tht NFA nd DFA re equivlent,
More informationExercise sheet 6: Solutions
Eerise sheet 6: Solutions Cvet emptor: These re merel etended hints, rther thn omplete solutions. 1. If grph G hs hromti numer k > 1, prove tht its verte set n e prtitioned into two nonempt sets V 1 nd
More informationPart 4. Integration (with Proofs)
Prt 4. Integrtion (with Proofs) 4.1 Definition Definition A prtition P of [, b] is finite set of points {x 0, x 1,..., x n } with = x 0 < x 1
More informationThe University of Nottingham SCHOOL OF COMPUTER SCIENCE A LEVEL 2 MODULE, SPRING SEMESTER MACHINES AND THEIR LANGUAGES ANSWERS
The University of ottinghm SCHOOL OF COMPUTR SCIC A LVL 2 MODUL, SPRIG SMSTR 2015 2016 MACHIS AD THIR LAGUAGS ASWRS Time llowed TWO hours Cndidtes my omplete the front over of their nswer ook nd sign their
More informationAutomata and Languages
Automt nd Lnguges Prof. Mohmed Hmd Softwre Engineering Lb. The University of Aizu Jpn Grmmr Regulr Grmmr Context-free Grmmr Context-sensitive Grmmr Regulr Lnguges Context Free Lnguges Context Sensitive
More informationINTEGRATION. 1 Integrals of Complex Valued functions of a REAL variable
INTEGRATION NOTE: These notes re supposed to supplement Chpter 4 of the online textbook. 1 Integrls of Complex Vlued funtions of REAL vrible If I is n intervl in R (for exmple I = [, b] or I = (, b)) nd
More informationAbstraction of Nondeterministic Automata Rong Su
Astrtion of Nondeterministi Automt Rong Su My 6, 2010 TU/e Mehnil Engineering, Systems Engineering Group 1 Outline Motivtion Automton Astrtion Relevnt Properties Conlusions My 6, 2010 TU/e Mehnil Engineering,
More information16z z q. q( B) Max{2 z z z z B} r z r z r z r z B. John Riley 19 October Econ 401A: Microeconomic Theory. Homework 2 Answers
John Riley 9 Otober 6 Eon 4A: Miroeonomi Theory Homework Answers Constnt returns to sle prodution funtion () If (,, q) S then 6 q () 4 We need to show tht (,, q) S 6( ) ( ) ( q) q [ q ] 4 4 4 4 4 4 Appeling
More information1 From NFA to regular expression
Note 1: How to convert DFA/NFA to regulr expression Version: 1.0 S/EE 374, Fll 2017 Septemer 11, 2017 In this note, we show tht ny DFA cn e converted into regulr expression. Our construction would work
More informationGrammar. Languages. Content 5/10/16. Automata and Languages. Regular Languages. Regular Languages
5//6 Grmmr Automt nd Lnguges Regulr Grmmr Context-free Grmmr Context-sensitive Grmmr Prof. Mohmed Hmd Softwre Engineering L. The University of Aizu Jpn Regulr Lnguges Context Free Lnguges Context Sensitive
More informationy z A left-handed system can be rotated to look like the following. z
Chpter 2 Crtesin Coördintes The djetive Crtesin bove refers to René Desrtes (1596 1650), who ws the first to oördintise the plne s ordered pirs of rel numbers, whih provided the first sstemti link between
More informationA Study on the Properties of Rational Triangles
Interntionl Journl of Mthemtis Reserh. ISSN 0976-5840 Volume 6, Numer (04), pp. 8-9 Interntionl Reserh Pulition House http://www.irphouse.om Study on the Properties of Rtionl Tringles M. Q. lm, M.R. Hssn
More informationSolutions for HW9. Bipartite: put the red vertices in V 1 and the black in V 2. Not bipartite!
Solutions for HW9 Exerise 28. () Drw C 6, W 6 K 6, n K 5,3. C 6 : W 6 : K 6 : K 5,3 : () Whih of the following re iprtite? Justify your nswer. Biprtite: put the re verties in V 1 n the lk in V 2. Biprtite:
More informationLecture 1. Functional series. Pointwise and uniform convergence.
1 Introduction. Lecture 1. Functionl series. Pointwise nd uniform convergence. In this course we study mongst other things Fourier series. The Fourier series for periodic function f(x) with period 2π is
More information= state, a = reading and q j
4 Finite Automt CHAPTER 2 Finite Automt (FA) (i) Derterministi Finite Automt (DFA) A DFA, M Q, q,, F, Where, Q = set of sttes (finite) q Q = the strt/initil stte = input lphet (finite) (use only those
More informationCS:4330 Theory of Computation Spring Regular Languages. Equivalences between Finite automata and REs. Haniel Barbosa
CS:4330 Theory of Computtion Spring 208 Regulr Lnguges Equivlences between Finite utomt nd REs Hniel Brbos Redings for this lecture Chpter of [Sipser 996], 3rd edition. Section.3. Finite utomt nd regulr
More informationGood-for-Games Automata versus Deterministic Automata.
Good-for-Gmes Automt versus Deterministic Automt. Denis Kuperberg 1,2 Mich l Skrzypczk 1 1 University of Wrsw 2 IRIT/ONERA (Toulouse) Séminire MoVe 12/02/2015 LIF, Luminy Introduction Deterministic utomt
More informationarxiv: v1 [math.ca] 21 Aug 2018
rxiv:1808.07159v1 [mth.ca] 1 Aug 018 Clulus on Dul Rel Numbers Keqin Liu Deprtment of Mthemtis The University of British Columbi Vnouver, BC Cnd, V6T 1Z Augest, 018 Abstrt We present the bsi theory of
More informationGreen s Theorem. (2x e y ) da. (2x e y ) dx dy. x 2 xe y. (1 e y ) dy. y=1. = y e y. y=0. = 2 e
Green s Theorem. Let be the boundry of the unit squre, y, oriented ounterlokwise, nd let F be the vetor field F, y e y +, 2 y. Find F d r. Solution. Let s write P, y e y + nd Q, y 2 y, so tht F P, Q. Let
More informationFormal Languages and Automata
Moile Computing nd Softwre Engineering p. 1/5 Forml Lnguges nd Automt Chpter 2 Finite Automt Chun-Ming Liu cmliu@csie.ntut.edu.tw Deprtment of Computer Science nd Informtion Engineering Ntionl Tipei University
More informationBisimulation. R.J. van Glabbeek
Bisimultion R.J. vn Glbbeek NICTA, Sydney, Austrli. School of Computer Science nd Engineering, The University of New South Wles, Sydney, Austrli. Computer Science Deprtment, Stnford University, CA 94305-9045,
More informations the set of onsequenes. Skeptil onsequenes re more roust in the sense tht they hold in ll possile relities desried y defult theory. All its desirle p
Skeptil Rtionl Extensions Artur Mikitiuk nd Miros lw Truszzynski University of Kentuky, Deprtment of Computer Siene, Lexington, KY 40506{0046, frtur mirekg@s.engr.uky.edu Astrt. In this pper we propose
More informationCategorical approaches to bisimilarity
Ctegoricl pproches to bisimilrity PPS seminr, IRIF, Pris 7 Jérémy Dubut Ntionl Institute of Informtics Jpnese-French Lbortory for Informtics April 2nd Jérémy Dubut (NII & JFLI) Ctegoricl pproches to bisimilrity
More informationBehavior Composition in the Presence of Failure
Behvior Composition in the Presene of Filure Sestin Srdin RMIT University, Melourne, Austrli Fio Ptrizi & Giuseppe De Giomo Spienz Univ. Rom, Itly KR 08, Sept. 2008, Sydney Austrli Introdution There re
More information1.3 Regular Expressions
56 1.3 Regulr xpressions These hve n importnt role in describing ptterns in serching for strings in mny pplictions (e.g. wk, grep, Perl,...) All regulr expressions of lphbet re 1.Ønd re regulr expressions,
More informationHandout: Natural deduction for first order logic
MATH 457 Introduction to Mthemticl Logic Spring 2016 Dr Json Rute Hndout: Nturl deduction for first order logic We will extend our nturl deduction rules for sententil logic to first order logic These notes
More informationKENDRIYA VIDYALAYA IIT KANPUR HOME ASSIGNMENTS FOR SUMMER VACATIONS CLASS - XII MATHEMATICS (Relations and Functions & Binary Operations)
KENDRIYA VIDYALAYA IIT KANPUR HOME ASSIGNMENTS FOR SUMMER VACATIONS 6-7 CLASS - XII MATHEMATICS (Reltions nd Funtions & Binry Opertions) For Slow Lerners: - A Reltion is sid to e Reflexive if.. every A
More informationLinearly Similar Polynomials
Linerly Similr Polynomils rthur Holshouser 3600 Bullrd St. Chrlotte, NC, US Hrold Reiter Deprtment of Mthemticl Sciences University of North Crolin Chrlotte, Chrlotte, NC 28223, US hbreiter@uncc.edu stndrd
More informationFinite Automata. Informatics 2A: Lecture 3. John Longley. 22 September School of Informatics University of Edinburgh
Lnguges nd Automt Finite Automt Informtics 2A: Lecture 3 John Longley School of Informtics University of Edinburgh jrl@inf.ed.c.uk 22 September 2017 1 / 30 Lnguges nd Automt 1 Lnguges nd Automt Wht is
More informationLogic, Set Theory and Computability [M. Coppenbarger]
14 Orer (Hnout) Definition 7-11: A reltion is qusi-orering (or preorer) if it is reflexive n trnsitive. A quisi-orering tht is symmetri is n equivlene reltion. A qusi-orering tht is nti-symmetri is n orer
More informationSolutions to Problem Set #1
CSE 233 Spring, 2016 Solutions to Prolem Set #1 1. The movie tse onsists of the following two reltions movie: title, iretor, tor sheule: theter, title The first reltion provies titles, iretors, n tors
More informationNondeterministic Finite Automata
Nondeterministi Finite utomt The Power of Guessing Tuesdy, Otoer 4, 2 Reding: Sipser.2 (first prt); Stoughton 3.3 3.5 S235 Lnguges nd utomt eprtment of omputer Siene Wellesley ollege Finite utomton (F)
More informationad = cb (1) cf = ed (2) adf = cbf (3) cf b = edb (4)
10 Most proofs re left s reding exercises. Definition 10.1. Z = Z {0}. Definition 10.2. Let be the binry reltion defined on Z Z by, b c, d iff d = cb. Theorem 10.3. is n equivlence reltion on Z Z. Proof.
More informationRegular languages refresher
Regulr lnguges refresher 1 Regulr lnguges refresher Forml lnguges Alphet = finite set of letters Word = sequene of letter Lnguge = set of words Regulr lnguges defined equivlently y Regulr expressions Finite-stte
More informationCSC 473 Automata, Grammars & Languages 11/9/10
CSC 473 utomt, Grmmrs & Lnguges 11/9/10 utomt, Grmmrs nd Lnguges Discourse 06 Decidbility nd Undecidbility Decidble Problems for Regulr Lnguges Theorem 4.1: (embership/cceptnce Prob. for DFs) = {, w is
More informationGraph Theory. Simple Graph G = (V, E). V={a,b,c,d,e,f,g,h,k} E={(a,b),(a,g),( a,h),(a,k),(b,c),(b,k),...,(h,k)}
Grph Theory Simple Grph G = (V, E). V ={verties}, E={eges}. h k g f e V={,,,,e,f,g,h,k} E={(,),(,g),(,h),(,k),(,),(,k),...,(h,k)} E =16. 1 Grph or Multi-Grph We llow loops n multiple eges. G = (V, E.ψ)
More informationNon Deterministic Automata. Linz: Nondeterministic Finite Accepters, page 51
Non Deterministic Automt Linz: Nondeterministic Finite Accepters, pge 51 1 Nondeterministic Finite Accepter (NFA) Alphbet ={} q 1 q2 q 0 q 3 2 Nondeterministic Finite Accepter (NFA) Alphbet ={} Two choices
More informationa,b a 1 a 2 a 3 a,b 1 a,b a,b 2 3 a,b a,b a 2 a,b CS Determinisitic Finite Automata 1
CS4 45- Determinisitic Finite Automt -: Genertors vs. Checkers Regulr expressions re one wy to specify forml lnguge String Genertor Genertes strings in the lnguge Deterministic Finite Automt (DFA) re nother
More informationSpeech Recognition Lecture 2: Finite Automata and Finite-State Transducers. Mehryar Mohri Courant Institute and Google Research
Speech Recognition Lecture 2: Finite Automt nd Finite-Stte Trnsducers Mehryr Mohri Cournt Institute nd Google Reserch mohri@cims.nyu.com Preliminries Finite lphet Σ, empty string. Set of ll strings over
More informationTHE QUADRATIC RECIPROCITY LAW OF DUKE-HOPKINS. Circa 1870, G. Zolotarev observed that the Legendre symbol ( a p
THE QUADRATIC RECIPROCITY LAW OF DUKE-HOPKINS PETE L CLARK Circ 1870, Zolotrev observed tht the Legendre symbol ( p ) cn be interpreted s the sign of multipliction by viewed s permuttion of the set Z/pZ
More informationNFAs and Regular Expressions. NFA-ε, continued. Recall. Last class: Today: Fun:
CMPU 240 Lnguge Theory nd Computtion Spring 2019 NFAs nd Regulr Expressions Lst clss: Introduced nondeterministic finite utomt with -trnsitions Tody: Prove n NFA- is no more powerful thn n NFA Introduce
More informationTHE EXISTENCE-UNIQUENESS THEOREM FOR FIRST-ORDER DIFFERENTIAL EQUATIONS.
THE EXISTENCE-UNIQUENESS THEOREM FOR FIRST-ORDER DIFFERENTIAL EQUATIONS RADON ROSBOROUGH https://intuitiveexplntionscom/picrd-lindelof-theorem/ This document is proof of the existence-uniqueness theorem
More informationOn Determinism in Modal Transition Systems
On Determinism in Modl Trnsition Systems N. Beneš,2, J. Křetínský,3, K. G. Lrsen 5, J. Sr,4 Deprtment of Computer Siene, Alorg University, Selm Lgerlöfs Vej 300, 9220 Alorg Øst, Denmrk Astrt Modl trnsition
More informationHomework 4. 0 ε 0. (00) ε 0 ε 0 (00) (11) CS 341: Foundations of Computer Science II Prof. Marvin Nakayama
CS 341: Foundtions of Computer Science II Prof. Mrvin Nkym Homework 4 1. UsetheproceduredescriedinLemm1.55toconverttheregulrexpression(((00) (11)) 01) into n NFA. Answer: 0 0 1 1 00 0 0 11 1 1 01 0 1 (00)
More informationRegular expressions, Finite Automata, transition graphs are all the same!!
CSI 3104 /Winter 2011: Introduction to Forml Lnguges Chpter 7: Kleene s Theorem Chpter 7: Kleene s Theorem Regulr expressions, Finite Automt, trnsition grphs re ll the sme!! Dr. Neji Zgui CSI3104-W11 1
More informationChapter 3. Vector Spaces. 3.1 Images and Image Arithmetic
Chpter 3 Vetor Spes In Chpter 2, we sw tht the set of imges possessed numer of onvenient properties. It turns out tht ny set tht possesses similr onvenient properties n e nlyzed in similr wy. In liner
More informationState Minimization for DFAs
Stte Minimiztion for DFAs Red K & S 2.7 Do Homework 10. Consider: Stte Minimiztion 4 5 Is this miniml mchine? Step (1): Get rid of unrechle sttes. Stte Minimiztion 6, Stte is unrechle. Step (2): Get rid
More informationApril 8, 2017 Math 9. Geometry. Solving vector problems. Problem. Prove that if vectors and satisfy, then.
pril 8, 2017 Mth 9 Geometry Solving vetor prolems Prolem Prove tht if vetors nd stisfy, then Solution 1 onsider the vetor ddition prllelogrm shown in the Figure Sine its digonls hve equl length,, the prllelogrm
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 informationMATH 409 Advanced Calculus I Lecture 22: Improper Riemann integrals.
MATH 409 Advned Clulus I Leture 22: Improper Riemnn integrls. Improper Riemnn integrl If funtion f : [,b] R is integrble on [,b], then the funtion F(x) = x f(t)dt is well defined nd ontinuous on [,b].
More informationTutorial Worksheet. 1. Find all solutions to the linear system by following the given steps. x + 2y + 3z = 2 2x + 3y + z = 4.
Mth 5 Tutoril Week 1 - Jnury 1 1 Nme Setion Tutoril Worksheet 1. Find ll solutions to the liner system by following the given steps x + y + z = x + y + z = 4. y + z = Step 1. Write down the rgumented mtrix
More informationAnatomy of a Deterministic Finite Automaton. Deterministic Finite Automata. A machine so simple that you can understand it in less than one minute
Victor Admchik Dnny Sletor Gret Theoreticl Ides In Computer Science CS 5-25 Spring 2 Lecture 2 Mr 3, 2 Crnegie Mellon University Deterministic Finite Automt Finite Automt A mchine so simple tht you cn
More informationWell Centered Spherical Quadrangles
Beiträge zur Algebr und Geometrie Contributions to Algebr nd Geometry Volume 44 (003), No, 539-549 Well Centered Sphericl Qudrngles An M d Azevedo Bred 1 Altino F Sntos Deprtment of Mthemtics, University
More information(e) if x = y + z and a divides any two of the integers x, y, or z, then a divides the remaining integer
Divisibility In this note we introduce the notion of divisibility for two integers nd b then we discuss the division lgorithm. First we give forml definition nd note some properties of the division opertion.
More informationBoolean Algebra cont. The digital abstraction
Boolen Alger ont The igitl strtion Theorem: Asorption Lw For every pir o elements B. + =. ( + ) = Proo: () Ientity Distriutivity Commuttivity Theorem: For ny B + = Ientity () ulity. Theorem: Assoitive
More informationMAT 403 NOTES 4. f + f =
MAT 403 NOTES 4 1. Fundmentl Theorem o Clulus We will proo more generl version o the FTC thn the textook. But just like the textook, we strt with the ollowing proposition. Let R[, ] e the set o Riemnn
More informationPetri Nets and Regular Processes
Uppsl Computing Science Reserch Report No. 162 Mrch 22, 1999 ISSN 1100 0686 Petri Nets nd Regulr Processes Petr Jnčr y Deprtment of Computer Science, Technicl University of Ostrv 17. listopdu 15, CZ-708
More informationCo-ordinated s-convex Function in the First Sense with Some Hadamard-Type Inequalities
Int. J. Contemp. Mth. Sienes, Vol. 3, 008, no. 3, 557-567 Co-ordinted s-convex Funtion in the First Sense with Some Hdmrd-Type Inequlities Mohmmd Alomri nd Mslin Drus Shool o Mthemtil Sienes Fulty o Siene
More informationChapter 2 Finite Automata
Chpter 2 Finite Automt 28 2.1 Introduction Finite utomt: first model of the notion of effective procedure. (They lso hve mny other pplictions). The concept of finite utomton cn e derived y exmining wht
More informationNFA and regex. the Boolean algebra of languages. non-deterministic machines. regular expressions
NFA nd regex l the Boolen lger of lnguges non-deterministi mhines regulr expressions Informtis The intersetion of two regulr lnguges is regulr Run oth mhines in prllel? Build one mhine tht simultes two
More informationRecursively Enumerable and Recursive. Languages
Recursively Enumerble nd Recursive nguges 1 Recll Definition (clss 19.pdf) Definition 10.4, inz, 6 th, pge 279 et S be set of strings. An enumertion procedure for Turing Mchine tht genertes ll strings
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 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 informationChapter 3. Vector Spaces
3.4 Liner Trnsformtions 1 Chpter 3. Vector Spces 3.4 Liner Trnsformtions Note. We hve lredy studied liner trnsformtions from R n into R m. Now we look t liner trnsformtions from one generl vector spce
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 informationAdvanced Calculus: MATH 410 Notes on Integrals and Integrability Professor David Levermore 17 October 2004
Advnced Clculus: MATH 410 Notes on Integrls nd Integrbility Professor Dvid Levermore 17 October 2004 1. Definite Integrls In this section we revisit the definite integrl tht you were introduced to when
More informationProbabilistic Model Checking Michaelmas Term Dr. Dave Parker. Department of Computer Science University of Oxford
Probbilistic Model Checking Michelms Term 2011 Dr. Dve Prker Deprtment of Computer Science University of Oxford Long-run properties Lst lecture: regulr sfety properties e.g. messge filure never occurs
More informationSolutions to Assignment 1
MTHE 237 Fll 2015 Solutions to Assignment 1 Problem 1 Find the order of the differentil eqution: t d3 y dt 3 +t2 y = os(t. Is the differentil eqution liner? Is the eqution homogeneous? b Repet the bove
More informationCompression of Palindromes and Regularity.
Compression of Plinromes n Regulrity. Kyoko Shikishim-Tsuji Center for Lierl Arts Eution n Reserh Tenri University 1 Introution In [1], property of likstrem t t view of tse is isusse n it is shown tht
More information