Active Diagnosis. Serge Haddad. Vecos 16. October the 6th 2016
|
|
- Anis Kelley
- 5 years ago
- Views:
Transcription
1 Ative Dignosis Serge Hddd LSV, ENS Chn & CNRS & Inri, Frne Veos 16 Otoer the 6th 2016 joint work with Nthlie Bertrnd 2, Eri Fre 2, Sten Hr 1,2, Loï Hélouët 2, Trek Melliti 1, Sten Shwoon 1 (1) FSTTCS 2013 nd (2) FOSSACS /39
2 Dignosis: rom ilures to ults Exmple: MYCIN, n expert system, tht used rtiiil intelligene to identiy teri using severe inetions (1975). 2/39
3 Dignosis: deteting ults Fult detetion: suield o ontrol engineering whih onerns itsel with monitoring system, identiying when ult hs ourred, nd pinpointing the type o ult nd its lotion. 3/39
4 Dignosis: prediting ults Enhning retivity: (see Foundtion o Dignosis nd Preditility in Proilisti Systems N. Bertrnd, H., E. Leuheux, FSTTCS14) 4/39
5 Ative dignosis: oring detetion Comining ontrol nd dignosis 5/39
6 Outline 1 Amiguity in Lelled Trnsition System (LTS) Ative dignosis in LTS From LTS to proilisti LTS Anlysis o tive dignosis in LTS 6/39
7 Oserving Lelled Trnsition System Sttes re unoservle. Events re either oservle or unoservle. Fults () re unoservle. q 1 q 2 q 0 d u q 3 q 4 q 5 An exeution sequene yields n oserved sequene. Let σ = q 0 uq 3 q 4 q 0 q 1 (q 2 ) ω. Then P(σ) = ω. We only onsider live nd onvergent systems: There is t lest n event rom ny stte. There is no ininite sequene o unoservle events rom ny rehle stte. 7/39
8 Clssiition o oserved sequenes An exeution sequene is ulty i it ontins ult otherwise it is orret. An oserved sequene σ is surely ulty i or ll σ P 1 (σ), σ is ulty. An oserved sequene σ is surely orret i or ll σ P 1 (σ), σ is orret. An oserved sequene σ is miguous i it is neither surely ulty nor surely orret. q 1 q 2 q 0 u d q 3 q 4 q 5 d ω is surely ulty: the ourrene o d implies the ourrene o. ω is surely orret: P 1 () = {q 0 uq 3 q 4 q 5 q 5 }. ω is miguous: P 1 ( ω ) = {q 0 uq 3 (q 4 ) ω, q 0 q 1 (q 2 ) ω }. 8/39
9 How to determine unmiguous sequenes? Build Bühi utomton s synhronized produt o the LTS with ult memory nd the LTS without ults. q 1 q 2 (q 4,q 4) (q 5,q 5) q 0 d (q 0,q 0) (q 0,q 5) u q 3 q 4 q 5 (q 2,q 4) (q 5,q 0) Determinize nd omplement it s: Street utomton with 2 O(n 2 log(n)) sttes where n is the numer o sttes o the LTS. Bühi utomton with 3 2n 2 sttes using the rekpoint onstrution o Miyno nd Hyshi pproprite or the initil Bühi utomton. 9/39
10 An optiml hrteriztion Build deterministi Bühi utomton whose sttes re triples (U, V, W ) with: U the set o possile sttes rehed y orret sequene; W the set o possile sttes rehed y n erliest ulty sequene; V the set o other possile sttes rehed y ulty sequenes. The epting sttes re (U, V, W ) with: U =, i.e. the oserved sequene is (nd will remin) surely ulty; W =, i.e. the erliest ulty sequenes re disrded. q 0 u q 1 q 2 d q 3 q 4 q 5 ({q 0 },, ) ({q 4 },,{q 2 }) d (,,{q 4 }) (,,{q 2,q 4 }) d ({q 0,q 5 },, ) (,,{q 0,q 5 }) ({q 5 },, ) (,,{q 5 }) The numer o sttes is t most 7 n. 10/39
11 A lower ound or miguity...,, l 0 l 1 l 2 l n 1 l n l n+1 d...,,,,d q 0 q 1 q 2 q n 1 q n q n+1,... r 0 r 1 r 2 r n 1 r n r n+1,, d Amiguous sequenes re either {, } k {, } n 1 d ω or {, } k {, } n 1 ω (with 0 k n 1). So deterministi utomton or miguity must hve (t lest) 2 n sttes rehle ter n events. 11/39
12 Outline Amiguity in Lelled Trnsition System (LTS) 2 Ative dignosis in LTS From LTS to proilisti LTS Anlysis o tive dignosis in LTS 12/39
13 Controllle LTS nd tive dignoser Events re lso prtitioned in ontrollle nd unontrollle events. Controllle events must e oservle. A ontroller orids ontrollle events depending on the urrent oserved sequene. An tive dignoser is ontroller suh tht the ontrolled LTS: is still live; does not ontin miguous sequenes. The dely o n tive dignoser is the mximl numer o event ourrenes etween exeution sequene is ulty nd n oserved sequene is surely ulty. 13/39
14 An exmple o tive dignoser The miguous sequenes re {, } ω. The (inite-stte) tive dignoser orids two onseutive. Its dely is 3 (t most n ourrene o ). q 0 q 1 q 2 Σ, Σ, Σ\{},, 14/39
15 Ative dignosis prolems The tive dignosis deision prolem, i.e. deide whether LTS is tively dignosle. The synthesis prolem, i.e. deide whether LTS is tively dignosle nd in the positive se uild n tive dignoser. The miniml-dely synthesis prolem, i.e. deide whether LTS is tively dignosle nd in the positive se uild n tive dignoser with miniml dely. 15/39
16 Bühi gmes A two-plyer (I nd II) Bühi gme is deined y: A grph (V, E) whose verties re owned y plyers with epting verties F ; In vertex v owned y plyer, he selets n edge (v, w) nd the gme goes on with w s urrent vertex. Plyer I wins i Plyer II is stuk in ded vertex or the ininite pth ininitely oten visits F. Gme prolems: Does there exists winning strtegy or Plyer I? In the positive se how to uild suh strtegy? Clssil results: The deision prolem is PTIME-omplete. In the positive se, there is positionl winning strtegy. 16/39
17 A Bühi gme or tive dignosis Verties o the gme The verties o Plyer I re the sttes o the Bühi utomton. The verties o Plyer II re pirs o sttes o the Bühi utomton nd (susets o) events o the LTS. The epting verties re the epting sttes o the Bühi utomton. Edges o the gme There is n edge ((U, V, W ), ((U, V, W ), Σ )) i Σ is suset o events (inluding the unontrollle ones) suh tht rom ll stte o U V W, there is n oserved sequene lelled y some e Σ. There is n edge (((U, V, W ), Σ ), ((U, V, W ), e) i e Σ. There is n edge (((U, V, W ), e), (U, V, W ) i there is trnsition (U, V, W ) e (U, V, W ) in the Bühi utomton. 17/39
18 Exmple o Bühi gme q 0 q 1 q 2, 0 1 ({q 0 },, ) ({q 0 },,{q 2 }) 4 5 ({q 0 },{q 1 }, ) (,,{q 2 }) ({q 0 },,{q 1 }) ({q 0 },{q 2 }, ) (0,{,}) (0,) 1 (0,{,,}) (0,)... (0,{,}) (0,) 2 18/39
19 Results o this onstrution Correspondene etween prolems There is winning strtegy or Plyer I i nd only i there is n tive dignoser. The sttes o this tive dignoser re the sttes o the Bühi utomton. Consequenes The deision prolem is EXPTIME-omplete (the lower ound holds y redution rom sety gmes with prtil oservtion D. Berwnger nd L. Doyen FSTTCS 2008). The synthesis lgorithm yields n tive dignoser with 2 O(n) sttes. The previous synthesis lgorithm yields douly exponentil numer o sttes (M. Smpth, S. Lortune, nd D. Teneketzis, IEEE TAC 1998). For ll n N, there is LTS with n sttes suh tht ny tive dignoser requires 2 Ω(n) sttes. 19/39
20 A lower ound or the synthesis prolem...,, l 0 l 1 l 2 l n 1 l n l n+1... q 0 q 1 q 2 q n 1 q n q n+1,,,,d... r 0 r 1 r 2 r n 1 r n r n+1,, An tive dignoser must orid d (resp. ) i it hs oserved n (resp. ) n times eore. So n tive dignoser must hve (t lest) 2 n sttes rehle ter n oservle events., d d 20/39
21 Wht out miniml dely synthesis? Our synthesis lgorithm provides dely t most twie the miniml dely. For ll n N, there is LTS with n sttes suh tht ny tive dignoser with miniml dely requires 2 Ω(n log(n)) sttes. We hve designed synthesis lgorithm o n tive dignoser with miniml dely tht requires 2 O(n2) sttes. 21/39
22 Outline Amiguity in Lelled Trnsition System (LTS) Ative dignosis in LTS 3 From LTS to proilisti LTS Anlysis o tive dignosis in LTS 22/39
23 plts A proilisti lelled trnsition system (plts) is live LTS with trnsition proility mtrix P., 1 2,1 q 1 q 2, 1 2 q 0, 1 3 d, 1 2 u, 1 2 q 3 q 4,1, 1 3 q 5, 1 3,1 Without lels, plts is disrete time Mrkov hin. Without trnsition proilities, plts is LTS. 23/39
24 (Se) Dignosility A plts is dignosle i the set o sequenes yielding miguous oserved sequenes hs null mesure. A plts is sely dignosle i it is dignosle nd the set o orret sequenes hs positive mesure., 1 2,1 q 1 q 2, 1 2, 1 2,1 q 1 q 2, 1 2 q 0, 1 3 d, 1 2 q 0, 1 2 d, 1 2 u, 1 2 q 3 q 4,1, 1 3 q 5 u, 1 2 q 3 q 4,1, 1 3,1, 1 2 sely dignosle dignosle ut not sely dignosle 24/39
25 LTS A ontrollle proilisti lelled trnsition system (LTS) is live plts with integer weights on trnsitions. nd prtition etween ontrollle nd unontrollle events. An ontroller orids ontrollle events depending on the urrent oserved sequene. It n rndomly selet the oridden events. A ontroller must not introdue dedloks. Let C e LTS nd π e ontroller. Then C π is plts where the proility re otined y normliztion mong the llowed events. Controller π is (se) tive dignoser i C π is (sely) dignosle. 25/39
26 Illustrtion, 1 2,1 q 1 q 2, 1 2 A deterministi tive dignoser π: Forid two onseutive ter n. q 0 u, 1 2, 1 d, 1 3 2, 1 3 q 3 q 4,1 q 5, 1 3,1, 1 3 ε,q 4,Σ d,1 d, 1,1 2, 1 2, 1 3 ε,q 1,Σ,q 2,Σ,q, 2,Σ\{} 1 3, 1 2, 1 3 ε,q 0,Σ ε,q 5,Σ u, 1 2,1, 1 3, 1 2 ε,q 3,Σ,q 4,Σ,q 4,Σ\{},1, 1 3, /39
27 Ative proilisti dignosis The tive proilisti dignosis prolem sks whether there exists n tive dignoser π or C. The se tive proilisti dignosis prolem sks whether there exists se tive dignoser π or C. The synthesis prolems onsist in uilding (se) tive dignoser π or C in the positive se. 27/39
28 Outline Amiguity in Lelled Trnsition System (LTS) Ative dignosis in LTS From LTS to proilisti LTS 4 Anlysis o tive dignosis in LTS 28/39
29 Prtilly oserved Mrkov deision proess A prtilly oservle Mrkov deision proess (POMDP) is tuple M = Q, q 0, Os, At, T where: Q is inite set o sttes with q0 the initil stte; Os : Q O ssigns n oservtion O O to eh stte. At is inite set o tions; T : Q At Dist(Q) is prtil trnsition untion. q q 1... q 2 Given sequene o oservtions, strtegy rndomly selets n tion to e perormed. Given strtegy, POMDP eomes (possily ininite) plts. 29/39
30 From LTS dignosis to POMDP prolems Let C e LTS nd its Bühi utomton B, M C is uilt s ollows. Sttes re pirs (l, q) with l stte o B nd q stte o C with Os(l, q) = l. Ations o M C re suset o events tht inludes the unontrollle events. Given some tion Σ, the trnsition proility o M C rom (l, q) to (l, q ) is: the sum o proilities o pths in C rom q to q ; lelled y unoservle events o Σ ; ending with n oservle event Σ suh tht l B l. The proility o ny suh pth is the produt o the individul step proilities. The ltter re then deined y the normliztion o weights w.r.t. Σ. When in C, some pth rehes stte where no event o Σ is possile, one rehes in M C n dditionl stte lost. 30/39
31 Illustrtion, 1 2,1 q 1 q 2, 1 2 q 0, 1 3 d, 1 2 u, 1 2 q 3 q 4,1, 1 3 q 5, 1 3,1 ({q 0},, ),q 0 Σ\{} Σ ({q 4},,{q 2}),q lost ({q 4},,{q 2}),q /39
32 Deidility o the tive dignosis prolem C is tively dignosle i there exists strtegy in M C suh tht: lmost surely (W = U = ) The existene o strtegy in POMDP or lmost surely stisying Bühi ojetive is deidle (Bier, Bertrnd, Größer, FoSSCS 2008). The proo in (Bertrnd, Genest, Gimert, LICS 2009) is more generl nd elegnt. Anlyzing the redution to the POMDP prolem, we get tht the tive dignosis prolem is EXPTIME-omplete. C is sely tively dignosle i there exists strtegy in M C suh tht: lmost surely (W = U = ); with positive proility U. 32/39
33 Belie-sed dignosers re not enough In our ontext, the elie is the urrent stte o the Bühi utomton. q 1 q 0,, q 3 q 4 q 2 The LTS is strightorwrdly dignosle ut it is not se. A se tive dignoser must perorm guess nd keep in memory one it: oridding ter n odd numer o oservtions; nd oridding ter n even numer o oservtions. 33/39
34 Finite-memory dignosers re not enough u r 0 q 2 q 1 q 0 r 1 r 2 An oserved sequene σ is surely ulty i σ Σ ω. An oserved sequene σ is surely orret i σ ( + ) ω. 34/39
35 Finite-memory dignosers re not enough u r 0 q 2 q 1 q 0 r 1 r 2 A se tive dignoser Pik ny sequene o positive integers {α i } i 1 suh tht i 1 1 > 0. 2 αi Let A = {, u,, } nd A = {, u,, }. Let π e the ontroller tht onsists in seleting, t instnt n, the n th suset in the ollowing sequene A α1 AA α2 A.... Then π is se tive dignoser: All oserved sequenes re either surely ulty or surely orret. The proility tht sequene is orret is 1 2 i αi > 0. There is no inite-memory se tive dignoser. 35/39
36 From lind POMDP to se tive dignosis The existene o n ininite word epted y Bühi proilisti utomton with positive proility is undeidle (Bier, Bertrnd, Größer, Fosss 2008). The existene o winning strtegy with positive proility or Bühi ojetive in lind POMDP (i.e. without oservtion) is undeidle (Chtterjee, Doyen, Gimert, Henzinger, MFCS 2010). We redue the ltter prolem to se tive dignosility prolem. Corollry. The prolem whether, given POMDP M with susets o sttes F nd I, there exists strtegy π with P π (M = F ) = 1 nd P π (M = I) > 0, is undeidle. Oservtion: The existene o strtegy or eh ojetive is deidle. 36/39
37 Sheme o the redution s 2 s M v 2, p t 2 C, p, p, p v 1 i 2, p s 1, p i 1 v, p, p t r 0 u q, 0 r 1 r 2 i t 1, An oserved sequene σ is surely ulty i σ Σ ω. An oserved sequene σ is surely orret i σ (( + ) + ( + )) ω. 37/39
38 Restrition to inite-memory dignosers Oservtion A priori the inite-memory requirement does not ensure deidility. A deision proedure in EXPTIME: Computing the se elies tht ensure the existene o n tive dignoser surely yielding orret sequenes. Cheking the existene o dignoser tht ensure tive dignosility lmost surely nd rehing elie inluding se elie with positive proility. The tive dignoser only requires n dditionl oolen (or swithing its mode). The prolem is EXPTIME-hrd (using the sme redution s eore). 38/39
39 Contriutions Conlusion nd perspetives Strong improvement o the tive dignosis proedures or trnsition systems. Almost mthing lower ounds o the tive dignosis prolems or trnsition systems. Introdution o (se) tive dignosis prolems or proilisti systems. Anlysis o the prolems or proilisti systems using POMDP rmework. Perspetives Closing the gp etween lower nd upper ounds relted to the miniml dely synthesis prolem. Introduing the tive preditility prolem (nd other relted issues). Investigting urther POMDP prolems with multiple ojetives. Modelling nd nlyzing dignosis with stohsti gmes. 39/39
Foundation of Diagnosis and Predictability in Probabilistic Systems
Foundtion of Dignosis nd Preditility in Proilisti Systems Nthlie Bertrnd 1, Serge Hddd 2, Engel Lefuheux 1,2 1 Inri Rennes, Frne 2 LSV, ENS Chn & CNRS & Inri Sly, Frne De. 16th FSTTCS 14 Dignosis of disrete
More informationOptimal Constructions for Active Diagnosis
Optiml Construtions or Ative Dignosis Sten Hr 1, Serge Hddd 1, Trek Melliti 2, nd Sten Shwoon 1 1 LSV (CNRS & ENS Chn) & INRIA, Frne 2 IBISC (Univ Evry Vl-Essonne), Frne Astrt The tsk o dignosis onsists
More informationDecentralized Diagnosis for Nonfailures of Discrete Event Systems Using Inference-Based Ambiguity Management
IEEE TRANSACTIONS ON SYSTEMS, MAN, AND CYBERNETICS PART A: SYSTEMS AND HUMANS, VOL. XX, NO. X, XXX 2009 1 Deentrlized Dignosis or Nonilures o Disrete Event Systems Using Inerene-Bsed Amiguity Mngement
More informationPetri Nets. Rebecca Albrecht. Seminar: Automata Theory Chair of Software Engeneering
Petri Nets Ree Alreht Seminr: Automt Theory Chir of Softwre Engeneering Overview 1. Motivtion: Why not just using finite utomt for everything? Wht re Petri Nets nd when do we use them? 2. Introdution:
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 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 informationControlling a population of identical NFA
Controlling popultion of identicl NFA Nthlie Bertrnd Inri Rennes joint work with Miheer Dewskr (ex CMI student), Blise Genest (IRISA) nd Hugo Gimert (LBRI) LSV 20th nniversry LSV 20th nniversry, My 2017
More informationAutomatic Synthesis of New Behaviors from a Library of Available Behaviors
Automti Synthesis of New Behviors from Lirry of Aville Behviors Giuseppe De Giomo Università di Rom L Spienz, Rom, Itly degiomo@dis.unirom1.it Sestin Srdin RMIT University, Melourne, Austrli ssrdin@s.rmit.edu.u
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 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 informationBehavior Composition in the Presence of Failure
Behior Composition in the Presene of Filure Sestin Srdin RMIT Uniersity, Melourne, Austrli Fio Ptrizi & Giuseppe De Giomo Spienz Uni. Rom, Itly KR 08, Sept. 2008, Sydney Austrli Introdution There re t
More informationLearning Partially Observable Markov Models from First Passage Times
Lerning Prtilly Oservle Mrkov s from First Pssge s Jérôme Cllut nd Pierre Dupont Europen Conferene on Mhine Lerning (ECML) 8 Septemer 7 Outline. FPT in models nd sequenes. Prtilly Oservle Mrkov s (POMMs).
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 informationAlpha Algorithm: Limitations
Proess Mining: Dt Siene in Ation Alph Algorithm: Limittions prof.dr.ir. Wil vn der Alst www.proessmining.org Let L e n event log over T. α(l) is defined s follows. 1. T L = { t T σ L t σ}, 2. T I = { t
More informationHybrid Systems Modeling, Analysis and Control
Hyrid Systems Modeling, Anlysis nd Control Rdu Grosu Vienn University of Tehnology Leture 5 Finite Automt s Liner Systems Oservility, Rehility nd More Miniml DFA re Not Miniml NFA (Arnold, Diky nd Nivt
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 informationOn Determinisation of History-Deterministic Automata.
On Deterministion of History-Deterministic Automt. Denis Kupererg Mich l Skrzypczk University of Wrsw YR-ICALP 2014 Copenhgen Introduction Deterministic utomt re centrl tool in utomt theory: Polynomil
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 informationAlgorithm Design and Analysis
Algorithm Design nd Anlysis LECTURE 5 Supplement Greedy Algorithms Cont d Minimizing lteness Ching (NOT overed in leture) Adm Smith 9/8/10 A. Smith; sed on slides y E. Demine, C. Leiserson, S. Rskhodnikov,
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 informationAlgorithm Design and Analysis
Algorithm Design nd Anlysis LECTURE 8 Mx. lteness ont d Optiml Ching Adm Smith 9/12/2008 A. Smith; sed on slides y E. Demine, C. Leiserson, S. Rskhodnikov, K. Wyne Sheduling to Minimizing Lteness Minimizing
More informationCIT 596 Theory of Computation 1. Graphs and Digraphs
CIT 596 Theory of Computtion 1 A grph G = (V (G), E(G)) onsists of two finite sets: V (G), the vertex set of the grph, often enote y just V, whih is nonempty set of elements lle verties, n E(G), the ege
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 informationPrefix-Free Regular-Expression Matching
Prefix-Free Regulr-Expression Mthing Yo-Su Hn, Yjun Wng nd Derik Wood Deprtment of Computer Siene HKUST Prefix-Free Regulr-Expression Mthing p.1/15 Pttern Mthing Given pttern P nd text T, find ll sustrings
More informationCONTROLLABILITY and observability are the central
1 Complexity of Infiml Oservle Superlnguges Tomáš Msopust Astrt The infiml prefix-losed, ontrollle nd oservle superlnguge plys n essentil role in the reltionship etween ontrollility, oservility nd o-oservility
More informationCS415 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 informationGraph width-parameters and algorithms
Grph width-prmeters nd lgorithms Jisu Jeong (KAIST) joint work with Sigve Hortemo Sæther nd Jn Arne Telle (University of Bergen) 2015 KMS Annul Meeting 2015.10.24. YONSEI UNIVERSITY Grph width-prmeters
More informationDiscrete Structures, Test 2 Monday, March 28, 2016 SOLUTIONS, VERSION α
Disrete Strutures, Test 2 Mondy, Mrh 28, 2016 SOLUTIONS, VERSION α α 1. (18 pts) Short nswer. Put your nswer in the ox. No prtil redit. () Consider the reltion R on {,,, d with mtrix digrph of R.. Drw
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 informationInfinite-Step Opacity of Stochastic Discrete-Event Systems
7 th Asin Control Conferene (ASCC) Gold Cost Convention Centre, Austrli Deemer 7-, 7 Infinite-Step Opity of Stohsti Disrete-Event Systems Xing Yin, Zhojin Li, Weilin Wng nd Shoyun Li Astrt Opity is n importnt
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 informationOn the Maximally-Permissive Range Control Problem in Partially-Observed Discrete Event Systems
On the Mximlly-Permissie Rnge Control Prolem in Prtilly-Osered Disrete Eent Systems Xing Yin nd Stéphne Lfortune EECS Deprtment, Uniersity of Mihign 55th IEEE CDC, De 2-4, 206, Ls Vegs, USA X.Yin & S.Lfortune
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 informationState Complexity of Union and Intersection of Binary Suffix-Free Languages
Stte Complexity of Union nd Intersetion of Binry Suffix-Free Lnguges Glin Jirásková nd Pvol Olejár Slovk Ademy of Sienes nd Šfárik University, Košie 0000 1111 0000 1111 Glin Jirásková nd Pvol Olejár Binry
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 informationCompiler Design. Spring Lexical Analysis. Sample Exercises and Solutions. Prof. Pedro C. Diniz
University of Southern Cliforni Computer Siene Deprtment Compiler Design Spring 7 Lexil Anlysis Smple Exerises nd Solutions Prof. Pedro C. Diniz USC / Informtion Sienes Institute 47 Admirlty Wy, Suite
More informationCounting Paths Between Vertices. Isomorphism of Graphs. Isomorphism of Graphs. Isomorphism of Graphs. Isomorphism of Graphs. Isomorphism of Graphs
Isomorphism of Grphs Definition The simple grphs G 1 = (V 1, E 1 ) n G = (V, E ) re isomorphi if there is ijetion (n oneto-one n onto funtion) f from V 1 to V with the property tht n re jent in G 1 if
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 informationDesigning finite automata II
Designing finite utomt II Prolem: Design DFA A such tht L(A) consists of ll strings of nd which re of length 3n, for n = 0, 1, 2, (1) Determine wht to rememer out the input string Assign stte to ech of
More informationLinear choosability of graphs
Liner hoosility of grphs Louis Esperet, Mikel Montssier, André Rspud To ite this version: Louis Esperet, Mikel Montssier, André Rspud. Liner hoosility of grphs. Stefn Felsner. 2005 Europen Conferene on
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 informationStealthy Deception Attacks for Cyber-Physical Systems
2017 IEEE 56th Annul Conferene on Deision nd Control (CDC) Deemer 12-15, 2017, Melourne, Austrli Stelthy Deeption Attks for Cyer-Physil Systems Rômulo Meir Góes, Eunsuk Kng, Rymond Kwong nd Stéphne Lfortune
More informationGraph States EPIT Mehdi Mhalla (Calgary, Canada) Simon Perdrix (Grenoble, France)
Grph Sttes EPIT 2005 Mehdi Mhll (Clgry, Cnd) Simon Perdrix (Grenole, Frne) simon.perdrix@img.fr Grph Stte: Introdution A grph-sed representtion of the entnglement of some (lrge) quntum stte. Verties: quits
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 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 information1. For each of the following theorems, give a two or three sentence sketch of how the proof goes or why it is not true.
York University CSE 2 Unit 3. DFA Clsses Converting etween DFA, NFA, Regulr Expressions, nd Extended Regulr Expressions Instructor: Jeff Edmonds Don t chet y looking t these nswers premturely.. For ech
More informationTest Generation from Timed Input Output Automata
Chpter 8 Test Genertion from Timed Input Output Automt The purpose of this hpter is to introdue tehniques for the genertion of test dt from models of softwre sed on vrints of timed utomt. The tests generted
More informationAlpha Algorithm: A Process Discovery Algorithm
Proess Mining: Dt Siene in Ation Alph Algorithm: A Proess Disovery Algorithm prof.dr.ir. Wil vn der Alst www.proessmining.org Proess disovery = Ply-In Ply-In event log proess model Ply-Out Reply proess
More informationRunning an NFA & the subset algorithm (NFA->DFA) CS 350 Fall 2018 gilray.org/classes/fall2018/cs350/
Running n NFA & the suset lgorithm (NFA->DFA) CS 350 Fll 2018 gilry.org/lsses/fll2018/s350/ 1 NFAs operte y simultneously exploring ll pths nd epting if ny pth termintes t n ept stte.!2 Try n exmple: L
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 2204 DIGITAL LOGIC & STATE MACHINE DESIGN SPRING 2014
S 224 DIGITAL LOGI & STATE MAHINE DESIGN SPRING 214 DUE : Mrh 27, 214 HOMEWORK III READ : Relte portions of hpters VII n VIII ASSIGNMENT : There re three questions. Solve ll homework n exm prolems s shown
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 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 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 informationThe DOACROSS statement
The DOACROSS sttement Is prllel loop similr to DOALL, ut it llows prouer-onsumer type of synhroniztion. Synhroniztion is llowe from lower to higher itertions sine it is ssume tht lower itertions re selete
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 informationBisimulation, 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 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 informationOn Decentralized Observability of Discrete Event Systems
2011 50th IEEE Conference on Decision nd Control nd Europen Control Conference (CDC-ECC) Orlndo, FL, USA, Decemer 12-15, 2011 On Decentrlized Oservility of Discrete Event Systems M.P. Csino, A. Giu, C.
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 informationSpacetime and the Quantum World Questions Fall 2010
Spetime nd the Quntum World Questions Fll 2010 1. Cliker Questions from Clss: (1) In toss of two die, wht is the proility tht the sum of the outomes is 6? () P (x 1 + x 2 = 6) = 1 36 - out 3% () P (x 1
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 informationConvert the NFA into DFA
Convert the NF into F For ech NF we cn find F ccepting the sme lnguge. The numer of sttes of the F could e exponentil in the numer of sttes of the NF, ut in prctice this worst cse occurs rrely. lgorithm:
More informationGénération aléatoire uniforme pour les réseaux d automates
Génértion létoire uniforme pour les réseux d utomtes Niols Bsset (Trvil ommun ve Mihèle Sori et Jen Miresse) Université lire de Bruxelles Journées Alé 2017 1/25 Motivtions (1/2) p q Automt re omni-present
More informationnd edges. Eh edge hs either one endpoint: end(e) = fxg in whih se e is termed loop t vertex x, or two endpoints: end(e) = fx; yg in whih se e is terme
Theory of Regions Eri Bdouel nd Philippe Drondeu Iris, Cmpus de Beulieu, F-35042 Rennes Cedex, Frne E-mil : feri.bdouel,philippe.drondeug@iris.fr Astrt. The synthesis prolem for nets onsists in deiding
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 informationA Disambiguation Algorithm for Finite Automata and Functional Transducers
A Dismigution Algorithm for Finite Automt n Funtionl Trnsuers Mehryr Mohri Cournt Institute of Mthemtil Sienes n Google Reserh 51 Merer Street, New York, NY 1001, USA Astrt. We present new ismigution lgorithm
More informationImplication Graphs and Logic Testing
Implition Grphs n Logi Testing Vishwni D. Agrwl Jmes J. Dnher Professor Dept. of ECE, Auurn University Auurn, AL 36849 vgrwl@eng.uurn.eu www.eng.uurn.eu/~vgrwl Joint reserh with: K. K. Dve, ATI Reserh,
More informationLecture Notes No. 10
2.6 System Identifition, Estimtion, nd Lerning Leture otes o. Mrh 3, 26 6 Model Struture of Liner ime Invrint Systems 6. Model Struture In representing dynmil system, the first step is to find n pproprite
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 informationTypes of Finite Automata. CMSC 330: Organization of Programming Languages. Comparing DFAs and NFAs. NFA for (a b)*abb.
CMSC 330: Orgniztion of Progrmming Lnguges Finite Automt 2 Types of Finite Automt Deterministic Finite Automt () Exctly one sequence of steps for ech string All exmples so fr Nondeterministic Finite Automt
More informationCS 310 (sec 20) - Winter Final Exam (solutions) SOLUTIONS
CS 310 (sec 20) - Winter 2003 - Finl Exm (solutions) SOLUTIONS 1. (Logic) Use truth tles to prove the following logicl equivlences: () p q (p p) (q q) () p q (p q) (p q) () p q p q p p q q (q q) (p p)
More informationOn-Time Diagnosis of Discrete Event Systems
Proeedings of the 9th Interntionl Workshop on Disrete Event Systems Göteorg, Sweden, My 28-30, 2008 FrM1.3 On-Time Dignosis of Disrete Event Systems Adity Mhjn nd Demosthenis Teneketzis Deprtment of EECS,
More informationCODIAGNOSABILITY OF NETWORKED DISCRETE EVENT SYSTEMS WITH TIMING STRUCTURE. Gustavo da Silva Viana
CODIAGNOSABILITY OF NETWORKED DISCRETE EVENT SYSTEMS WITH TIMING STRUCTURE Gustvo d Silv Vin Tese de Doutordo presentd o Progrm de Pós-grdução em Engenhri Elétri, COPPE, d Universidde Federl do Rio de
More informationANALYSIS AND MODELLING OF RAINFALL EVENTS
Proeedings of the 14 th Interntionl Conferene on Environmentl Siene nd Tehnology Athens, Greee, 3-5 Septemer 215 ANALYSIS AND MODELLING OF RAINFALL EVENTS IOANNIDIS K., KARAGRIGORIOU A. nd LEKKAS D.F.
More informationCS 491G Combinatorial Optimization Lecture Notes
CS 491G Comintoril Optimiztion Leture Notes Dvi Owen July 30, August 1 1 Mthings Figure 1: two possile mthings in simple grph. Definition 1 Given grph G = V, E, mthing is olletion of eges M suh tht e i,
More informationSubsequence Automata with Default Transitions
Susequene Automt with Defult Trnsitions Philip Bille, Inge Li Gørtz, n Freerik Rye Skjoljensen Tehnil University of Denmrk {phi,inge,fskj}@tu.k Astrt. Let S e string of length n with hrters from n lphet
More informationAutomata and Regular Languages
Chpter 9 Automt n Regulr Lnguges 9. Introution This hpter looks t mthemtil moels of omputtion n lnguges tht esrie them. The moel-lnguge reltionship hs multiple levels. We shll explore the simplest level,
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 informationRandom subgroups of a free group
Rndom sugroups of free group Frédérique Bssino LIPN - Lortoire d Informtique de Pris Nord, Université Pris 13 - CNRS Joint work with Armndo Mrtino, Cyril Nicud, Enric Ventur et Pscl Weil LIX My, 2015 Introduction
More informationFinite Automata-cont d
Automt Theory nd Forml Lnguges Professor Leslie Lnder Lecture # 6 Finite Automt-cont d The Pumping Lemm WEB SITE: http://ingwe.inghmton.edu/ ~lnder/cs573.html Septemer 18, 2000 Exmple 1 Consider L = {ww
More informationComparing the Pre-image and Image of a Dilation
hpter Summry Key Terms Postultes nd Theorems similr tringles (.1) inluded ngle (.2) inluded side (.2) geometri men (.) indiret mesurement (.6) ngle-ngle Similrity Theorem (.2) Side-Side-Side Similrity
More informationThe size of subsequence automaton
Theoreticl Computer Science 4 (005) 79 84 www.elsevier.com/locte/tcs Note The size of susequence utomton Zdeněk Troníček,, Ayumi Shinohr,c Deprtment of Computer Science nd Engineering, FEE CTU in Prgue,
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 informationTypes of Finite Automata. CMSC 330: Organization of Programming Languages. Comparing DFAs and NFAs. Comparing DFAs and NFAs (cont.) Finite Automata 2
CMSC 330: Orgniztion of Progrmming Lnguges Finite Automt 2 Types of Finite Automt Deterministic Finite Automt () Exctly one sequence of steps for ech string All exmples so fr Nondeterministic Finite Automt
More informationA Lower Bound for the Length of a Partial Transversal in a Latin Square, Revised Version
A Lower Bound for the Length of Prtil Trnsversl in Ltin Squre, Revised Version Pooy Htmi nd Peter W. Shor Deprtment of Mthemtil Sienes, Shrif University of Tehnology, P.O.Bo 11365-9415, Tehrn, Irn Deprtment
More informationCS103B Handout 18 Winter 2007 February 28, 2007 Finite Automata
CS103B ndout 18 Winter 2007 Ferury 28, 2007 Finite Automt Initil text y Mggie Johnson. Introduction Severl childrens gmes fit the following description: Pieces re set up on plying ord; dice re thrown or
More informationCMSC 330: Organization of Programming Languages
CMSC 330: Orgniztion of Progrmming Lnguges Finite Automt 2 CMSC 330 1 Types of Finite Automt Deterministic Finite Automt (DFA) Exctly one sequence of steps for ech string All exmples so fr Nondeterministic
More informationGeneralization of 2-Corner Frequency Source Models Used in SMSIM
Generliztion o 2-Corner Frequeny Soure Models Used in SMSIM Dvid M. Boore 26 Mrh 213, orreted Figure 1 nd 2 legends on 5 April 213, dditionl smll orretions on 29 My 213 Mny o the soure spetr models ville
More informationThe Word Problem in Quandles
The Word Prolem in Qundles Benjmin Fish Advisor: Ren Levitt April 5, 2013 1 1 Introdution A word over n lger A is finite sequene of elements of A, prentheses, nd opertions of A defined reursively: Given
More informationMyhill-Nerode Theorem
Overview Myhill-Nerode Theorem Correspondence etween DA s nd MN reltions Cnonicl DA for L Computing cnonicl DFA Myhill-Nerode Theorem Deepk D Souz Deprtment of Computer Science nd Automtion Indin Institute
More informationSynchronizing Automata with Random Inputs
Synchronizing Automt with Rndom Inputs Vldimir Gusev Url Federl University, Ekterinurg, Russi 9 August, 14 Vldimir Gusev (UrFU) Synchronizing Automt with Rndom Input 9 August, 14 1 / 13 Introduction Synchronizing
More informationCSE 332. Sorting. Data Abstractions. CSE 332: Data Abstractions. QuickSort Cutoff 1. Where We Are 2. Bounding The MAXIMUM Problem 4
Am Blnk Leture 13 Winter 2016 CSE 332 CSE 332: Dt Astrtions Sorting Dt Astrtions QuikSort Cutoff 1 Where We Are 2 For smll n, the reursion is wste. The onstnts on quik/merge sort re higher thn the ones
More informationHomework 3 Solutions
CS 341: Foundtions of Computer Science II Prof. Mrvin Nkym Homework 3 Solutions 1. Give NFAs with the specified numer of sttes recognizing ech of the following lnguges. In ll cses, the lphet is Σ = {,1}.
More informationNFA DFA Example 3 CMSC 330: Organization of Programming Languages. Equivalence of DFAs and NFAs. Equivalence of DFAs and NFAs (cont.
NFA DFA Exmple 3 CMSC 330: Orgniztion of Progrmming Lnguges NFA {B,D,E {A,E {C,D {E Finite Automt, con't. R = { {A,E, {B,D,E, {C,D, {E 2 Equivlence of DFAs nd NFAs Any string from {A to either {D or {CD
More informationThoery of Automata CS402
Thoery of Automt C402 Theory of Automt Tle of contents: Lecture N0. 1... 4 ummry... 4 Wht does utomt men?... 4 Introduction to lnguges... 4 Alphets... 4 trings... 4 Defining Lnguges... 5 Lecture N0. 2...
More informationIntermediate Math Circles Wednesday 17 October 2012 Geometry II: Side Lengths
Intermedite Mth Cirles Wednesdy 17 Otoer 01 Geometry II: Side Lengths Lst week we disussed vrious ngle properties. As we progressed through the evening, we proved mny results. This week, we will look t
More informationLecture 6: Coding theory
Leture 6: Coing theory Biology 429 Crl Bergstrom Ferury 4, 2008 Soures: This leture loosely follows Cover n Thoms Chpter 5 n Yeung Chpter 3. As usul, some of the text n equtions re tken iretly from those
More informationTable of contents: Lecture N Summary... 3 What does automata mean?... 3 Introduction to languages... 3 Alphabets... 3 Strings...
Tle of contents: Lecture N0.... 3 ummry... 3 Wht does utomt men?... 3 Introduction to lnguges... 3 Alphets... 3 trings... 3 Defining Lnguges... 4 Lecture N0. 2... 7 ummry... 7 Kleene tr Closure... 7 Recursive
More informationCS241 Week 6 Tutorial Solutions
241 Week 6 Tutoril olutions Lnguges: nning & ontext-free Grmmrs Winter 2018 1 nning Exerises 1. 0x0x0xd HEXINT 0x0 I x0xd 2. 0xend--- HEXINT 0xe I nd ER -- MINU - 3. 1234-120x INT 1234 INT -120 I x 4.
More information