Automatic Synthesis of New Behaviors from a Library of Available Behaviors
|
|
- Ilene Park
- 6 years ago
- Views:
Transcription
1 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
2 Behvior omposition Environment is similr to n tion theory! Behviors re similr to root progrms; pture possile exeutions Trget ehvior desription of the desired ehvior expressed in terms of virtul tions Environment desription of (virtul) tions, preoditions nd effets Aville ehviors desriptions of the ehvior of ville gents/devies expressed in terms virtul tions Atul ville ehviors Key points Ations re virtul Only ville ehviors provide tul tion exeution Must relize trget ehvior using frgments of ville ehviors Automti Synthesis of New Behviors from Lirry of Aville Behviors IJCAI 07 - Jn 12, 2007 Hyderd, Indi Giuseppe De Giomo 2
3 Behvior omposition: the setting studied Environment: Desrie preondition nd effet of tions (s n tion theory) Finite stte (to get omputiliy of the synthesis) Nondeterministi (devilish/don t t know nondeterminism) Represented s (finite) trnsition system (we re not onerned with representtion in this work) Aville ehviors: Desrie the pilities of the gent/devie Finite stte (to get omputility of the synthesis) Nondeterministi (devilish/don t t know nondeterminism) Cn ess the stte of the environment Cn not ess the stte of the other ville ehviors Represented s (finite) trnsition systems (with gurds to test the environment) Trget ehvior: As ville ehvior ut deterministi it s s spe of desired ehvior: we know wht we wnt! Prolem: synthesize sheduler tht relize the trget ehvior y suitly omposing the ville ehviors Automti Synthesis of New Behviors from Lirry of Aville Behviors IJCAI 07 - Jn 12, 2007 Hyderd, Indi Giuseppe De Giomo 3
4 Exmple trget ehvior (virtul!) ville ehvior 1 ville ehvior 2 sheduler Simplified se: ville ehviors re deterministi finite trnsition systems Automti Synthesis of New Behviors from Lirry of Aville Behviors IJCAI 07 - Jn 12, 2007 Hyderd, Indi Giuseppe De Giomo 4
5 Exmple trget ehvior ville ehvior 1 ville ehvior 2 sheduler A smple run tion request: sheduler response: Automti Synthesis of New Behviors from Lirry of Aville Behviors IJCAI 07 - Jn 12, 2007 Hyderd, Indi Giuseppe De Giomo 5
6 Exmple trget ehvior ville ehvior 1 ville ehvior 2 sheduler A smple run tion request: sheduler response:,1 Automti Synthesis of New Behviors from Lirry of Aville Behviors IJCAI 07 - Jn 12, 2007 Hyderd, Indi Giuseppe De Giomo 6
7 Exmple trget ehvior ville ehvior 1 ville ehvior 2 sheduler A smple run tion request: sheduler response:,1,1 Automti Synthesis of New Behviors from Lirry of Aville Behviors IJCAI 07 - Jn 12, 2007 Hyderd, Indi Giuseppe De Giomo 7
8 Exmple trget ehvior ville ehvior 1 ville ehvior 2 sheduler A smple run tion request: sheduler response:,1,1,2 Automti Synthesis of New Behviors from Lirry of Aville Behviors IJCAI 07 - Jn 12, 2007 Hyderd, Indi Giuseppe De Giomo 8
9 Exmple trget ehvior ville ehvior 1 ville ehvior 2 sheduler A smple run tion request: sheduler response:,1,1,2,2 Automti Synthesis of New Behviors from Lirry of Aville Behviors IJCAI 07 - Jn 12, 2007 Hyderd, Indi Giuseppe De Giomo 9
10 A sheduler progrm relizing the trget ehvior trget ehvior ville ehvior 1 sheduler progrm :1 :1 sheduler ville ehvior 2 :2 :2 Automti Synthesis of New Behviors from Lirry of Aville Behviors IJCAI 07 - Jn 12, 2007 Hyderd, Indi Giuseppe De Giomo 10
11 Nondeterminism Nondeterministi environment Inomplete informtion on effets of tions Ation outome depends on externl (not modeled) events Nondeterministi ville ehviors Inomplete informtion on the tul ehvior Mismth etween ehvior desription (whih is in terms of the environment tions) nd tul ehvior of the gents/devies Deterministi trget ehvior Devilish (don t know)! it s s spe of desired ehvior: (devilish) nondeterminism is nned In generl, devilish nondeterminism diffiult to ope with eg. nondeterminism moves AI Plnning from PSPACE (lssil plnning) to EXPTIME (ontingent plnning with full oservility [Rintnen04]) Automti Synthesis of New Behviors from Lirry of Aville Behviors IJCAI 07 - Jn 12, 2007 Hyderd, Indi Giuseppe De Giomo 11
12 Exmple nondeterministi ehviors trget ehvior ehvior 1 S10 S11 sheduler ehvior 2 Devilish nondeterminism! S20 Aville ehviors represented s nondeterministi trnsition systems Automti Synthesis of New Behviors from Lirry of Aville Behviors IJCAI 07 - Jn 12, 2007 Hyderd, Indi Giuseppe De Giomo 12
13 Exmple nondeterministi ehviors trget ehvior ehvior 1 S10 S11 sheduler ehvior 2 S20 Automti Synthesis of New Behviors from Lirry of Aville Behviors IJCAI 07 - Jn 12, 2007 Hyderd, Indi Giuseppe De Giomo 13
14 Exmple nondeterministi ehviors trget ehvior ehvior 1 S10 S11 sheduler ehvior 2 S20 Automti Synthesis of New Behviors from Lirry of Aville Behviors IJCAI 07 - Jn 12, 2007 Hyderd, Indi Giuseppe De Giomo 14
15 Exmple nondeterministi ehviors trget ehvior ehvior 1 oserve the tul stte! S10 S11 sheduler ehvior 2 S20 Automti Synthesis of New Behviors from Lirry of Aville Behviors IJCAI 07 - Jn 12, 2007 Hyderd, Indi Giuseppe De Giomo 15
16 Exmple nondeterministi ehviors trget ehvior ehvior 1 oserve the tul stte! S10 S11 sheduler ehvior 2 S20 Automti Synthesis of New Behviors from Lirry of Aville Behviors IJCAI 07 - Jn 12, 2007 Hyderd, Indi Giuseppe De Giomo 16
17 Exmple: nondeterministi ehviors trget ehvior ehvior 1 oserve the tul stte! S10 S11 sheduler ehvior 2 S20 Automti Synthesis of New Behviors from Lirry of Aville Behviors IJCAI 07 - Jn 12, 2007 Hyderd, Indi Giuseppe De Giomo 17
18 A sheduler progrm relizing the trget ehvior trget ehvior ehvior 1 S10 S11 sheduler progrm sheduler ehvior 2 S11::1 true::1 S20 S10::2 Automti Synthesis of New Behviors from Lirry of Aville Behviors IJCAI 07 - Jn 12, 2007 Hyderd, Indi Giuseppe De Giomo 18
19 Sheduler progrms Sheduler progrm is ny funtion P(h,) = i tht tkes history h nd n tion to exeute nd delgtes to the ville ehvior i A history is sequene of the form: (s 10,s 20,,s,s n0,e 0 ) 1 (s 11,s 21,,s,s n1,e 1 ) k (s k1,s 2k,,s,s nk,e k ) ontins ll the oservle informtion up the urrent sitution Oserve tht to tke deision P hs full ess to the pst,, ut no ess to the future Prolem: synthesize sheduler progrm P tht relizes the trget ehvior mking use of the ville ehviors Automti Synthesis of New Behviors from Lirry of Aville Behviors IJCAI 07 - Jn 12, 2007 Hyderd, Indi Giuseppe De Giomo 19
20 Tehnique: redution to PDL Bsi ide: A sheduler progrm P relizes the trget ehvior T iff: trnsition leled of the trget ehvior T n ville ehvior B i (the one hosen y P) ) whih n mke n -trnsition nd -trnsition of B i relizes the -trnsition of T Enoding in PDL: trnsition leled use rnhing n ville ehvior B i use underspeified predites ssigned through SAT -trnsition of B i : use rnhing gin Automti Synthesis of New Behviors from Lirry of Aville Behviors IJCAI 07 - Jn 12, 2007 Hyderd, Indi Giuseppe De Giomo 20
21 Struture of the PDL enoding = Init [u]( 0 i=1,,n i ux ) Initil sttes of ll ehviors PDL enoding of trget ehvior PDL enoding of the i-th ville ehvior + environment PDL dditionl dominindependent onditions PDL enoding is polynomil in the size of the trget ehvior, ville ehviors, nd environment Automti Synthesis of New Behviors from Lirry of Aville Behviors IJCAI 07 - Jn 12, 2007 Hyderd, Indi Giuseppe De Giomo 21
22 Tehnil results: theoretil Thm Cheking the existene of sheduler progrm relizing the trget ehvior is EXPTIME-omplete. EXPTIME-hrdness due to Musholl&Wlukiewiz05 for deterministi ehviors Thm If sheduler progrm exists there exists one tht is finite stte. Exploits the finite model property of PDL Automti Synthesis of New Behviors from Lirry of Aville Behviors IJCAI 07 - Jn 12, 2007 Hyderd, Indi Giuseppe De Giomo 22
23 Tehnil results: prtil Redution to PDL provides lso prtil sound nd omplete tehnique to ompute the sheduler progrm Use stte-of-the-rt tleux systems for OWL-DL for heking SAT of PDL formul If SAT, the tleu returns finite model of eg, Univ. Mrylnd exponentil in the size of the ehviors Projet wy irrelevnt predites from suh model, nd possily minimize polynomil in the size of the model The resulting struture is finite sheduler progrm tht relizes the trget ehvior Automti Synthesis of New Behviors from Lirry of Aville Behviors IJCAI 07 - Jn 12, 2007 Hyderd, Indi Giuseppe De Giomo 23
24 Conlusion Nondeterministi trget ehvior? loose speifition in lient request ngeli (don re) vs devilish (don t t know) nondeterminism see ICSOC 04 for ides Distriute the sheduler? Often entrlized sheduler is unrelisti: eg. Root Eologies too tight oordintion too muh ommunition sheduler nnot e emodied nywhere drop entrlized sheduler in fvor of independent ontrollers on single ville ehviors (exhnging messges) we re tively working on it Infinite sttes ehviors? Importnt for deling with dt/prmeters this is the single most diffiult issue to tkle first results: tions s DB updtes, see VLDB 05 literture on Astrtion in Verifition Automti Synthesis of New Behviors from Lirry of Aville Behviors IJCAI 07 - Jn 12, 2007 Hyderd, Indi Giuseppe De Giomo 24
Behavior 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 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 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 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 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 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 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 informationCSC2542 State-Space Planning
CSC2542 Stte-Spe Plnning Sheil MIlrith Deprtment of Computer Siene University of Toronto Fll 2010 1 Aknowlegements Some the slies use in this ourse re moifitions of Dn Nu s leture slies for the textook
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 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 informationActive Diagnosis. Serge Haddad. Vecos 16. October the 6th 2016
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
More informationLing 3701H / Psych 3371H: Lecture Notes 9 Hierarchic Sequential Prediction
Ling 3701H / Psyh 3371H: Leture Notes 9 Hierrhi Sequentil Predition Contents 9.1 Complex events.................................... 1 9.2 Reognition of omplex events using event frgments................
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 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 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 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 informationLaboratory for Foundations of Computer Science. An Unfolding Approach. University of Edinburgh. Model Checking. Javier Esparza
An Unfoling Approh to Moel Cheking Jvier Esprz Lbortory for Fountions of Computer Siene University of Einburgh Conurrent progrms Progrm: tuple P T 1 T n of finite lbelle trnsition systems T i A i S i i
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 informationTIME AND STATE IN DISTRIBUTED SYSTEMS
Distriuted Systems Fö 5-1 Distriuted Systems Fö 5-2 TIME ND STTE IN DISTRIUTED SYSTEMS 1. Time in Distriuted Systems Time in Distriuted Systems euse eh mhine in distriuted system hs its own lok there is
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 informationLogic Synthesis and Verification
Logi Synthesis nd Verifition SOPs nd Inompletely Speified Funtions Jie-Hong Rolnd Jing 江介宏 Deprtment of Eletril Engineering Ntionl Tiwn University Fll 2010 Reding: Logi Synthesis in Nutshell Setion 2 most
More informationFoundation 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 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 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 informationAP Calculus BC Chapter 8: Integration Techniques, L Hopital s Rule and Improper Integrals
AP Clulus BC Chpter 8: Integrtion Tehniques, L Hopitl s Rule nd Improper Integrls 8. Bsi Integrtion Rules In this setion we will review vrious integrtion strtegies. Strtegies: I. Seprte the integrnd into
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 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 informationQubit and Quantum Gates
Quit nd Quntum Gtes Shool on Quntum omputing @Ygmi Dy, Lesson 9:-:, Mrh, 5 Eisuke Ae Deprtment of Applied Physis nd Physio-Informtis, nd REST-JST, Keio University From lssil to quntum Informtion is physil
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 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 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 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 informationEngr354: Digital Logic Circuits
Engr354: Digitl Logi Ciruits Chpter 4: Logi Optimiztion Curtis Nelson Logi Optimiztion In hpter 4 you will lern out: Synthesis of logi funtions; Anlysis of logi iruits; Tehniques for deriving minimum-ost
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 informationUnfoldings of Networks of Timed Automata
Unfolings of Networks of Time Automt Frnk Cssez Thoms Chtin Clue Jr Ptrii Bouyer Serge H Pierre-Alin Reynier Rennes, Deemer 3, 2008 Unfolings [MMilln 93] First efine for Petri nets Then extene to other
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 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 informationProject 6: Minigoals Towards Simplifying and Rewriting Expressions
MAT 51 Wldis Projet 6: Minigols Towrds Simplifying nd Rewriting Expressions The distriutive property nd like terms You hve proly lerned in previous lsses out dding like terms ut one prolem with the wy
More informationAutomated Composition of E-services: Lookaheads
Automted Composition of E-servies: Lookheds Çğdş Evren Gerede Deprtment of Computer Siene, University of Cliforni, Snt Brr, CA 93106, USA. Rihrd Hull Bell Lortories/Luent Tehnologies, 700 Mountin Avenue,
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 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 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 information22: Union Find. CS 473u - Algorithms - Spring April 14, We want to maintain a collection of sets, under the operations of:
22: Union Fin CS 473u - Algorithms - Spring 2005 April 14, 2005 1 Union-Fin We wnt to mintin olletion of sets, uner the opertions of: 1. MkeSet(x) - rete set tht ontins the single element x. 2. Fin(x)
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 informationResources. Introduction: Binding. Resource Types. Resource Sharing. The type of a resource denotes its ability to perform different operations
Introduction: Binding Prt of 4-lecture introduction Scheduling Resource inding Are nd performnce estimtion Control unit synthesis This lecture covers Resources nd resource types Resource shring nd inding
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 informationOptimizing the Nominal Introduction Rule in (Hyper)Tableau Calculi
Optimizing the Nominl Introdution ule in (Hyper)Tleu Cluli oris Motik, o herer, nd In Horroks Oxford University Computing Lortory 1 Introdution A tleu lulus for HIQ hs een known for some time, nd forms
More informationSupervisory Control under Partial Observation
Supervisory Control under Prtil Observtion Dr Rong Su S1-B1b-59, Shool of EEE Nnyng Tehnologil University Tel: +65 6790-6042, Emil: rsu@ntu.edu.sg EE6226 Disrete Event Dynmi Systems 1 Outline Motivtion
More informationFormal Language and Automata Theory (CS21004)
Forml Lnguge nd Automt Forml Lnguge nd Automt Theory (CS21004) Khrgpur Khrgpur Khrgpur Forml Lnguge nd Automt Tle of Contents Forml Lnguge nd Automt Khrgpur 1 2 3 Khrgpur Forml Lnguge nd Automt Forml Lnguge
More informationTrigonometry and Constructive Geometry
Trigonometry nd Construtive Geometry Trining prolems for M2 2018 term 1 Ted Szylowie tedszy@gmil.om 1 Leling geometril figures 1. Prtie writing Greek letters. αβγδɛθλµπψ 2. Lel the sides, ngles nd verties
More informationLinear Systems with Constant Coefficients
Liner Systems with Constnt Coefficients 4-3-05 Here is system of n differentil equtions in n unknowns: x x + + n x n, x x + + n x n, x n n x + + nn x n This is constnt coefficient liner homogeneous system
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 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 informationAgent Composition Synthesis based on ATL
Agent Composition Synthesis sed on ATL Giuseppe De Gicomo nd Polo Felli Diprtimento di Informtic e Sistemistic SAPIENZA - Università di Rom Vi Ariosto 25-00185 Rom, Itly {degicomo,felli}@dis.unirom1.it
More informationCS 347 Parallel and Distributed Data Processing
CS 347 Prllel nd Distriuted Dt Proessing Spring 06 Network Prtitions Susets of nodes m e isolted or nodes m e slow in responding Notes 8: Network Prtitions CS 347 Notes 8 Network Prtitions Cuses ired network
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 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 informationNecessary and sucient conditions for some two. Abstract. Further we show that the necessary conditions for the existence of an OD(44 s 1 s 2 )
Neessry n suient onitions for some two vrile orthogonl esigns in orer 44 C. Koukouvinos, M. Mitrouli y, n Jennifer Seerry z Deite to Professor Anne Penfol Street Astrt We give new lgorithm whih llows us
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 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 informationParticle Physics. Michaelmas Term 2011 Prof Mark Thomson. Handout 3 : Interaction by Particle Exchange and QED. Recap
Prtile Physis Mihelms Term 2011 Prof Mrk Thomson g X g X g g Hnout 3 : Intertion y Prtile Exhnge n QED Prof. M.A. Thomson Mihelms 2011 101 Rep Working towrs proper lultion of ey n sttering proesses lnitilly
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 informationCMPSCI 250: Introduction to Computation. Lecture #31: What DFA s Can and Can t Do David Mix Barrington 9 April 2014
CMPSCI 250: Introduction to Computtion Lecture #31: Wht DFA s Cn nd Cn t Do Dvid Mix Brrington 9 April 2014 Wht DFA s Cn nd Cn t Do Deterministic Finite Automt Forml Definition of DFA s Exmples of DFA
More informationD. Harel, Statecharts: A visual formalism for complex systems, Science of Computer Programming 8, 1987, pp
Sttechrts y Kenr ooper ontents Introuction Stte igrms epth (hierrchy) Orthogonlity (concurrency) rocst ommuniction Exmple Prolems Introuction Sttechrts were introuce y vi Hrel in 1987. Hrel, Sttechrts:
More informationUnit 4. Combinational Circuits
Unit 4. Comintionl Ciruits Digitl Eletroni Ciruits (Ciruitos Eletrónios Digitles) E.T.S.I. Informáti Universidd de Sevill 5/10/2012 Jorge Jun 2010, 2011, 2012 You re free to opy, distriute
More information6.5 Improper integrals
Eerpt from "Clulus" 3 AoPS In. www.rtofprolemsolving.om 6.5. IMPROPER INTEGRALS 6.5 Improper integrls As we ve seen, we use the definite integrl R f to ompute the re of the region under the grph of y =
More information@#? Text Search ] { "!" Nondeterministic Finite Automata. Transformation NFA to DFA and Simulation of NFA. Text Search Using Automata
g Text Serh @#? ~ Mrko Berezovský Rdek Mřík PAL 0 Nondeterministi Finite Automt n Trnsformtion NFA to DFA nd Simultion of NFA f Text Serh Using Automt A B R Power of Nondeterministi Approh u j Regulr Expression
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 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 informationLecture 3. In this lecture, we will discuss algorithms for solving systems of linear equations.
Lecture 3 3 Solving liner equtions In this lecture we will discuss lgorithms for solving systems of liner equtions Multiplictive identity Let us restrict ourselves to considering squre mtrices since one
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 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 informationUniversity of Sioux Falls. MAT204/205 Calculus I/II
University of Sioux Flls MAT204/205 Clulus I/II Conepts ddressed: Clulus Textook: Thoms Clulus, 11 th ed., Weir, Hss, Giordno 1. Use stndrd differentition nd integrtion tehniques. Differentition tehniques
More informationChapter 5 Plan-Space Planning
Lecture slides for Automted Plnning: Theory nd Prctice Chpter 5 Pln-Spce Plnning Dn S. Nu CMSC 722, AI Plnning University of Mrylnd, Spring 2008 1 Stte-Spce Plnning Motivtion g 1 1 g 4 4 s 0 g 5 5 g 2
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 informationSymmetrical Components 1
Symmetril Components. Introdution These notes should e red together with Setion. of your text. When performing stedy-stte nlysis of high voltge trnsmission systems, we mke use of the per-phse equivlent
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 informationPre-Lie algebras, rooted trees and related algebraic structures
Pre-Lie lgers, rooted trees nd relted lgeri strutures Mrh 23, 2004 Definition 1 A pre-lie lger is vetor spe W with mp : W W W suh tht (x y) z x (y z) = (x z) y x (z y). (1) Exmple 2 All ssoitive lgers
More informationGold s algorithm. Acknowledgements. Why would this be true? Gold's Algorithm. 1 Key ideas. Strings as states
Acknowledgements Gold s lgorithm Lurent Miclet, Jose Oncin nd Tim Otes for previous versions of these slides. Rfel Crrsco, Pco Cscuert, Rémi Eyrud, Philippe Ezequel, Henning Fernu, Thierry Murgue, Frnck
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 informationCODIAGNOSABILITY OF NETWORKED DISCRETE EVENT SYSTEMS SUBJECT TO COMMUNICATION DELAYS AND INTERMITTENT LOSS OF OBSERVATION. Carlos Eduardo Viana Nunes
CODIAGNOSABILITY OF NETWORKED DISCRETE EVENT SYSTEMS SUBJECT TO COMMUNICATION DELAYS AND INTERMITTENT LOSS OF OBSERVATION Crlos Edurdo Vin Nunes Tese de Doutordo presentd o Progrm de Pós-grdução em Engenhri
More informationFormal Methods for XML: Algorithms & Complexity
Forml Methods for XML: Algorithms & Complexity S. Mrgherit di Pul August 2004 Thoms Shwentik Shwentik XML: Algorithms & Complexity Introdution 1 XML Exmple Doument Composer Nme Clude Debussy /Nme Vit Born
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 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 informationBottom-Up Parsing. Canonical Collection of LR(0) items. Part II
2 ottom-up Prsing Prt II 1 Cnonil Colletion of LR(0) items CC_LR(0)_I items(g :ugmented_grmmr){ C = {CLOURE({ })} ; repet{ foreh(i C) foreh(grmmr symol X) if(goto(i,x) && GOTO(I,X) C) C = C {GOTO(I,X)};
More information15-451/651: Design & Analysis of Algorithms December 3, 2013 Lecture #28 last changed: November 28, 2013
15-451/651: Design & nlysis of lgorithms Deemer 3, 2013 Leture #28 lst hnged: Novemer 28, 2013 Lst time we strted tlking out mehnism design: how to llote n item to the person who hs the mximum vlue for
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 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 informationJim Lambers MAT 169 Fall Semester Lecture 4 Notes
Jim Lmbers MAT 169 Fll Semester 2009-10 Lecture 4 Notes These notes correspond to Section 8.2 in the text. Series Wht is Series? An infinte series, usully referred to simply s series, is n sum of ll of
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 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 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 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 informationMetodologie di progetto HW Technology Mapping. Last update: 19/03/09
Metodologie di progetto HW Tehnology Mpping Lst updte: 19/03/09 Tehnology Mpping 2 Tehnology Mpping Exmple: t 1 = + b; t 2 = d + e; t 3 = b + d; t 4 = t 1 t 2 + fg; t 5 = t 4 h + t 2 t 3 ; F = t 5 ; t
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 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 informationLecture 08: Feb. 08, 2019
4CS4-6:Theory of Computtion(Closure on Reg. Lngs., regex to NDFA, DFA to regex) Prof. K.R. Chowdhry Lecture 08: Fe. 08, 2019 : Professor of CS Disclimer: These notes hve not een sujected to the usul scrutiny
More informationEE 108A Lecture 2 (c) W. J. Dally and P. Levis 2
EE08A Leture 2: Comintionl Logi Design EE 08A Leture 2 () 2005-2008 W. J. Dlly n P. Levis Announements Prof. Levis will hve no offie hours on Friy, Jn 8. Ls n setions hve een ssigne - see the we pge Register
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 informationCSCI 340: Computational Models. Transition Graphs. Department of Computer Science
CSCI 340: Computtionl Models Trnsition Grphs Chpter 6 Deprtment of Computer Science Relxing Restrints on Inputs We cn uild n FA tht ccepts only the word! 5 sttes ecuse n FA cn only process one letter t
More information