Concepts of Concurrent Computation Spring 2015 Lecture 9: Petri Nets
|
|
- Terence Booth
- 5 years ago
- Views:
Transcription
1 Concepts of Concurrent Computtion Spring 205 Lecture 9: Petri Nets Sebstin Nnz Chris Poskitt Chir of Softwre Engineering
2 Petri nets Petri nets re mthemticl models for describing systems with concurrency nd resource shring they fcilitte mny utomtic nlyses of interest for concurrent systems rich, intuitive grphicl nottion for choice, concurrent execution, interction with the environment,... 2
3 Petri nets - the origins proposed by Crl Adm Petri in his fmous thesis Kommuniktion mit Automten (962) imed for system rchitecture tht could be expnded indefinitely => no centrl components => in prticulr, no centrl, synchronising clock => ctions with loclly confined cuses/effects originl presenttion omitted the grphicl representtion 3
4 Tody s gend. modelling concepts: cookies for everyone! 2. synchronistion problems s Petri nets 3. Petri net nlyses 4. true concurrency semntics; unfoldings 4
5 Let s design cookie vending mchine coin slot comprtment 5
6 Let s design cookie vending mchine coin slot comprtment 6
7 Let s design cookie vending mchine t coin slot comprtment 7
8 Let s design cookie vending mchine t coin slot comprtment 8
9 Terminology plce tokens t trnsition (with precondition ) t mrking (distribution of tokens) 9
10 Let s design cookie vending mchine t coin slot comprtment 0
11 Let s design cookie vending mchine t coin slot comprtment trnsition t is enbled it cn occur nd chnge the mrking
12 Let s design cookie vending mchine t coin slot comprtment trnsition t is enbled it cn occur nd chnge the mrking 2
13 Let s design cookie vending mchine t coin slot comprtment trnsition t is enbled it cn occur nd chnge the mrking! csh box? finitely mny cookies?
14 Let s look inside storge b coin slot signl comprtment csh box 4
15 Let s look inside storge b coin slot signl comprtment csh box 5
16 Let s look inside storge b coin slot signl comprtment csh box 6
17 Let s look inside storge b coin slot signl comprtment csh box 7
18 Let s open it up to the world 8
19 Let s open it up to the world storge ϵ insert coin slot signl b comprtment ϵ tke csh box 9
20 Let s open it up to the world storge ϵ insert coin slot signl b comprtment ϵ tke csh box ϵ denotes trnsition tht once enbled, need not ctully occur we ssume tht other enbled trnsitions occur eventully 20
21 The ultimte cookie mchine storge coin slot ϵ insert signl b comprtment ϵ tke return coin counter csh box 2
22 The ultimte cookie mchine storge coin slot ϵ insert signl b comprtment ϵ tke return coin counter csh box 22
23 The ultimte cookie mchine storge coin slot ϵ insert signl b comprtment ϵ tke return coin counter csh box 23
24 The ultimte cookie mchine storge coin slot ϵ insert signl b comprtment ϵ tke return coin counter csh box! conflict! nondeterminism! 24
25 The ultimte cookie mchine storge coin slot ϵ insert signl b comprtment ϵ tke return coin counter csh box 25
26 The ultimte cookie mchine storge coin slot ϵ insert signl b comprtment ϵ tke return coin counter csh box 26
27 The ultimte cookie mchine storge coin slot ϵ insert signl b comprtment ϵ tke return coin counter exercise: strengthen the design such tht the coin slot nd signl plces csh box store t most one token ech 27
28 Elementry Petri nets if we re interested in only control flow, we cn use specil cse - elementry Petri nets - where ll tokens re simply blck dots ssume ll edges to be lbelled by: henceforth, we ssume ll Petri nets to be elementry 28
29 Elementry cookie vending mchine coin slot storge ϵ insert signl b comprtment ϵ tke return coin counter csh box 29
30 Petri nets: definition n (elementry) Petri net consists of net structure: N = (P, T, F) with finite sets P nd T of plces nd trnsitions, F n edge reltion F (P x T) (T x P) nd n initil mrking M0: P -> N mrkings hve the form M: P -> N; ech plce p holds M(p) tokens 30
31 Petri nets: definition the preset of trnsition t is the set of plces p connected by edges from p to t (postset defined nlogously) trnsition is enbled if M(p) for ll plces p in the preset n enbled trnsition cn occur, removing token from ech plce in the preset nd dding one to ech plce in the postset 3
32 Next on the gend. modelling concepts: cookies for everyone! 2. synchronistion problems s Petri nets 3. Petri net nlyses 4. true concurrency semntics; unfoldings 32
33 Producer-consumer problem store (buffer, int) consume (buffer) Producers Buffer Consumers 33
34 Producer-consumer problem wit consume produce wit 34
35 Producer-consumer problem wit consume buffer spce buffer count produce wit 35
36 Producer-consumer problem wit consume buffer spce buffer count produce wit 36
37 Producer-consumer problem wit consume buffer spce buffer count produce wit 37
38 Producer-consumer problem wit consume buffer spce buffer count produce wit 38
39 Producer-consumer problem wit consume buffer spce buffer count produce wit 39
40 Producer-consumer problem wit consume buffer spce buffer count produce wit 40
41 Mutul exclusion witing witing2 ϵ CR CR2 ϵ locl locl2 4
42 Mutul exclusion witing witing2 semphore ϵ CR CR2 ϵ locl locl2 42
43 Next on the gend. modelling concepts: cookies for everyone! 2. synchronistion problems s Petri nets 3. Petri net nlyses 4. true concurrency semntics; unfoldings 43
44 Modelling power vs. nlysbility mny properties of interest for concurrent systems cn be utomticlly determined for Petri nets => but cn be very expensive in the generl cse properties include: => k-boundedness (i.e. no plce ever hs more thn k tokens) => liveness => rechbility severl tools re vilble => 44
45 Rechbility problem the problem to decide whether some mrking M cn be derived from the initil mrking strting point: construct rechbility grph from the initil mrking => i.e. trnsition system completely describing its behviour => nodes denote mrkings => edges denote occurrences (more sophistiction is needed when rechbility grphs re not finite) 45
46 Rechbility grph for our semphore wit wit2 sem ϵ CR CR2 ϵ loc loc2 express mrking M s vector: ( M(wit) M(CR) M(loc) M(sem) M(wit2) M(CR2) M(loc2) ) i.e. ( )
47 Rechbility grph for our semphore wit wit2 sem ϵ CR CR2 ϵ loc loc2 prove tht ( ) is unrechble prove tht M(CR)+M(CR2)+M(sem) =
48 Rechbility grph for our semphore ( ) ( ) ( ) ( ) ( ) ( ) ( ) ( ) 48
49 Deciding rechbility is expensive rechbility is n importnt nlysis decidble, but expensive in the generl cse => EXPSPACE-hrd => rechbility grph not lwys finite prt II of Reisig (203) trets the problem with more sophistiction thn we hve 49
50 Next on the gend. modelling concepts: cookies for everyone! 2. synchronistion problems s Petri nets 3. Petri net nlyses 4. true concurrency semntics; unfoldings 50
51 The problem of interleving semntics consider the following Petri net:... n its rechbility grph contins 2 n sttes => stte explosion problem => due to interleving of occurrences => unnecessry: ordering of occurrences here immteril! 5
52 Interleving vs. true concurrency semntics n interleving semntics imposes totl ordering on sequences of occurrences => completely described by rechbility grph => nodes denote mrkings; edges denote occurrences => stte explosion! true concurrency semntics insted models time s prtil order => two or more occurrences cn hppen simultneously => completely described by so-clled unfolding 52
53 Unfoldings re more compct representtions of concurrency n unfolding of Petri net N is Petri net tht is more tree like - but represents the sme behviour explicitly represents concurrency nd cusl dependence between different behviours ide: nlyse the unfolding of Petri net itself, rther thn n underlying trnsition system (s in the interleving semntics) 53
54 A Exmple: n unfolding C B D 54
55 A Exmple: n unfolding C B D A C 55
56 A Exmple: n unfolding C B D A B C 56
57 A Exmple: n unfolding C B D A B A C 57
58 A Exmple: n unfolding C B D A B A B C 58
59 A Exmple: n unfolding C B D A B A B D C 59
60 A Exmple: n unfolding C B D A B A B A C D 60
61 A Exmple: n unfolding C B D A B A B A... D D C... 6
62 Constructing n unfolding ssumption: Petri nets re -bounded => possible to generlise to other Petri net vrints steps to construct n unfolding N from Petri net N: () initilise N with the plces in N contining tokens in the initil mrking (2) if rechble* mrking in N enbles trnsition t in N, then disjointly dd t to N nd: => link it to the corresponding preset => disjointly dd the postset of t (3) iterte step 2 *checking rechbility is fr esier for the unfolding net clss 62
63 A B C Another exmple A2 B2 C2 63
64 A B C Another exmple A2 B2 C2 A B C 64
65 A B C Another exmple A2 B2 C2 A B C C2 65
66 A B C Another exmple A2 B2 C2 A B B2 C C2 C 66
67 A B C Another exmple A2 B2 C2 A A2 B B2 B C C2 C 67
68 A B C Another exmple A2 B2 C2 A A2 B B2 B C C2 C C2 68
69 A B C Another exmple A2 B2 C2 A A2 A B B2 B C C2 C C2 69
70 A B C Another exmple A2 B2 C2... A A2 A B B2 B B2... C C2 C C2 C... 70
71 Returning to our smll exmple construct n unfolding of the following Petri net:... n 7
72 Returning to our smll exmple construct n unfolding of the following Petri net:... n the unfolding is just the Petri net itself! => size O(n) => wheres interleving yields 2 n rechble sttes 72
73 Petri net nlysis using unfoldings suppose we wnt to know if some trnsition t in Petri net N cn occur compute n nswer by exploring the unfolding of N until either: => trnsition lbelled t is found => or it cn be concluded tht no such trnsition occurs for finite unfoldings, compute nd explore the whole structure for infinite unfoldings, only finite prefix is computed nd explored 73
74 A B b c A2 d B2 e f A3 B3 x A4 cn x ever occur?
75 A B A B b c A2 d B2 e f A3 B3 x A4 cn x ever occur?
76 A B b c A2 A b B B2 A2 B2 d e f A3 B3 x A4 cn x ever occur?
77 A B b c A2 A b B B2 A2 d B2 e f c d A3 B3 x A B A3 A4 cn x ever occur?
78 A B b c A2 A b B B2 A2 d B2 e f c d A3 B3 x A B A3 A4 b cn x ever occur? A2 B2
79 A B b c A2 A b B B2 A2 d B2 e f c d A3 B3 x A B A3 A4 b e cn x ever occur? A2 B2 A2 B3
80 A B b c A2 A b B B2 A2 d B2 e f c d A3 B3 x A B A3 A4 b e cn x ever occur? A2 B2 A2 B3 d A A3
81 A B b c A2 A b B B2 A2 d B2 e f c d A3 B3 x A B A3 A4 b e cn x ever occur? A2 B2 A2 B3... d f A A3 B
82 A B b c A2 A b B B2 A2 d B2 e f c d A3 B3 x A B A3 A4 b e cn x ever occur? A2 B2 A2 B3 d f need we compute further? A A3 B2
83 Complete finite prefix complete finite prefix is finite prt of n unfolding tht is sufficient for deciding certin questions bout the originl Petri net => e.g. executbility, repeted executbility, livelock,... chllenge is to determine when to stop unfolding without informtion loss => outside scope of this lecture; see Esprz & Heljnko (2008) previous slide gve complete finite prefix => no x in the prefix; hence x cn never occur in the originl Petri net complete finite prefixes cn be exponentilly more concise thn n interleving-bsed representtion
84 Next on the gend. modelling concepts: cookies for everyone! 2. synchronistion problems s Petri nets 3. Petri net nlyses 4. true concurrency semntics; unfoldings 84
85 Min sources for this lecture Understnding Petri Nets (203) => by Wolfgng Reisig => chpters -3 Unfoldings (2008) => by Jvier Esprz & Keijo Heljnko => chpters -3 A Flse History of True Concurrency => => 85
86 Summry Petri nets fcilitte grphicl, intuitive mens of modelling concurrent nd distributed systems utomtic nlyses exist for rechbility, boundedness, liveness,... but re expensive in the generl cse unfoldings (bsed on true concurrency) my give more compct representtion of concurrency thn rechbility grphs (bsed on interlevings) 86
Finite 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 informationIntermediate Math Circles Wednesday, November 14, 2018 Finite Automata II. Nickolas Rollick a b b. a b 4
Intermedite Mth Circles Wednesdy, Novemer 14, 2018 Finite Automt II Nickols Rollick nrollick@uwterloo.c Regulr Lnguges Lst time, we were introduced to the ide of DFA (deterministic finite utomton), one
More informationSemantic reachability for simple process algebras. Richard Mayr. Abstract
Semntic rechbility for simple process lgebrs Richrd Myr Abstrct This pper is n pproch to combine the rechbility problem with semntic notions like bisimultion equivlence. It dels with questions of the following
More informationProperties of Integrals, Indefinite Integrals. Goals: Definition of the Definite Integral Integral Calculations using Antiderivatives
Block #6: Properties of Integrls, Indefinite Integrls Gols: Definition of the Definite Integrl Integrl Clcultions using Antiderivtives Properties of Integrls The Indefinite Integrl 1 Riemnn Sums - 1 Riemnn
More informationSemantic Reachability. Richard Mayr. Institut fur Informatik. Technische Universitat Munchen. Arcisstr. 21, D Munchen, Germany E. N. T. C. S.
URL: http://www.elsevier.nl/locte/entcs/volume6.html?? pges Semntic Rechbility Richrd Myr Institut fur Informtik Technische Universitt Munchen Arcisstr. 21, D-80290 Munchen, Germny e-mil: myrri@informtik.tu-muenchen.de
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 informationFinite Automata. Informatics 2A: Lecture 3. Mary Cryan. 21 September School of Informatics University of Edinburgh
Finite Automt Informtics 2A: Lecture 3 Mry Cryn School of Informtics University of Edinburgh mcryn@inf.ed.c.uk 21 September 2018 1 / 30 Lnguges nd Automt Wht is lnguge? Finite utomt: recp Some forml definitions
More informationLecture 9: LTL and Büchi Automata
Lecture 9: LTL nd Büchi Automt 1 LTL Property Ptterns Quite often the requirements of system follow some simple ptterns. Sometimes we wnt to specify tht property should only hold in certin context, clled
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 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 informationNew Expansion and Infinite Series
Interntionl Mthemticl Forum, Vol. 9, 204, no. 22, 06-073 HIKARI Ltd, www.m-hikri.com http://dx.doi.org/0.2988/imf.204.4502 New Expnsion nd Infinite Series Diyun Zhng College of Computer Nnjing 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 informationCS 188: Artificial Intelligence Spring 2007
CS 188: Artificil Intelligence Spring 2007 Lecture 3: Queue-Bsed Serch 1/23/2007 Srini Nrynn UC Berkeley Mny slides over the course dpted from Dn Klein, Sturt Russell or Andrew Moore Announcements Assignment
More informationInfinite Geometric Series
Infinite Geometric Series Finite Geometric Series ( finite SUM) Let 0 < r < 1, nd let n be positive integer. Consider the finite sum It turns out there is simple lgebric expression tht is equivlent to
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 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 informationStrong Bisimulation. Overview. References. Actions Labeled transition system Transition semantics Simulation Bisimulation
Strong Bisimultion Overview Actions Lbeled trnsition system Trnsition semntics Simultion Bisimultion References Robin Milner, Communiction nd Concurrency Robin Milner, Communicting nd Mobil Systems 32
More 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 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 informationCS 275 Automata and Formal Language Theory
CS 275 Automt nd Forml Lnguge Theory Course Notes Prt II: The Recognition Problem (II) Chpter II.6.: Push Down Automt Remrk: This mteril is no longer tught nd not directly exm relevnt Anton Setzer (Bsed
More information1 Online Learning and Regret Minimization
2.997 Decision-Mking in Lrge-Scle Systems My 10 MIT, Spring 2004 Hndout #29 Lecture Note 24 1 Online Lerning nd Regret Minimiztion In this lecture, we consider the problem of sequentil decision mking in
More informationChapter Five: Nondeterministic Finite Automata. Formal Language, chapter 5, slide 1
Chpter Five: Nondeterministic Finite Automt Forml Lnguge, chpter 5, slide 1 1 A DFA hs exctly one trnsition from every stte on every symol in the lphet. By relxing this requirement we get relted ut more
More 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 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 informationAdministrivia CSE 190: Reinforcement Learning: An Introduction
Administrivi CSE 190: Reinforcement Lerning: An Introduction Any emil sent to me bout the course should hve CSE 190 in the subject line! Chpter 4: Dynmic Progrmming Acknowledgment: A good number of these
More informationDeterministic Finite Automata
Finite Automt Deterministic Finite Automt H. Geuvers nd J. Rot Institute for Computing nd Informtion Sciences Version: fll 2016 J. Rot Version: fll 2016 Tlen en Automten 1 / 21 Outline Finite Automt Finite
More information378 Relations Solutions for Chapter 16. Section 16.1 Exercises. 3. Let A = {0,1,2,3,4,5}. Write out the relation R that expresses on A.
378 Reltions 16.7 Solutions for Chpter 16 Section 16.1 Exercises 1. Let A = {0,1,2,3,4,5}. Write out the reltion R tht expresses > on A. Then illustrte it with digrm. 2 1 R = { (5,4),(5,3),(5,2),(5,1),(5,0),(4,3),(4,2),(4,1),
More informationReview of Gaussian Quadrature method
Review of Gussin Qudrture method Nsser M. Asi Spring 006 compiled on Sundy Decemer 1, 017 t 09:1 PM 1 The prolem To find numericl vlue for the integrl of rel vlued function of rel vrile over specific rnge
More informationCS 275 Automata and Formal Language Theory
CS 275 Automt nd Forml Lnguge Theory Course Notes Prt II: The Recognition Problem (II) Chpter II.5.: Properties of Context Free Grmmrs (14) Anton Setzer (Bsed on book drft by J. V. Tucker nd K. Stephenson)
More 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 informationArithmetic & Algebra. NCTM National Conference, 2017
NCTM Ntionl Conference, 2017 Arithmetic & Algebr Hether Dlls, UCLA Mthemtics & The Curtis Center Roger Howe, Yle Mthemtics & Texs A & M School of Eduction Relted Common Core Stndrds First instnce of vrible
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 informationRecitation 3: More Applications of the Derivative
Mth 1c TA: Pdric Brtlett Recittion 3: More Applictions of the Derivtive Week 3 Cltech 2012 1 Rndom Question Question 1 A grph consists of the following: A set V of vertices. A set E of edges where ech
More informationDATA Search I 魏忠钰. 复旦大学大数据学院 School of Data Science, Fudan University. March 7 th, 2018
DATA620006 魏忠钰 Serch I Mrch 7 th, 2018 Outline Serch Problems Uninformed Serch Depth-First Serch Bredth-First Serch Uniform-Cost Serch Rel world tsk - Pc-mn Serch problems A serch problem consists of:
More informationMath Lecture 23
Mth 8 - Lecture 3 Dyln Zwick Fll 3 In our lst lecture we delt with solutions to the system: x = Ax where A is n n n mtrix with n distinct eigenvlues. As promised, tody we will del with the question of
More informationCS 188 Introduction to Artificial Intelligence Fall 2018 Note 7
CS 188 Introduction to Artificil Intelligence Fll 2018 Note 7 These lecture notes re hevily bsed on notes originlly written by Nikhil Shrm. Decision Networks In the third note, we lerned bout gme trees
More informationChapter 1, Part 1. Regular Languages. CSC527, Chapter 1, Part 1 c 2012 Mitsunori Ogihara 1
Chpter 1, Prt 1 Regulr Lnguges CSC527, Chpter 1, Prt 1 c 2012 Mitsunori Ogihr 1 Finite Automt A finite utomton is system for processing ny finite sequence of symols, where the symols re chosen from finite
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 informationGoals: Determine how to calculate the area described by a function. Define the definite integral. Explore the relationship between the definite
Unit #8 : The Integrl Gols: Determine how to clculte the re described by function. Define the definite integrl. Eplore the reltionship between the definite integrl nd re. Eplore wys to estimte the definite
More informationExponentials - Grade 10 [CAPS] *
OpenStx-CNX module: m859 Exponentils - Grde 0 [CAPS] * Free High School Science Texts Project Bsed on Exponentils by Rory Adms Free High School Science Texts Project Mrk Horner Hether Willims This work
More informationMath 1B, lecture 4: Error bounds for numerical methods
Mth B, lecture 4: Error bounds for numericl methods Nthn Pflueger 4 September 0 Introduction The five numericl methods descried in the previous lecture ll operte by the sme principle: they pproximte the
More 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 informationMAA 4212 Improper Integrals
Notes by Dvid Groisser, Copyright c 1995; revised 2002, 2009, 2014 MAA 4212 Improper Integrls The Riemnn integrl, while perfectly well-defined, is too restrictive for mny purposes; there re functions which
More informationCOMPUTING SCIENCE. University of Newcastle upon Tyne. A Note on the Well-Foundedness of Adequate Orders Used for Truncating Unfoldings
UNIVERSITY OF NEWCASTLE University of Newcstle upon Tyne COMPUTING SCIENCE A Note on the Well-Foundedness of Adequte Orders Used for Truncting Unfoldings T Chtin, V Khomenko TECHNICAL REPORT SERIES No
More informationReview of Calculus, cont d
Jim Lmbers MAT 460 Fll Semester 2009-10 Lecture 3 Notes These notes correspond to Section 1.1 in the text. Review of Clculus, cont d Riemnn Sums nd the Definite Integrl There re mny cses in which some
More informationHow to simulate Turing machines by invertible one-dimensional cellular automata
How to simulte Turing mchines by invertible one-dimensionl cellulr utomt Jen-Christophe Dubcq Déprtement de Mthémtiques et d Informtique, École Normle Supérieure de Lyon, 46, llée d Itlie, 69364 Lyon Cedex
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 informationLecture 3: Equivalence Relations
Mthcmp Crsh Course Instructor: Pdric Brtlett Lecture 3: Equivlence Reltions Week 1 Mthcmp 2014 In our lst three tlks of this clss, we shift the focus of our tlks from proof techniques to proof concepts
More informationCS5371 Theory of Computation. Lecture 20: Complexity V (Polynomial-Time Reducibility)
CS5371 Theory of Computtion Lecture 20: Complexity V (Polynomil-Time Reducibility) Objectives Polynomil Time Reducibility Prove Cook-Levin Theorem Polynomil Time Reducibility Previously, we lernt tht if
More informationKleene Theorems for Free Choice Nets Labelled with Distributed Alphabets
Kleene Theorems for Free Choice Nets Lbelled with Distributed Alphbets Rmchndr Phwde Indin Institute of Technology Dhrwd, Dhrwd 580011, Indi Emil: prb@iitdh.c.in Abstrct. We provided [15] expressions for
More informationUninformed Search Lecture 4
Lecture 4 Wht re common serch strtegies tht operte given only serch problem? How do they compre? 1 Agend A quick refresher DFS, BFS, ID-DFS, UCS Unifiction! 2 Serch Problem Formlism Defined vi the following
More 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 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 informationProcess Algebra CSP A Technique to Model Concurrent Programs
Process Algebr CSP A Technique to Model Concurrent Progrms Jnury 15, 2002 Hui Shi 1 Contents CSP-Processes Opertionl Semntics Trnsition systems nd stte mchines Bisimultion Firing rules for CSP Model-Checker
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 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 informationCS 267: Automated Verification. Lecture 8: Automata Theoretic Model Checking. Instructor: Tevfik Bultan
CS 267: Automted Verifiction Lecture 8: Automt Theoretic Model Checking Instructor: Tevfik Bultn LTL Properties Büchi utomt [Vrdi nd Wolper LICS 86] Büchi utomt: Finite stte utomt tht ccept infinite strings
More informationFABER Formal Languages, Automata and Models of Computation
DVA337 FABER Forml Lnguges, Automt nd Models of Computtion Lecture 5 chool of Innovtion, Design nd Engineering Mälrdlen University 2015 1 Recp of lecture 4 y definition suset construction DFA NFA stte
More information3 Regular expressions
3 Regulr expressions Given n lphet Σ lnguge is set of words L Σ. So fr we were le to descrie lnguges either y using set theory (i.e. enumertion or comprehension) or y n utomton. In this section we shll
More informationNon-deterministic Finite Automata
Non-deterministic Finite Automt From Regulr Expressions to NFA- Eliminting non-determinism Rdoud University Nijmegen Non-deterministic Finite Automt H. Geuvers nd J. Rot Institute for Computing nd Informtion
More informationPart 5 out of 5. Automata & languages. A primer on the Theory of Computation. Last week was all about. a superset of Regular Languages
Automt & lnguges A primer on the Theory of Computtion Lurent Vnbever www.vnbever.eu Prt 5 out of 5 ETH Zürich (D-ITET) October, 19 2017 Lst week ws ll bout Context-Free Lnguges Context-Free Lnguges superset
More informationSTRUCTURE OF CONCURRENCY Ryszard Janicki. Department of Computing and Software McMaster University Hamilton, ON, L8S 4K1 Canada
STRUCTURE OF CONCURRENCY Ryszrd Jnicki Deprtment of Computing nd Softwre McMster University Hmilton, ON, L8S 4K1 Cnd jnicki@mcmster.c 1 Introduction Wht is concurrency? How it cn e modelled? Wht re the
More 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 informationClassical Mechanics. From Molecular to Con/nuum Physics I WS 11/12 Emiliano Ippoli/ October, 2011
Clssicl Mechnics From Moleculr to Con/nuum Physics I WS 11/12 Emilino Ippoli/ October, 2011 Wednesdy, October 12, 2011 Review Mthemtics... Physics Bsic thermodynmics Temperture, idel gs, kinetic gs theory,
More informationFinite Automata Part Three
Finite Automt Prt Three Hello Hello Wonderful Wonderful Condensed Condensed Slide Slide Reders! Reders! The The first first hlf hlf of of this this lecture lecture consists consists lmost lmost exclusively
More informationChapter 8.2: The Integral
Chpter 8.: The Integrl You cn think of Clculus s doule-wide triler. In one width of it lives differentil clculus. In the other hlf lives wht is clled integrl clculus. We hve lredy eplored few rooms in
More informationThe Wave Equation I. MA 436 Kurt Bryan
1 Introduction The Wve Eqution I MA 436 Kurt Bryn Consider string stretching long the x xis, of indeterminte (or even infinite!) length. We wnt to derive n eqution which models the motion of the string
More informationInterpreting Integrals and the Fundamental Theorem
Interpreting Integrls nd the Fundmentl Theorem Tody, we go further in interpreting the mening of the definite integrl. Using Units to Aid Interprettion We lredy know tht if f(t) is the rte of chnge of
More informationEquations and Inequalities
Equtions nd Inequlities Equtions nd Inequlities Curriculum Redy ACMNA: 4, 5, 6, 7, 40 www.mthletics.com Equtions EQUATIONS & Inequlities & INEQUALITIES Sometimes just writing vribles or pronumerls in
More informationMain topics for the First Midterm
Min topics for the First Midterm The Midterm will cover Section 1.8, Chpters 2-3, Sections 4.1-4.8, nd Sections 5.1-5.3 (essentilly ll of the mteril covered in clss). Be sure to know the results of the
More informationA Polynomial-Time Algorithm for Checking Consistency of Free-Choice Signal Transition Graphs
Fundment Informtice XX (2004) 1 23 1 IOS Press A Polynomil-Time Algorithm for Checking Consistency of Free-Choice Signl Trnsition Grphs Jvier Esprz Institute for Forml Methods in Computer Science University
More informationConservation Law. Chapter Goal. 5.2 Theory
Chpter 5 Conservtion Lw 5.1 Gol Our long term gol is to understnd how mny mthemticl models re derived. We study how certin quntity chnges with time in given region (sptil domin). We first derive the very
More informationChapter 0. What is the Lebesgue integral about?
Chpter 0. Wht is the Lebesgue integrl bout? The pln is to hve tutoril sheet ech week, most often on Fridy, (to be done during the clss) where you will try to get used to the ides introduced in the previous
More 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 informationCSCI 340: Computational Models. Kleene s Theorem. Department of Computer Science
CSCI 340: Computtionl Models Kleene s Theorem Chpter 7 Deprtment of Computer Science Unifiction In 1954, Kleene presented (nd proved) theorem which (in our version) sttes tht if lnguge cn e defined y ny
More informationWeek 10: Line Integrals
Week 10: Line Integrls Introduction In this finl week we return to prmetrised curves nd consider integrtion long such curves. We lredy sw this in Week 2 when we integrted long curve to find its length.
More informationNumerical Integration
Chpter 1 Numericl Integrtion Numericl differentition methods compute pproximtions to the derivtive of function from known vlues of the function. Numericl integrtion uses the sme informtion to compute numericl
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 informationThe practical version
Roerto s Notes on Integrl Clculus Chpter 4: Definite integrls nd the FTC Section 7 The Fundmentl Theorem of Clculus: The prcticl version Wht you need to know lredy: The theoreticl version of the FTC. Wht
More informationUnit #9 : Definite Integral Properties; Fundamental Theorem of Calculus
Unit #9 : Definite Integrl Properties; Fundmentl Theorem of Clculus Gols: Identify properties of definite integrls Define odd nd even functions, nd reltionship to integrl vlues Introduce the Fundmentl
More informationCS 373, Spring Solutions to Mock midterm 1 (Based on first midterm in CS 273, Fall 2008.)
CS 373, Spring 29. Solutions to Mock midterm (sed on first midterm in CS 273, Fll 28.) Prolem : Short nswer (8 points) The nswers to these prolems should e short nd not complicted. () If n NF M ccepts
More informationFinal Exam - Review MATH Spring 2017
Finl Exm - Review MATH 5 - Spring 7 Chpter, 3, nd Sections 5.-5.5, 5.7 Finl Exm: Tuesdy 5/9, :3-7:pm The following is list of importnt concepts from the sections which were not covered by Midterm Exm or.
More informationDecision Networks. CS 188: Artificial Intelligence Fall Example: Decision Networks. Decision Networks. Decisions as Outcome Trees
CS 188: Artificil Intelligence Fll 2011 Decision Networks ME: choose the ction which mximizes the expected utility given the evidence mbrell Lecture 17: Decision Digrms 10/27/2011 Cn directly opertionlize
More informationBIFURCATIONS IN ONE-DIMENSIONAL DISCRETE SYSTEMS
BIFRCATIONS IN ONE-DIMENSIONAL DISCRETE SYSTEMS FRANCESCA AICARDI In this lesson we will study the simplest dynmicl systems. We will see, however, tht even in this cse the scenrio of different possible
More informationSoftware Engineering using Formal Methods
Softwre Engineering using Forml Methods Propositionl nd (Liner) Temporl Logic Wolfgng Ahrendt 13th Septemer 2016 SEFM: Liner Temporl Logic /GU 160913 1 / 60 Recpitultion: FormlistionFormlistion: Syntx,
More informationMTH 122 Fall 2008 Essex County College Division of Mathematics Handout Version 10 1 October 14, 2008
MTH 22 Fll 28 Essex County College Division of Mthemtics Hndout Version October 4, 28 Arc Length Everyone should be fmilir with the distnce formul tht ws introduced in elementry lgebr. It is bsic formul
More informationLecture 3. Limits of Functions and Continuity
Lecture 3 Limits of Functions nd Continuity Audrey Terrs April 26, 21 1 Limits of Functions Notes I m skipping the lst section of Chpter 6 of Lng; the section bout open nd closed sets We cn probbly live
More informationLexical Analysis Finite Automate
Lexicl Anlysis Finite Automte CMPSC 470 Lecture 04 Topics: Deterministic Finite Automt (DFA) Nondeterministic Finite Automt (NFA) Regulr Expression NFA DFA A. Finite Automt (FA) FA re grph, like trnsition
More informationWhere did dynamic programming come from?
Where did dynmic progrmming come from? String lgorithms Dvid Kuchk cs302 Spring 2012 Richrd ellmn On the irth of Dynmic Progrmming Sturt Dreyfus http://www.eng.tu.c.il/~mi/cd/ or50/1526-5463-2002-50-01-0048.pdf
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 informationCISC 4090 Theory of Computation
9/6/28 Stereotypicl computer CISC 49 Theory of Computtion Finite stte mchines & Regulr lnguges Professor Dniel Leeds dleeds@fordhm.edu JMH 332 Centrl processing unit (CPU) performs ll the instructions
More informationCS 314 Principles of Programming Languages
C 314 Principles of Progrmming Lnguges Lecture 6: LL(1) Prsing Zheng (Eddy) Zhng Rutgers University Ferury 5, 2018 Clss Informtion Homework 2 due tomorrow. Homework 3 will e posted erly next week. 2 Top
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 informationLearning Moore Machines from Input-Output Traces
Lerning Moore Mchines from Input-Output Trces Georgios Gintmidis 1 nd Stvros Tripkis 1,2 1 Alto University, Finlnd 2 UC Berkeley, USA Motivtion: lerning models from blck boxes Inputs? Lerner Forml Model
More information19 Optimal behavior: Game theory
Intro. to Artificil Intelligence: Dle Schuurmns, Relu Ptrscu 1 19 Optiml behvior: Gme theory Adversril stte dynmics hve to ccount for worst cse Compute policy π : S A tht mximizes minimum rewrd Let S (,
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 informationChapter 6. Infinite series
Chpter 6 Infinite series We briefly review this chpter in order to study series of functions in chpter 7. We cover from the beginning to Theorem 6.7 in the text excluding Theorem 6.6 nd Rbbe s test (Theorem
More informationI1 = I2 I1 = I2 + I3 I1 + I2 = I3 + I4 I 3
2 The Prllel Circuit Electric Circuits: Figure 2- elow show ttery nd multiple resistors rrnged in prllel. Ech resistor receives portion of the current from the ttery sed on its resistnce. The split is
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 informationCMDA 4604: Intermediate Topics in Mathematical Modeling Lecture 19: Interpolation and Quadrature
CMDA 4604: Intermedite Topics in Mthemticl Modeling Lecture 19: Interpoltion nd Qudrture In this lecture we mke brief diversion into the res of interpoltion nd qudrture. Given function f C[, b], we sy
More information