Embedded Systems 4. Petri nets. Introduced in 1962 by Carl Adam Petri in his PhD thesis. Different Types of Petri nets known
|
|
- Rosanna Eaton
- 5 years ago
- Views:
Transcription
1 Embedded Sysems Peri nes Inroduced in 962 by Carl Adam Peri in his PhD hesis. Differen Tyes of Peri nes known Condiion/even nes Place/ransiion nes Predicae/ransiion nes Hierachical Peri nes, - 2 -
2 Used for Modelling, Analysis, Verificaion of Disribued Sysems (oher) alicaion areas: auomaion engineering business rocesses Focus on modeling causal deendencies; no global synchronizaion assumed (message assing only) Examle : The four seasons - 4-2
3 Key Elemens Condiions Eiher me or no me. Condiions reresen local saes. Se of condiions describes he oenial sae sace. Evens May ake lace if cerain condiions are me. Even reresens a sae ransiion. Flow relaion Relaes condiions and evens, describes how an even changes he local and global sae. Tokens Assignmens of okens o condiions secifies a global sae. Condiions, evens and he flow relaion form a biarie grah (grah wih wo kinds of nodes) Examle 2: Synchronizaion a single rack rail segmen muual exclusion: here is a mos one rain using he rack rail Precondiions of x fulfilled x - 6-3
4 Playing he oken game : dynamic behavior x Playing he oken game : dynamic behavior x Poscondiion of x fulfilled - 8-4
5 Playing he oken game : dynamic behavior Conflic for resource rack : wo rains comeing - 0-5
6 Peri Nes Def.: N=(C,E,F) is called a Peri ne, iff he following holds. C and E are disjoin ses 2. F (C E) (E C); is binary relaion, ( flow relaion ) Def.: Le N be a ne and le x (C E). x := {y y F x} is called he se of recondiions. x := {y x F y} is called he se of oscondiions. Examle: x x x - - Boolean marking and comuing changes of markings A Boolean marking is a maing M: C {0,}. Firing evens x generae new markings on each of he condiions c according o he following rules: a ransiion a x can be fired, iff x, i.e. all recondiions of x are marked and x is no marked, afer firing x is unmarked and x is marked M M, iff M resuls from M by firing exacly one ransiion - 2-6
7 Comeing Trains Examle: Comeing Trains Examle: Conflic for resource rack - 4-7
8 Comeing Trains Examle: Boolean marking and comuing changes of markings Comeing Trains examle Consider he maing sym: C C wih sym(c)=-c for all c=0,,2,3,-,-2,-3 We call wo markings M, Ms symmeric, iff M can be ransformed o Ms by changing he marks from a node c o node -c, i.e Ms(sym(c)):= M(c). I follows easily: M M2 iff Ms M2s Comeing Trains Examle: Boolean marking and comuing changes of markings Reachable markings M M2 M3 Sli. M4 M5 M6 Sli 4. Sli
9 Comeing Trains Examle: Boolean marking and comuing changes of markings Reachable markings M6 M Sli Comeing Trains Examle: Boolean marking and comuing changes of markings Reachable markings M6 M7 M2s Sli
10 Comeing Trains Examle: Boolean marking and comuing changes of markings Reachable markings M5 M6s Sli Comeing Trains Examle: Boolean marking and comuing changes of markings Reachable markings M4 M8 M6 Sli
11 Comeing Trains Examle: Boolean marking and comuing changes of markings Reachable markings M M2s Sli Comeing Trains Examle: Boolean marking and comuing changes of markings Reachable markings M8 M M2 M3 M4 M5 M6 M7 M2s M3s M4s M5s M6s M7s M8s
12 Basic srucural roeries: Loos and ure nes Def.: Le (c,e) C E. (c,e) is called a loo iff cfe efc. Def.: Ne N=(C,E,F) is called ure, if F does no conain any loos Srucural roeries: Simle nes Def.: A ne is called simle, iff [x,y (C E) ( x = y ) (x = y )] x = y Examle (no a simle ne):
13 Condiion/even nes (C/E nes) Def.: A Peri ne N=(C,E,F) ogeher wih a se of Markings M is called condiion/even ne (C/E ne), iff N is simle and has no isolaed elemens M is closed w.r.. firing and inverse firing wo markings in M can be ransformed ino each oher by firing and inverse firing for each even e E, here exiss a marking in M, ha allows firing a e Comeing Trains Examle is C/E ne: M8 M M2 M3 M4 M5 M6 M7 M2s M3s M4s M5s M6s M7s M8s
14 Proeries of C/E Def.: Marking M is reachable from marking M, iff here exiss sequence of firing ses ransforming M ino M (No.: M M ) A C/E ne is cyclic, iff any wo markings are reachable from each oher. A C/E ne fulfills liveness, iff for each marking M and for each even e here exiss a reachable marking M ha acivaes e for firing Exressiveness: basic examles concurrency of ransiions alernaive or conflic synchronizaion
15 Examle Thalys rains: more comlex Thalys rains beween Cologne, Amserdam, Brussels and Paris. Synchronizaion a a Brussels and Paris s Realisic scenarios need more general definiions More han one oken er condiion, caaciies of laces weighs of edges sae sace of Peri nes may become infinie! k= ready roduce 2 idle k= 2 send Sorage k=5 acce 3 k=2 acceed 4 4 consume 5 ready k=2 Producer Consumers
16 Place/ransiion nes Def.: (P, T, F, K, W, M 0 ) is called a lace/ransiion ne (P/T ne) iff. N=(P,T,F) is a ne wih laces P and ransiions T 2. K: P (N 0 {ω}) \{0} denoes he caaciy of laces (ω symbolizes infinie caaciy) 3. W: F (N 0 \{0}) denoes he weigh of grah edges 4. M 0 : P N 0 {ω} reresens he iniial marking of laces W (Segmen of some ne) M 0 defauls: K = ω W = Comuing changes of markings Firing ransiions generae new markings on each of he laces according o he following rules:
17 Acivaed ransiions Transiion is acivaed iff Acivaed ransiions can ake lace or or fire, bu don have o. o. The order in in which acivaed ransiions fire is is no fixed (i (i is is non-deerminisic) Shorhand for changes of markings Firing ransiion: Le ( ) W (, )if \ + W (, )if \ = W (, ) + W (, )if 0 P: M () = M()+ () M = M+ +: vecor add
18 Marix N describing all changes of markings Def.: Marix N of ne N is a maing N: P T Z (inegers) such ha T: N(,)=() Comonen in column and row indicaes he change of he marking of lace if ransiion akes lace. + + = 0 )if, ( ), ( \ )if, ( \ )if, ( ) ( W W W W Examle: N = s
19 Comuaion of Invarians We are ineresed in subses R of laces whose number of labels remain invarian under ransiions, e.g. he number of rains commuing beween Amserdam and Paris (Cologne and Paris) remains consan Imoran for correcness roofs, e.g. he roof of liveness Comeing Trains Examle: Place Invarian 2,0,
Embedded Systems 5 BF - ES - 1 -
Embedded Sysems 5 - - REVIEW: Peri Nes Def.: N=C,E,F) is called a Peri ne, iff he following holds. C and E are disjoin ses 2. F C E) E C); is binary relaion, flow relaion ) Def.: Le N be a ne and le x
More informationfakultät für informatik informatik 12 technische universität dortmund Petri Nets Peter Marwedel TU Dortmund, Informatik /10/10
2 Peri Nes Peer Marwedel TU Dormund, Informaik 2 2008/0/0 Grahics: Alexandra Nole, Gesine Marwedel, 2003 Generalizaion of daa flow: Comuaional grahs Examle: Peri nes Inroduced in 962 by Carl Adam Peri
More informationEmbedded Systems 5. Midterm, Thursday December 18, 2008, Final, Thursday February 12, 2009, 16-19
Embedded Sysems 5 - - Exam Daes / egisraion Miderm, Thursday December 8, 8, 6-8 Final, Thursday February, 9, 6-9 egisraion hrough HISPOS oen in arox. week If HISPOS no alicable Non-CS, Erasmus, ec send
More informationEmbedded Systems CS - ES
Embedded Sysems - - Overview of embedded sysems design REVIEW - 2 - REVIEW - 3 - REVIEW - 4 - REVIEW - 5 - Scheduling rocesses in ES: Differences in goals REVIEW In classical OS, qualiy of scheduling is
More informationfakultät für informatik informatik 12 technische universität dortmund Petri Nets Peter Marwedel TU Dortmund, Informatik /11/09
2 Peri Nes Peer Marwedel TU Dormund, Informaik 2 2009//09 Grahics: Alexandra Nole, Gesine Marwedel, 2003 Models of comuaion considered in his course Communicaion/ local comuaions Undefined comonens Communicaing
More informationPetri Nets. Peter Marwedel TU Dortmund, Informatik /05/13 These slides use Microsoft clip arts. Microsoft copyright restrictions apply.
2 Peri Nes Peer Marwedel TU Dormund, Informaik 2 Grahics: Alexandra Nole, Gesine Marwedel, 2003 20/05/3 These slides use Microsof cli ars. Microsof coyrigh resricions aly. Models of comuaion considered
More informationPetri Nets. Peter Marwedel TU Dortmund, Informatik 年 10 月 31 日. technische universität dortmund. fakultät für informatik informatik 12
Sringer, 2 2 Peri Nes Peer Marwedel TU Dormund, Informaik 2 22 年 月 3 日 These slides use Microsof cli ars. Microsof coyrigh resricions aly. Models of comuaion considered in his course Communicaion/ local
More informationEmbedded Systems CS - ES
Embedded Sysems - - REVIEW Peri Nes - 2 - Comuing changes of markings REVIEW Firing ransiions generae new markings on each of he laces according o he following rules: When a ransiion fires from a marking
More informationI. Introduction to place/transition nets. Place/Transition Nets I. Example: a vending machine. Example: a vending machine
Inroducory Tuorial I. Inroducion o place/ransiion nes Place/Transiion Nes I Prepared by: Jörg Desel, Caholic Universiy in Eichsä and Karsen Schmid, Humbold-Universiä zu Berlin Speaker: Wolfgang Reisig,
More informationfakultät für informatik informatik 12 technische universität dortmund Petri nets Peter Marwedel Informatik 12 TU Dortmund Germany
12 Petri nets Peter Marwedel Informatik 12 TU Dortmund Germany Introduction Introduced in 1962 by Carl Adam Petri in his PhD thesis. Focus on modeling causal dependencies; no global synchronization assumed
More informationReduction of the Supervisor Design Problem with Firing Vector Constraints
wih Firing Vecor Consrains Marian V. Iordache School of Engineering and Eng. Tech. LeTourneau Universiy Longview, TX 75607-700 Panos J. Ansaklis Dearmen of Elecrical Engineering Universiy of Nore Dame
More informationA Method for Deadlock Prevention in Discrete Event Systems Using Petri Nets
M.V. Iordache, J.O. Moody and P.J. Ansaklis, "A Mehod for Deadlock Prevenion in Discree Even Sysems Using Peri Nes," Technical Reor isis-99-006, De. of Elecrical Engr., Univ. of Nore Dame, July 999. A
More informationA Method for Deadlock Prevention in Discrete Event Systems Using Petri Nets
A Mehod for Deadlock Prevenion in Discree Even Sysems Using Peri Nes Technical Reor of he ISIS Grou a he Universiy of Nore Dame ISIS-99-006 July, 999 Marian V. Iordache John O. Moody Panos J. Ansaklis
More informationContinuous Time Markov Chain (Markov Process)
Coninuous Time Markov Chain (Markov Process) The sae sace is a se of all non-negaive inegers The sysem can change is sae a any ime ( ) denoes he sae of he sysem a ime The random rocess ( ) forms a coninuous-ime
More informationChapter 3 Common Families of Distributions
Chaer 3 Common Families of Disribuions Secion 31 - Inroducion Purose of his Chaer: Caalog many of common saisical disribuions (families of disribuions ha are indeed by one or more arameers) Wha we should
More information5. Stochastic processes (1)
Lec05.pp S-38.45 - Inroducion o Teleraffic Theory Spring 2005 Conens Basic conceps Poisson process 2 Sochasic processes () Consider some quaniy in a eleraffic (or any) sysem I ypically evolves in ime randomly
More informationAutomated Synthesis of Liveness Enforcing Supervisors Using Petri Nets
Auomaed Synhesis of Liveness Enforcing Suervisors Using Peri Nes Technical Reor of he ISIS Grou a he Universiy of Nore Dame ISIS-00-00 Ocober, 000 Revised in January 00 and May 00 Marian V. Iordache John
More informationON DETERMINATION OF SOME CHARACTERISTICS OF SEMI-MARKOV PROCESS FOR DIFFERENT DISTRIBUTIONS OF TRANSIENT PROBABILITIES ABSTRACT
Zajac, Budny ON DETERMINATION O SOME CHARACTERISTICS O SEMI MARKOV PROCESS OR DIERENT DISTRIBUTIONS O R&RATA # 2(3 ar 2 (Vol. 2 29, June ON DETERMINATION O SOME CHARACTERISTICS O SEMI-MARKOV PROCESS OR
More information10. State Space Methods
. Sae Space Mehods. Inroducion Sae space modelling was briefly inroduced in chaper. Here more coverage is provided of sae space mehods before some of heir uses in conrol sysem design are covered in he
More informationBOX-JENKINS MODEL NOTATION. The Box-Jenkins ARMA(p,q) model is denoted by the equation. pwhile the moving average (MA) part of the model is θ1at
BOX-JENKINS MODEL NOAION he Box-Jenkins ARMA(,q) model is denoed b he equaion + + L+ + a θ a L θ a 0 q q. () he auoregressive (AR) ar of he model is + L+ while he moving average (MA) ar of he model is
More informationarxiv: v1 [math.rt] 15 Dec 2017
POSITIVITY OF DENOMINATOR VECTORS OF CLUSTER ALGEBRAS PEIGEN CAO FANG LI arxiv:1712.06975v1 [mah.rt] 15 Dec 2017 Absrac. In his aer, we rove ha osiiviy of denominaor vecors holds for any sewsymmeric cluser
More information- The whole joint distribution is independent of the date at which it is measured and depends only on the lag.
Saionary Processes Sricly saionary - The whole join disribuion is indeenden of he dae a which i is measured and deends only on he lag. - E y ) is a finie consan. ( - V y ) is a finie consan. ( ( y, y s
More informationMath 334 Fall 2011 Homework 11 Solutions
Dec. 2, 2 Mah 334 Fall 2 Homework Soluions Basic Problem. Transform he following iniial value problem ino an iniial value problem for a sysem: u + p()u + q() u g(), u() u, u () v. () Soluion. Le v u. Then
More informationDecentralized Control of Petri Nets
Decenralized Conrol of Peri Nes Marian V. Iordache and Panos J. Ansaklis Dearmen of Elecrical Engineering Universiy of Nore Dame Nore Dame, IN 6556 iordache.@nd.edu June, 00 M.V. Iordache and P.J. Ansaklis,
More informationG. =, etc.
Maerial Models υ υ3 0 0 0 υ υ 3 0 0 0 υ3 υ3 0 0 0 = 0 0 0 0 0 0 0 0 0 0 3 0 0 0 0 0 3 l (9..4) he subscris denoe he maerial axes, i.e., υ = υ and = (9..5) i j xi xj ii xi Since l is symmeric υ υ =, ec.
More informationLogic in computer science
Logic in compuer science Logic plays an imporan role in compuer science Logic is ofen called he calculus of compuer science Logic plays a similar role in compuer science o ha played by calculus in he physical
More informationIntermediate Macroeconomics: Mid-term exam May 30 th, 2016 Makoto Saito
1 Inermediae Macroeconomics: Mid-erm exam May 30 h, 2016 Makoo Saio Try he following hree roblems, and submi your answer in handwrien A4 aers. You are execed o dro your aers ino he mailbox assigned for
More informationA 2-Approximation Algorithm for Stochastic Inventory Control Models with Lost Sales
A 2-Aroximaion Algorihm for Sochasic Invenory Conrol Models wih Los Sales Resef Levi Sloan School of Managemen, MIT, Cambridge, MA, 02139, USA email: resef@mi.edu Ganesh Janakiraman IOMS-OM Grou, Sern
More informationLecture 20: Riccati Equations and Least Squares Feedback Control
34-5 LINEAR SYSTEMS Lecure : Riccai Equaions and Leas Squares Feedback Conrol 5.6.4 Sae Feedback via Riccai Equaions A recursive approach in generaing he marix-valued funcion W ( ) equaion for i for he
More informationReducing Probabilistic Timed Petri Nets for Asynchronous Architectural Analysis
Reducing Probabilisic Timed Peri Nes for Asynchronous Archiecural Analysis Sangyun Kim, Sunan Tugsinavisu Universiy of Souhern California Los Angeles, CA 90089, USA {sangyun,ugsinav}@eiger.usc.edu Peer
More informationTimed Circuits. Asynchronous Circuit Design. Timing Relationships. A Simple Example. Timed States. Timing Sequences. ({r 6 },t6 = 1.
Timed Circuis Asynchronous Circui Design Chris J. Myers Lecure 7: Timed Circuis Chaper 7 Previous mehods only use limied knowledge of delays. Very robus sysems, bu exremely conservaive. Large funcional
More informationLecture Notes 2. The Hilbert Space Approach to Time Series
Time Series Seven N. Durlauf Universiy of Wisconsin. Basic ideas Lecure Noes. The Hilber Space Approach o Time Series The Hilber space framework provides a very powerful language for discussing he relaionship
More informationPresentation Overview
Acion Refinemen in Reinforcemen Learning by Probabiliy Smoohing By Thomas G. Dieerich & Didac Busques Speaer: Kai Xu Presenaion Overview Bacground The Probabiliy Smoohing Mehod Experimenal Sudy of Acion
More informationDesigning Information Devices and Systems I Spring 2019 Lecture Notes Note 17
EES 16A Designing Informaion Devices and Sysems I Spring 019 Lecure Noes Noe 17 17.1 apaciive ouchscreen In he las noe, we saw ha a capacior consiss of wo pieces on conducive maerial separaed by a nonconducive
More informationDecentralized Control of Petri Nets
Marian Iordache, Panos J. Ansaklis, Decenralized Conrol of Peri Nes, Proceedings of he Worksho on Discree Even Sysems Conrol a he h Inernaional Conference on Alicaion and Theory of Peri Nes (ATPN 00),.-58,
More informationSynthesis of Concurrent Programs Based on Supervisory Control
Synhesis of Concurren Programs Based on Suervisory Conrol Marian V. Iordache School of Engineering and Eng. Tech. LeTourneau Universiy Longview, TX 75607, USA E-mail: MarianIordache@leu.edu Panos J. Ansaklis
More informationNotes for Lecture 17-18
U.C. Berkeley CS278: Compuaional Complexiy Handou N7-8 Professor Luca Trevisan April 3-8, 2008 Noes for Lecure 7-8 In hese wo lecures we prove he firs half of he PCP Theorem, he Amplificaion Lemma, up
More informationStationary Distribution. Design and Analysis of Algorithms Andrei Bulatov
Saionary Disribuion Design and Analysis of Algorihms Andrei Bulaov Algorihms Markov Chains 34-2 Classificaion of Saes k By P we denoe he (i,j)-enry of i, j Sae is accessible from sae if 0 for some k 0
More information11!Hí MATHEMATICS : ERDŐS AND ULAM PROC. N. A. S. of decomposiion, properly speaking) conradics he possibiliy of defining a counably addiive real-valu
ON EQUATIONS WITH SETS AS UNKNOWNS BY PAUL ERDŐS AND S. ULAM DEPARTMENT OF MATHEMATICS, UNIVERSITY OF COLORADO, BOULDER Communicaed May 27, 1968 We shall presen here a number of resuls in se heory concerning
More informationLongest Common Prefixes
Longes Common Prefixes The sandard ordering for srings is he lexicographical order. I is induced by an order over he alphabe. We will use he same symbols (,
More informationSTATE-SPACE MODELLING. A mass balance across the tank gives:
B. Lennox and N.F. Thornhill, 9, Sae Space Modelling, IChemE Process Managemen and Conrol Subjec Group Newsleer STE-SPACE MODELLING Inroducion: Over he pas decade or so here has been an ever increasing
More information( ) ( ) if t = t. It must satisfy the identity. So, bulkiness of the unit impulse (hyper)function is equal to 1. The defining characteristic is
UNIT IMPULSE RESPONSE, UNIT STEP RESPONSE, STABILITY. Uni impulse funcion (Dirac dela funcion, dela funcion) rigorously defined is no sricly a funcion, bu disribuion (or measure), precise reamen requires
More information2.3 SCHRÖDINGER AND HEISENBERG REPRESENTATIONS
Andrei Tokmakoff, MIT Deparmen of Chemisry, 2/22/2007 2-17 2.3 SCHRÖDINGER AND HEISENBERG REPRESENTATIONS The mahemaical formulaion of he dynamics of a quanum sysem is no unique. So far we have described
More informationRemoving Useless Productions of a Context Free Grammar through Petri Net
Journal of Compuer Science 3 (7): 494-498, 2007 ISSN 1549-3636 2007 Science Publicaions Removing Useless Producions of a Conex Free Grammar hrough Peri Ne Mansoor Al-A'ali and Ali A Khan Deparmen of Compuer
More informationFault Tolerant Computing CS 530 Reliability Analysis. Yashwant K. Malaiya Colorado State University
CS 53 eliabiliy Analysis Yashwan K. Malaiya Colorado Sae Universiy February 6, 27 eliabiliy Analysis: Ouline eliabiliy measures: eliabiliy, availabiliy, Transacion eliabiliy, MTTF and (, MTBF Basic Cases
More informationMath 315: Linear Algebra Solutions to Assignment 6
Mah 35: Linear Algebra s o Assignmen 6 # Which of he following ses of vecors are bases for R 2? {2,, 3, }, {4,, 7, 8}, {,,, 3}, {3, 9, 4, 2}. Explain your answer. To generae he whole R 2, wo linearly independen
More informationCHEMICAL KINETICS: 1. Rate Order Rate law Rate constant Half-life Temperature Dependence
CHEMICL KINETICS: Rae Order Rae law Rae consan Half-life Temperaure Dependence Chemical Reacions Kineics Chemical ineics is he sudy of ime dependence of he change in he concenraion of reacans and producs.
More informationLinear Control System EE 711. Design. Lecture 8 Dr. Mostafa Abdel-geliel
Linear Conrol Sysem EE 7 MIMO Sae Space Analysis and Design Lecure 8 Dr. Mosafa Abdel-geliel Course Conens Review Sae Space SS modeling and analysis Sae feed back design Oupu feedback design Observer design
More informationAn Excursion into Set Theory using a Constructivist Approach
An Excursion ino Se Theory using a Consrucivis Approach Miderm Repor Nihil Pail under supervision of Ksenija Simic Fall 2005 Absrac Consrucive logic is an alernaive o he heory of classical logic ha draws
More informationBasic Circuit Elements Professor J R Lucas November 2001
Basic Circui Elemens - J ucas An elecrical circui is an inerconnecion of circui elemens. These circui elemens can be caegorised ino wo ypes, namely acive and passive elemens. Some Definiions/explanaions
More informationEmbedded Systems 6 REVIEW. Place/transition nets. defaults: K = ω W = 1
Embedded Systems 6-1 - Place/transition nets REVIEW Def.: (P, T, F, K, W, M 0 ) is called a place/transition net (P/T net) iff 1. N=(P,T,F) is a net with places p P and transitions t T 2. K: P (N 0 {ω})
More informationh[n] is the impulse response of the discrete-time system:
Definiion Examples Properies Memory Inveribiliy Causaliy Sabiliy Time Invariance Lineariy Sysems Fundamenals Overview Definiion of a Sysem x() h() y() x[n] h[n] Sysem: a process in which inpu signals are
More informationSynthesis of the Supervising Agent in MAS
Synhesis of he Supervising Agen in MAS Franišek Čapkovič Insiue of Informaics, Slovak Academy of Sciences Dúbravská cesa 9, 845 07 Braislava, Slovak Republic Franisek.Capkovic@savba.sk hp://www.ui.sav.sk/home/capkovic/capkhome.hm
More informationComputer-Aided Analysis of Electronic Circuits Course Notes 3
Gheorghe Asachi Technical Universiy of Iasi Faculy of Elecronics, Telecommunicaions and Informaion Technologies Compuer-Aided Analysis of Elecronic Circuis Course Noes 3 Bachelor: Telecommunicaion Technologies
More informationWavelet Methods for Time Series Analysis. What is a Wavelet? Part I: Introduction to Wavelets and Wavelet Transforms. sines & cosines are big waves
Wavele Mehods for Time Series Analysis Par I: Inroducion o Waveles and Wavele Transforms waveles are analysis ools for ime series and images as a subjec, waveles are relaively new (983 o presen) a synhesis
More informationMATH 128A, SUMMER 2009, FINAL EXAM SOLUTION
MATH 28A, SUMME 2009, FINAL EXAM SOLUTION BENJAMIN JOHNSON () (8 poins) [Lagrange Inerpolaion] (a) (4 poins) Le f be a funcion defined a some real numbers x 0,..., x n. Give a defining equaion for he Lagrange
More informationApplication of a Stochastic-Fuzzy Approach to Modeling Optimal Discrete Time Dynamical Systems by Using Large Scale Data Processing
Applicaion of a Sochasic-Fuzzy Approach o Modeling Opimal Discree Time Dynamical Sysems by Using Large Scale Daa Processing AA WALASZE-BABISZEWSA Deparmen of Compuer Engineering Opole Universiy of Technology
More informationBasilio Bona ROBOTICA 03CFIOR 1
Indusrial Robos Kinemaics 1 Kinemaics and kinemaic funcions Kinemaics deals wih he sudy of four funcions (called kinemaic funcions or KFs) ha mahemaically ransform join variables ino caresian variables
More informationStudy and Evaluation of Performances of the Digital Multimeter
Sudy and Evaluaion of Performances of he Digial Mulimeer. Inroducion Mulimeers allow measuring he mos common elecrical quaniies: volage, curren, resisance. They evolved from simle ones based on elecromechanical
More informationStatistical Mechanics
Kno Theory and Saisical Mechanics KNOTS: A 3-dimensional loop projeced ono a 2-dimensional surface Unkno Trefoil Figure 8 LINK: The enanglemen of 2 or more loops 2 9 38 Unkno Unkno Trefoil Hopf link
More informationDescription of the MS-Regress R package (Rmetrics)
Descriion of he MS-Regress R ackage (Rmerics) Auhor: Marcelo Perlin PhD Suden / ICMA Reading Universiy Email: marceloerlin@gmail.com / m.erlin@icmacenre.ac.uk The urose of his documen is o show he general
More informationMonochromatic Infinite Sumsets
Monochromaic Infinie Sumses Imre Leader Paul A. Russell July 25, 2017 Absrac WeshowhahereisaraionalvecorspaceV suchha,whenever V is finiely coloured, here is an infinie se X whose sumse X+X is monochromaic.
More informationVerification of Coprognosability in Decentralized Fault Prognosis of Labeled Petri Nets
28 IEEE Conference on Decision and Conrol (CDC Miami Beach, FL, USA, Dec. 7-9, 28 Verificaion of Corognosabiliy in Decenralized Faul Prognosis of Labeled Peri es Wenqing Wu, Xiang Yin and Shaoyuan Li Absrac
More informationThe Arcsine Distribution
The Arcsine Disribuion Chris H. Rycrof Ocober 6, 006 A common heme of he class has been ha he saisics of single walker are ofen very differen from hose of an ensemble of walkers. On he firs homework, we
More informationStochastic Model for Cancer Cell Growth through Single Forward Mutation
Journal of Modern Applied Saisical Mehods Volume 16 Issue 1 Aricle 31 5-1-2017 Sochasic Model for Cancer Cell Growh hrough Single Forward Muaion Jayabharahiraj Jayabalan Pondicherry Universiy, jayabharahi8@gmail.com
More informationOn Boundedness of Q-Learning Iterates for Stochastic Shortest Path Problems
MATHEMATICS OF OPERATIONS RESEARCH Vol. 38, No. 2, May 2013, pp. 209 227 ISSN 0364-765X (prin) ISSN 1526-5471 (online) hp://dx.doi.org/10.1287/moor.1120.0562 2013 INFORMS On Boundedness of Q-Learning Ieraes
More informationCurves and Surfaces. Chap. 8 Intro. to Computer Graphics, Spring 2009, Y. G. Shin
Curves and Surfaces Cha. 8 Inro. o Comuer Grahics, Sring 9, Y. G. Shin Reresenaion of Curves and Surfaces Key words surface modeling arameric surface coninuiy, conrol oins basis funcions Bezier curve B-sline
More informationIntuitionistic Fuzzy 2-norm
In. Journal of Mah. Analysis, Vol. 5, 2011, no. 14, 651-659 Inuiionisic Fuzzy 2-norm B. Surender Reddy Deparmen of Mahemaics, PGCS, Saifabad, Osmania Universiy Hyderabad - 500004, A.P., India bsrmahou@yahoo.com
More informationMODELLING DISTRIBUTED MANUFACTURING SYSTEMS VIA FIRST ORDER HYBRID PETRI NETS. Mariagrazia Dotoli, Maria Pia Fanti, Agostino Marcello Mangini
MODELLING DISTRIBUTED MANUFACTURING SYSTEMS VIA FIRST ORDER HYBRID PETRI NETS Mariagrazia Dooli, Maria Pia Fani, Agosino Marcello Mangini Diarimeno di Eleroecnica ed Eleronica, Poliecnico di Bari, Ialy
More informationSUBSPACES OF MATRICES WITH SPECIAL RANK PROPERTIES
SUBSPACES OF MATRICES WITH SPECIAL RANK PROPERTIES JEAN-GUILLAUME DUMAS, ROD GOW, GARY MCGUIRE, AND JOHN SHEEKEY Absrac. Le K be a field and le V be a vecor space of finie dimension n over K. We invesigae
More informationLearning a Class from Examples. Training set X. Class C 1. Class C of a family car. Output: Input representation: x 1 : price, x 2 : engine power
Alpaydin Chaper, Michell Chaper 7 Alpaydin slides are in urquoise. Ehem Alpaydin, copyrigh: The MIT Press, 010. alpaydin@boun.edu.r hp://www.cmpe.boun.edu.r/ ehem/imle All oher slides are based on Michell.
More informationMath Spring 2015 PRACTICE FINAL EXAM (modified from Math 2280 final exam, April 29, 2011)
ame ID number Mah 8- Sring 5 PRACTICE FIAL EXAM (modified from Mah 8 final exam, Aril 9, ) This exam is closed-book and closed-noe You may use a scienific calculaor, bu no one which is caable of grahing
More informationSome Ramsey results for the n-cube
Some Ramsey resuls for he n-cube Ron Graham Universiy of California, San Diego Jozsef Solymosi Universiy of Briish Columbia, Vancouver, Canada Absrac In his noe we esablish a Ramsey-ype resul for cerain
More informationApproximation Algorithms for Unique Games via Orthogonal Separators
Approximaion Algorihms for Unique Games via Orhogonal Separaors Lecure noes by Konsanin Makarychev. Lecure noes are based on he papers [CMM06a, CMM06b, LM4]. Unique Games In hese lecure noes, we define
More informationThe Residual Graph. 12 Augmenting Path Algorithms. Augmenting Path Algorithm. Augmenting Path Algorithm
Augmening Pah Algorihm Greedy-algorihm: ar wih f (e) = everywhere find an - pah wih f (e) < c(e) on every edge augmen flow along he pah repea a long a poible The Reidual Graph From he graph G = (V, E,
More informationOn a problem of Graham By E. ERDŐS and E. SZEMERÉDI (Budapest) GRAHAM stated the following conjecture : Let p be a prime and a 1,..., ap p non-zero re
On a roblem of Graham By E. ERDŐS and E. SZEMERÉDI (Budaes) GRAHAM saed he following conjecure : Le be a rime and a 1,..., a non-zero residues (mod ). Assume ha if ' a i a i, ei=0 or 1 (no all e i=0) is
More informationTransform Techniques. Moment Generating Function
Transform Techniques A convenien way of finding he momens of a random variable is he momen generaing funcion (MGF). Oher ransform echniques are characerisic funcion, z-ransform, and Laplace ransform. Momen
More informationModeling Economic Time Series with Stochastic Linear Difference Equations
A. Thiemer, SLDG.mcd, 6..6 FH-Kiel Universiy of Applied Sciences Prof. Dr. Andreas Thiemer e-mail: andreas.hiemer@fh-kiel.de Modeling Economic Time Series wih Sochasic Linear Difference Equaions Summary:
More informationLecture 1 Overview. course mechanics. outline & topics. what is a linear dynamical system? why study linear systems? some examples
EE263 Auumn 27-8 Sephen Boyd Lecure 1 Overview course mechanics ouline & opics wha is a linear dynamical sysem? why sudy linear sysems? some examples 1 1 Course mechanics all class info, lecures, homeworks,
More information1 Review of Zero-Sum Games
COS 5: heoreical Machine Learning Lecurer: Rob Schapire Lecure #23 Scribe: Eugene Brevdo April 30, 2008 Review of Zero-Sum Games Las ime we inroduced a mahemaical model for wo player zero-sum games. Any
More informationFinish reading Chapter 2 of Spivak, rereading earlier sections as necessary. handout and fill in some missing details!
MAT 257, Handou 6: Ocober 7-2, 20. I. Assignmen. Finish reading Chaper 2 of Spiva, rereading earlier secions as necessary. handou and fill in some missing deails! II. Higher derivaives. Also, read his
More informationEE363 homework 1 solutions
EE363 Prof. S. Boyd EE363 homework 1 soluions 1. LQR for a riple accumulaor. We consider he sysem x +1 = Ax + Bu, y = Cx, wih 1 1 A = 1 1, B =, C = [ 1 ]. 1 1 This sysem has ransfer funcion H(z) = (z 1)
More informationInnova Junior College H2 Mathematics JC2 Preliminary Examinations Paper 2 Solutions 0 (*)
Soluion 3 x 4x3 x 3 x 0 4x3 x 4x3 x 4x3 x 4x3 x x 3x 3 4x3 x Innova Junior College H Mahemaics JC Preliminary Examinaions Paper Soluions 3x 3 4x 3x 0 4x 3 4x 3 0 (*) 0 0 + + + - 3 3 4 3 3 3 3 Hence x or
More informationFor example, the comb filter generated from. ( ) has a transfer function. e ) has L notches at ω = (2k+1)π/L and L peaks at ω = 2π k/l,
Comb Filers The simple filers discussed so far are characeried eiher by a single passband and/or a single sopband There are applicaions where filers wih muliple passbands and sopbands are required The
More informationThe Residual Graph. 11 Augmenting Path Algorithms. Augmenting Path Algorithm. Augmenting Path Algorithm
Augmening Pah Algorihm Greedy-algorihm: ar wih f (e) = everywhere find an - pah wih f (e) < c(e) on every edge augmen flow along he pah repea a long a poible The Reidual Graph From he graph G = (V, E,
More informationOptimal Server Assignment in Multi-Server
Opimal Server Assignmen in Muli-Server 1 Queueing Sysems wih Random Conneciviies Hassan Halabian, Suden Member, IEEE, Ioannis Lambadaris, Member, IEEE, arxiv:1112.1178v2 [mah.oc] 21 Jun 2013 Yannis Viniois,
More informationLaplace transfom: t-translation rule , Haynes Miller and Jeremy Orloff
Laplace ransfom: -ranslaion rule 8.03, Haynes Miller and Jeremy Orloff Inroducory example Consider he sysem ẋ + 3x = f(, where f is he inpu and x he response. We know is uni impulse response is 0 for
More information4 Sequences of measurable functions
4 Sequences of measurable funcions 1. Le (Ω, A, µ) be a measure space (complee, afer a possible applicaion of he compleion heorem). In his chaper we invesigae relaions beween various (nonequivalen) convergences
More informationCHAPTER 2 Signals And Spectra
CHAPER Signals And Specra Properies of Signals and Noise In communicaion sysems he received waveform is usually caegorized ino he desired par conaining he informaion, and he undesired par. he desired par
More informationLinear Dynamic Models
Linear Dnamic Models and Forecasing Reference aricle: Ineracions beween he muliplier analsis and he principle of acceleraion Ouline. The sae space ssem as an approach o working wih ssems of difference
More informationGlobal Synchronization of Directed Networks with Fast Switching Topologies
Commun. Theor. Phys. (Beijing, China) 52 (2009) pp. 1019 1924 c Chinese Physical Sociey and IOP Publishing Ld Vol. 52, No. 6, December 15, 2009 Global Synchronizaion of Direced Neworks wih Fas Swiching
More informationRetrieval Models. Boolean and Vector Space Retrieval Models. Common Preprocessing Steps. Boolean Model. Boolean Retrieval Model
1 Boolean and Vecor Space Rerieval Models Many slides in his secion are adaped from Prof. Joydeep Ghosh (UT ECE) who in urn adaped hem from Prof. Dik Lee (Univ. of Science and Tech, Hong Kong) Rerieval
More informationReady for euro? Empirical study of the actual monetary policy independence in Poland VECM modelling
Macroeconomerics Handou 2 Ready for euro? Empirical sudy of he acual moneary policy independence in Poland VECM modelling 1. Inroducion This classes are based on: Łukasz Goczek & Dagmara Mycielska, 2013.
More informationChapter 15: Phenomena. Chapter 15 Chemical Kinetics. Reaction Rates. Reaction Rates R P. Reaction Rates. Rate Laws
Chaper 5: Phenomena Phenomena: The reacion (aq) + B(aq) C(aq) was sudied a wo differen emperaures (98 K and 35 K). For each emperaure he reacion was sared by puing differen concenraions of he 3 species
More informationOn the Existence, Uniqueness and Stability Behavior of a Random Solution to a Non local Perturbed Stochastic Fractional Integro-Differential Equation
On he Exisence, Uniqueness and Sabiliy ehavior of a Random Soluion o a Non local Perurbed Sochasic Fracional Inegro-Differenial Equaion Mahmoud M. El-orai,*, M.A.Abdou, Mohamed Ibrahim M. Youssef Dearmen
More informationHybrid Control and Switched Systems. Lecture #3 What can go wrong? Trajectories of hybrid systems
Hybrid Conrol and Swiched Sysems Lecure #3 Wha can go wrong? Trajecories of hybrid sysems João P. Hespanha Universiy of California a Sana Barbara Summary 1. Trajecories of hybrid sysems: Soluion o a hybrid
More informationAn Introduction to Malliavin calculus and its applications
An Inroducion o Malliavin calculus and is applicaions Lecure 5: Smoohness of he densiy and Hörmander s heorem David Nualar Deparmen of Mahemaics Kansas Universiy Universiy of Wyoming Summer School 214
More informationLinear Cryptanalysis
Linear Crypanalysis T-79.550 Crypology Lecure 5 February 6, 008 Kaisa Nyberg Linear Crypanalysis /36 SPN A Small Example Linear Crypanalysis /36 Linear Approximaion of S-boxes Linear Crypanalysis 3/36
More informationIntroduction D P. r = constant discount rate, g = Gordon Model (1962): constant dividend growth rate.
Inroducion Gordon Model (1962): D P = r g r = consan discoun rae, g = consan dividend growh rae. If raional expecaions of fuure discoun raes and dividend growh vary over ime, so should he D/P raio. Since
More informationLECTURE 1: GENERALIZED RAY KNIGHT THEOREM FOR FINITE MARKOV CHAINS
LECTURE : GENERALIZED RAY KNIGHT THEOREM FOR FINITE MARKOV CHAINS We will work wih a coninuous ime reversible Markov chain X on a finie conneced sae space, wih generaor Lf(x = y q x,yf(y. (Recall ha q
More information