Complexity in Modal Team Logic
|
|
- Arlene Cooper
- 6 years ago
- Views:
Transcription
1 ThI Theoretische Informtik Complexity in Modl Tem Logic Julin-Steffen Müller Theoretische Informtik 18. Jnur 2012 Theorietg 2012
2 Theoretische Informtik Inhlt 1 Preliminries 2 Closure properties 3 Model Checking 4 Results 5 Conclusion Preliminries Closure properties Model Checking Results Conclusion Seite 2
3 Theoretische Informtik Motivtion Modl Dependence Logic MDL descries tomic dependencies etween vriles. Originl introduced y Vänäänen for first-order logic. Studying computle cses. Modl Tem Logic MDL cnnot express tht certin dependence etween vriles does not hold. Tem semtics without dependence tom. Preliminries Closure properties Model Checking Results Conclusion Seite 3
4 Theoretische Informtik Semntic of MTL Split junction M, T = ϕ ϕ T 1 T 2 = T : M, T 1 = ϕ nd M, T 2 = ϕ Preliminries Closure properties Model Checking Results Conclusion Seite 4
5 Theoretische Informtik Semntic of MTL Split junction M, T = ϕ ϕ T 1 T 2 = T : M, T 1 = ϕ nd M, T 2 = ϕ Exmples M, {, } = Preliminries Closure properties Model Checking Results Conclusion Seite 4
6 Theoretische Informtik Semntic of MTL Clssicl disjunction M, T = ϕ ϕ M, T = ϕ or M, T = ϕ Preliminries Closure properties Model Checking Results Conclusion Seite 4
7 Theoretische Informtik Semntic of MTL Clssicl disjunction M, T = ϕ ϕ M, T = ϕ or M, T = ϕ Exmples M, {, } = Preliminries Closure properties Model Checking Results Conclusion Seite 4
8 Theoretische Informtik Semntic of MTL Clssicl disjunction M, T = ϕ ϕ M, T = ϕ or M, T = ϕ Exmples M, {, } = M, {,, } = Preliminries Closure properties Model Checking Results Conclusion Seite 4
9 Theoretische Informtik Semntic of MTL Modl exists M, T = ϕ ˆT T : M, ˆT = ϕ Preliminries Closure properties Model Checking Results Conclusion Seite 4
10 Theoretische Informtik Semntic of MTL Modl exists M, T = ϕ ˆT T : M, ˆT = ϕ Exmples M, {, } = ( ) Preliminries Closure properties Model Checking Results Conclusion Seite 4
11 Theoretische Informtik Semntic of MTL Modl next M, T = ϕ M, R[T ] = ϕ Preliminries Closure properties Model Checking Results Conclusion Seite 4
12 Theoretische Informtik Semntic of MTL Modl next M, T = ϕ M, R[T ] = ϕ Exmples M, {, } = ( ) Preliminries Closure properties Model Checking Results Conclusion Seite 4
13 Theoretische Informtik Semntic of MTL Modl next M, T = ϕ M, R[T ] = ϕ Exmples M, {, } = ( ) M, {, } = ( ) Preliminries Closure properties Model Checking Results Conclusion Seite 4
14 Theoretische Informtik Semntic of MTL Dependence tom M, T = dep(p 1,..., p n 1 ; p n ) ˆT T : M, ˆT = ϕ Preliminries Closure properties Model Checking Results Conclusion Seite 4
15 Theoretische Informtik Semntic of MTL Dependence tom M, T = dep(p 1,..., p n 1 ; p n ) ˆT T : M, ˆT = ϕ Exmples M, {, } = dep(; ) Preliminries Closure properties Model Checking Results Conclusion Seite 4
16 Theoretische Informtik Semntic of MTL Dependence tom M, T = dep(p 1,..., p n 1 ; p n ) ˆT T : M, ˆT = ϕ Exmples M, {, } = dep(; ) M, {,, } = dep(; ) Preliminries Closure properties Model Checking Results Conclusion Seite 4
17 Theoretische Informtik Semntic of MTL Clssicl negtion M, T = ϕ M, T = ϕ Preliminries Closure properties Model Checking Results Conclusion Seite 4
18 Theoretische Informtik Semntic of MTL Clssicl negtion M, T = ϕ M, T = ϕ Exmples M, { } = Preliminries Closure properties Model Checking Results Conclusion Seite 4
19 Theoretische Informtik Semntic of MTL Clssicl negtion M, T = ϕ M, T = ϕ Exmples M, { } = M, {, } = Preliminries Closure properties Model Checking Results Conclusion Seite 4
20 Theoretische Informtik Dul opertor to opertor Let ϕ e MTL formul. Then ϕ is defined y ϕ. Preliminries Closure properties Model Checking Results Conclusion Seite 5
21 Theoretische Informtik Semntic of MTL Modl forll M, T = ϕ ˆT T : M, ˆT = ϕ Preliminries Closure properties Model Checking Results Conclusion Seite 6
22 Theoretische Informtik Semntic of MTL Modl forll M, T = ϕ ˆT T : M, ˆT = ϕ Exmples M, { } = dep() Preliminries Closure properties Model Checking Results Conclusion Seite 6
23 Theoretische Informtik Semntic of MTL Modl forll M, T = ϕ ˆT T : M, ˆT = ϕ Exmples M, { } = dep() Preliminries Closure properties Model Checking Results Conclusion Seite 6
24 Theoretische Informtik Semntic of MTL Modl forll M, T = ϕ ˆT T : M, ˆT = ϕ Exmples M, { } = dep() Preliminries Closure properties Model Checking Results Conclusion Seite 6
25 Theoretische Informtik Semntic of MTL Modl forll M, T = ϕ ˆT T : M, ˆT = ϕ Exmples M, { } = dep() Preliminries Closure properties Model Checking Results Conclusion Seite 6
26 Theoretische Informtik Semntic of MTL Modl forll M, T = ϕ ˆT T : M, ˆT = ϕ Exmples M, { } = dep() M, {, } = dep(; ) Preliminries Closure properties Model Checking Results Conclusion Seite 6
27 Theoretische Informtik Semntic of MTL Modl forll M, T = ϕ ˆT T : M, ˆT = ϕ Exmples M, { } = dep() M, {, } = dep(; ) Preliminries Closure properties Model Checking Results Conclusion Seite 6
28 Theoretische Informtik Semntic of MTL Modl forll M, T = ϕ ˆT T : M, ˆT = ϕ Exmples M, { } = dep() M, {, } = dep(; ) Preliminries Closure properties Model Checking Results Conclusion Seite 6
29 Theoretische Informtik Semntic of MTL Modl forll M, T = ϕ ˆT T : M, ˆT = ϕ Exmples M, { } = dep() M, {, } = dep(; ) Preliminries Closure properties Model Checking Results Conclusion Seite 6
30 Theoretische Informtik Semntic of MTL Modl forll M, T = ϕ ˆT T : M, ˆT = ϕ Exmples M, { } = dep() M, {, } = dep(; ) Preliminries Closure properties Model Checking Results Conclusion Seite 6
31 Theoretische Informtik Closure properties Downwrds closure M, T = ϕ T T : M, T = ϕ Union closure M, T = ϕ nd M, T = ϕ M, T T = ϕ Fltness M, T = ϕ w T : M, w = ϕ Fltness follows from downwrds nd union closure! Preliminries Closure properties Model Checking Results Conclusion Seite 7
32 Theoretische Informtik Closure properties Downwrds closure ML MDL MTL M, T = ϕ T T : M, T = ϕ Union closure M, T = ϕ nd M, T = ϕ M, T T = ϕ Fltness M, T = ϕ w T : M, w = ϕ Fltness follows from downwrds nd union closure! Preliminries Closure properties Model Checking Results Conclusion Seite 7
33 Theoretische Informtik Closure properties Downwrds closure ML MDL MTL M, T = ϕ T T : M, T = ϕ Union closure ML MDL MTL M, T = ϕ nd M, T = ϕ M, T T = ϕ Fltness M, T = ϕ w T : M, w = ϕ Fltness follows from downwrds nd union closure! Preliminries Closure properties Model Checking Results Conclusion Seite 7
34 Theoretische Informtik Closure properties Downwrds closure ML MDL MTL M, T = ϕ T T : M, T = ϕ Union closure ML MDL MTL M, T = ϕ nd M, T = ϕ M, T T = ϕ Fltness ML MDL MTL M, T = ϕ w T : M, w = ϕ Fltness follows from downwrds nd union closure! Preliminries Closure properties Model Checking Results Conclusion Seite 7
35 Theoretische Informtik ϕ ϕ Theorem Let ϕ e downwrds closed MTL formul. Then ϕ is equivlent to ϕ. Preliminries Closure properties Model Checking Results Conclusion Seite 8
36 Theoretische Informtik Model Checking Prolem MTL-MC Instnce: MTL formul ϕ, Kripke Modell M, MTL tem T Question: Is ϕ vlid under M nd T (M, T = ϕ)? MTL-SAT Instnce: MTL formul ϕ Question: Is there Kripke Model M nd tem T which stisfies ϕ? Preliminries Closure properties Model Checking Results Conclusion Seite 9
37 Theoretische Informtik Known Results for MDL Modl dependence logic (MDL) is defined nlogous to modl tem logic, ut without the clssicl negtion. Complexity of Model Checking It ws shown y Eing nd Lohmnn in 2011 tht the model checking prolem for MDL is NP-complete. Complexity of Stisfyility It ws shown y Lohmnn nd Vollmer in 2010 tht the stisfiility prolem for MDL is NEXPTIME-complete. How expressive is MTL in comprsion to MDL? Preliminries Closure properties Model Checking Results Conclusion Seite 10
38 Theoretische Informtik Result overview k dep Complexity PSPACE-complete PSPACE-complete k 0 + Σ p k+1 -complete k 0 Σ p k -complete P NP[1] -complete + + P-complete NC 1 -complete Telle: Complexity results for model checking in MTL Preliminries Closure properties Model Checking Results Conclusion Seite 11
39 Theoretische Informtik MTL-MC is in PSPACE Non determinism in MDL Let M e Kripke Model nd T tem over M. 1 M, T = ϕ ϕ T 1, T 2 with T = T 1 T 2 : T 1 = ϕ nd T 2 = ϕ 2 M, T = ϕ ˆT T : M ˆT = ϕ 3 M, T = ϕ M, T = ϕ In worst cse ech su formul uses the non determinism to serch through ll worlds. This is polynomil ounded in spce. Preliminries Closure properties Model Checking Results Conclusion Seite 12
40 Theoretische Informtik MTL-MC is PSPACE-hrd Theorem Let ϕ = x 1 x 2... x m n i=1 C i. Then ϕ 3QBF (M, T, δ 1 ) MTL-MC. Kripke Model M p 1 1 p 1 1 p 1 1 p 1 n 0... n w n n d d n 0... d n n 0... n w n n p 0 1 p 0 1 p 0 1 p 0 n Preliminries Closure properties Model Checking Results Conclusion Seite 13
41 Theoretische Informtik MTL-MC is PSPACE-hrd Theorem Let ϕ = x 1 x 2... x m n i=1 C i. Then ϕ 3QBF (M, T, δ 1 ) MTL-MC. Kripke Model M, strting tem T p 1 1 p 1 1 p 1 1 p 1 n 0... n w n n d 1... d 0 0 n... d n n 0... n w n n p 0 1 p 0 1 p 0 1 p 0 n Preliminries Closure properties Model Checking Results Conclusion Seite 13
42 Theoretische Informtik MTL-MC is PSPACE-hrd Existentil prt (i is odd) δ i = ((p 1 i p 0 i ) δ i+1) Universl prt (i is even) δ i = ((p 1 i p 0 i ) δ i+1) Evlution (i = n + 1) δ i = m i=1 ( l i1 l i2 l i3 ) Preliminries Closure properties Model Checking Results Conclusion Seite 14
43 Theoretische Informtik Restricted clssicl negtion Wht hppens if the nesting of clssicl negtion is restricted? Equivilnt with restricting the lterntion of existentil nd universl quntifictions. 3QBF k. MTL-MC(,,, ) is Σ p k -complete. MTL-MC(,,,, dep) is Σ p k+1 -complete. Preliminries Closure properties Model Checking Results Conclusion Seite 15
44 Theoretische Informtik MTL-MC (, dep, ) is in P NP[1] Ech MTL formul over {, dep, } is of the form ϕ = ϕ or ϕ = ϕ, where: ϕ = i 1 i 2... i k λ λ {dep} VAR ϕ cn e solved with the NP-complete prolem MDL-MC. Orcle Answer is negted if ϕ = ϕ. Preliminries Closure properties Model Checking Results Conclusion Seite 16
45 Theoretische Informtik MTL-MC(, dep, ) is P NP[1] hrd A generl P NP[1] mchine cn e reduced to: input x f SAT 1 0 cc rej f SAT Preliminries Closure properties Model Checking Results Conclusion Seite 17
46 Theoretische Informtik MTL-MC(, dep, ) is P NP[1] hrd A generl P NP[1] mchine cn e reduced to: input x f SAT 1 0 cc rej f SAT input x f SAT 1 0 rej cc f SAT Preliminries Closure properties Model Checking Results Conclusion Seite 17
47 Theoretische Informtik MTL-MC(, dep, ) is P NP[1] hrd A generl P NP[1] mchine cn e reduced to: input x f SAT 1 0 cc rej f SAT input x f SAT 1 0 rej cc f SAT input x f SAT cc 1 cc 0 Accept lwys Preliminries Closure properties Model Checking Results Conclusion Seite 17
48 Theoretische Informtik MTL-MC(, dep, ) is P NP[1] hrd A generl P NP[1] mchine cn e reduced to: input x input x input x input x f SAT 1 0 cc rej f SAT 1 0 rej cc f SAT cc 1 cc 0 f SAT 1 0 rej rej f SAT f SAT Accept lwys Reject lwys Preliminries Closure properties Model Checking Results Conclusion Seite 17
49 Theoretische Informtik MTL-MC(, dep, ) is P NP[1] hrd A generl P NP[1] mchine cn e reduced to: input x input x input x input x f SAT 1 0 cc rej f SAT 1 0 rej cc f SAT cc 1 cc 0 f SAT 1 0 rej rej f SAT f SAT Accept lwys Reject lwys Since MDL-MC(, dep) is NP-complete, MTL-MC(, dep) cn simulte the SAT orcle questions. Preliminries Closure properties Model Checking Results Conclusion Seite 17
50 Theoretische Informtik Conclusion Summry Filure of downwrds closure is not the reson for the complexity lep. Restricting the clssicl negtion is equl to restrict possile quntor lterntions. Open Questions Complexity of MTL-MC(, ). Mye PSPACE-complete. Complexity of MTL stisfiility prolem. Definition nd clssifiction of dependence temporl logic. Preliminries Closure properties Model Checking Results Conclusion Seite 18
Complexity of intuitionistic logic. Martin Mundhenk
Complexity of intuitionistic logic Mrtin Mundhenk 2 The formul evlution problem k the model checking problem Given: formul α for the logic L nd model M ccording to the semntics of L Decide: does M stisfy
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 informationReasoning and programming. Lecture 5: Invariants and Logic. Boolean expressions. Reasoning. Examples
Chir of Softwre Engineering Resoning nd progrmming Einführung in die Progrmmierung Introduction to Progrmming Prof. Dr. Bertrnd Meyer Octoer 2006 Ferury 2007 Lecture 5: Invrints nd Logic Logic is the sis
More informationDeciding Hyperproperties
ne.jpeg Deciding Hyperproperties Bernd Finkeiner nd Christopher Hhn Rective Systems Group Srlnd University, Germny Highlights of Logic, Gmes nd Automt Brussels, 06.-09. Septemer 2016 0 Informti Lekge Hertleed
More informationBoolean algebra.
http://en.wikipedi.org/wiki/elementry_boolen_lger Boolen lger www.tudorgir.com Computer science is not out computers, it is out computtion nd informtion. computtion informtion computer informtion Turing
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 informationLinear Inequalities. Work Sheet 1
Work Sheet 1 Liner Inequlities Rent--Hep, cr rentl compny,chrges $ 15 per week plus $ 0.0 per mile to rent one of their crs. Suppose you re limited y how much money you cn spend for the week : You cn spend
More informationFirst Midterm Examination
Çnky University Deprtment of Computer Engineering 203-204 Fll Semester First Midterm Exmintion ) Design DFA for ll strings over the lphet Σ = {,, c} in which there is no, no nd no cc. 2) Wht lnguge does
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 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 informationSection 6.1 Definite Integral
Section 6.1 Definite Integrl Suppose we wnt to find the re of region tht is not so nicely shped. For exmple, consider the function shown elow. The re elow the curve nd ove the x xis cnnot e determined
More informationSuppose we want to find the area under the parabola and above the x axis, between the lines x = 2 and x = -2.
Mth 43 Section 6. Section 6.: Definite Integrl Suppose we wnt to find the re of region tht is not so nicely shped. For exmple, consider the function shown elow. The re elow the curve nd ove the x xis cnnot
More informationImproper Integrals. The First Fundamental Theorem of Calculus, as we ve discussed in class, goes as follows:
Improper Integrls The First Fundmentl Theorem of Clculus, s we ve discussed in clss, goes s follows: If f is continuous on the intervl [, ] nd F is function for which F t = ft, then ftdt = F F. An integrl
More informationCS 330 Formal Methods and Models
CS 330 Forml Methods nd Models Dn Richrds, George Mson University, Spring 2017 Quiz Solutions Quiz 1, Propositionl Logic Dte: Ferury 2 1. Prove ((( p q) q) p) is tutology () (3pts) y truth tle. p q p q
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 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 informationp-adic Egyptian Fractions
p-adic Egyptin Frctions Contents 1 Introduction 1 2 Trditionl Egyptin Frctions nd Greedy Algorithm 2 3 Set-up 3 4 p-greedy Algorithm 5 5 p-egyptin Trditionl 10 6 Conclusion 1 Introduction An Egyptin frction
More informationRevision Sheet. (a) Give a regular expression for each of the following languages:
Theoreticl Computer Science (Bridging Course) Dr. G. D. Tipldi F. Bonirdi Winter Semester 2014/2015 Revision Sheet University of Freiurg Deprtment of Computer Science Question 1 (Finite Automt, 8 + 6 points)
More informationEvaluating Definite Integrals. There are a few properties that you should remember in order to assist you in evaluating definite integrals.
Evluting Definite Integrls There re few properties tht you should rememer in order to ssist you in evluting definite integrls. f x dx= ; where k is ny rel constnt k f x dx= k f x dx ± = ± f x g x dx f
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 informationGrammar. Languages. Content 5/10/16. Automata and Languages. Regular Languages. Regular Languages
5//6 Grmmr Automt nd Lnguges Regulr Grmmr Context-free Grmmr Context-sensitive Grmmr Prof. Mohmed Hmd Softwre Engineering L. The University of Aizu Jpn Regulr Lnguges Context Free Lnguges Context Sensitive
More informationKNOWLEDGE-BASED AGENTS INFERENCE
AGENTS THAT REASON LOGICALLY KNOWLEDGE-BASED AGENTS Two components: knowledge bse, nd n inference engine. Declrtive pproch to building n gent. We tell it wht it needs to know, nd It cn sk itself wht to
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 informationBoolean Algebra. Boolean Algebra
Boolen Alger Boolen Alger A Boolen lger is set B of vlues together with: - two inry opertions, commonly denoted y + nd, - unry opertion, usully denoted y ˉ or ~ or, - two elements usully clled zero nd
More informationState Minimization for DFAs
Stte Minimiztion for DFAs Red K & S 2.7 Do Homework 10. Consider: Stte Minimiztion 4 5 Is this miniml mchine? Step (1): Get rid of unrechle sttes. Stte Minimiztion 6, Stte is unrechle. Step (2): Get rid
More informationParse trees, ambiguity, and Chomsky normal form
Prse trees, miguity, nd Chomsky norml form In this lecture we will discuss few importnt notions connected with contextfree grmmrs, including prse trees, miguity, nd specil form for context-free grmmrs
More informationFirst Midterm Examination
24-25 Fll Semester First Midterm Exmintion ) Give the stte digrm of DFA tht recognizes the lnguge A over lphet Σ = {, } where A = {w w contins or } 2) The following DFA recognizes the lnguge B over lphet
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 informationRegular expressions, Finite Automata, transition graphs are all the same!!
CSI 3104 /Winter 2011: Introduction to Forml Lnguges Chpter 7: Kleene s Theorem Chpter 7: Kleene s Theorem Regulr expressions, Finite Automt, trnsition grphs re ll the sme!! Dr. Neji Zgui CSI3104-W11 1
More informationset is not closed under matrix [ multiplication, ] and does not form a group.
Prolem 2.3: Which of the following collections of 2 2 mtrices with rel entries form groups under [ mtrix ] multipliction? i) Those of the form for which c d 2 Answer: The set of such mtrices is not closed
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 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 informationHennessy-Milner Logic 1.
Hennessy-Milner Logic 1. Colloquium in honor of Robin Milner. Crlos Olrte. Pontifici Universidd Jverin 28 April 2010. 1 Bsed on the tlks: [1,2,3] Prof. Robin Milner (R.I.P). LIX, Ecole Polytechnique. Motivtion
More informationModal Team Logic. Leibniz Universität Hannover Fakultät für Elektrotechnik und Informatik Institut für Theoretische Informatik.
Leibniz Universität Hannover Fakultät für Elektrotechnik und Informatik Institut für Theoretische Informatik Masterarbeit Modal Team Logic Julian-Steffen Müller August 24, 2011 Contents 1 Introduction
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 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 informationVectors , (0,0). 5. A vector is commonly denoted by putting an arrow above its symbol, as in the picture above. Here are some 3-dimensional vectors:
Vectors 1-23-2018 I ll look t vectors from n lgeric point of view nd geometric point of view. Algericlly, vector is n ordered list of (usully) rel numers. Here re some 2-dimensionl vectors: (2, 3), ( )
More informationComputing with finite semigroups: part I
Computing with finite semigroups: prt I J. D. Mitchell School of Mthemtics nd Sttistics, University of St Andrews Novemer 20th, 2015 J. D. Mitchell (St Andrews) Novemer 20th, 2015 1 / 34 Wht is this tlk
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 informationDesigning Information Devices and Systems I Discussion 8B
Lst Updted: 2018-10-17 19:40 1 EECS 16A Fll 2018 Designing Informtion Devices nd Systems I Discussion 8B 1. Why Bother With Thévenin Anywy? () Find Thévenin eqiuvlent for the circuit shown elow. 2kΩ 5V
More informationSection: Other Models of Turing Machines. Definition: Two automata are equivalent if they accept the same language.
Section: Other Models of Turing Mchines Definition: Two utomt re equivlent if they ccept the sme lnguge. Turing Mchines with Sty Option Modify δ, Theorem Clss of stndrd TM s is equivlent to clss of TM
More informationLecture 2: January 27
CS 684: Algorithmic Gme Theory Spring 217 Lecturer: Év Trdos Lecture 2: Jnury 27 Scrie: Alert Julius Liu 2.1 Logistics Scrie notes must e sumitted within 24 hours of the corresponding lecture for full
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 informationThe area under the graph of f and above the x-axis between a and b is denoted by. f(x) dx. π O
1 Section 5. The Definite Integrl Suppose tht function f is continuous nd positive over n intervl [, ]. y = f(x) x The re under the grph of f nd ove the x-xis etween nd is denoted y f(x) dx nd clled the
More informationThe University of Nottingham SCHOOL OF COMPUTER SCIENCE A LEVEL 2 MODULE, SPRING SEMESTER LANGUAGES AND COMPUTATION ANSWERS
The University of Nottinghm SCHOOL OF COMPUTER SCIENCE LEVEL 2 MODULE, SPRING SEMESTER 2016 2017 LNGUGES ND COMPUTTION NSWERS Time llowed TWO hours Cndidtes my complete the front cover of their nswer ook
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 informationCOMPOSITIONALITY AND REACHABILITY WITH CONDITIONS ON PATH LENGTHS
compositionlity Interntionl Journl of Foundtions of Computer Science c World Scientific Pulishing Compny COMPOSITIONALITY AND REACHABILITY WITH CONDITIONS ON PATH LENGTHS INGO FELSCHER Lehrstuhl Informtik
More informationCHAPTER 1 PROGRAM OF MATRICES
CHPTER PROGRM OF MTRICES -- INTRODUCTION definition of engineering is the science y which the properties of mtter nd sources of energy in nture re mde useful to mn. Thus n engineer will hve to study the
More informationSCHOOL OF ENGINEERING & BUILT ENVIRONMENT
SCHOOL OF ENGINEERING & BUIL ENVIRONMEN MARICES FOR ENGINEERING Dr Clum Mcdonld Contents Introduction Definitions Wht is mtri? Rows nd columns of mtri Order of mtri Element of mtri Equlity of mtrices Opertions
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 information80 CHAPTER 2. DFA S, NFA S, REGULAR LANGUAGES. 2.6 Finite State Automata With Output: Transducers
80 CHAPTER 2. DFA S, NFA S, REGULAR LANGUAGES 2.6 Finite Stte Automt With Output: Trnsducers So fr, we hve only considered utomt tht recognize lnguges, i.e., utomt tht do not produce ny output on ny input
More informationCS 311 Homework 3 due 16:30, Thursday, 14 th October 2010
CS 311 Homework 3 due 16:30, Thursdy, 14 th Octoer 2010 Homework must e sumitted on pper, in clss. Question 1. [15 pts.; 5 pts. ech] Drw stte digrms for NFAs recognizing the following lnguges:. L = {w
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 informationNenofex: Expanding NNF for QBF Solving
Institute for Forml Models nd Verifiction (FMV) Johnnes Kepler University, Linz, Austri Nenofex Negtion Norml Form Expnsion Solver for Quntified Boolen Formule (QBF) propositionl formul + quntified vribles
More information5. (±±) Λ = fw j w is string of even lengthg [ 00 = f11,00g 7. (11 [ 00)± Λ = fw j w egins with either 11 or 00g 8. (0 [ ffl)1 Λ = 01 Λ [ 1 Λ 9.
Regulr Expressions, Pumping Lemm, Right Liner Grmmrs Ling 106 Mrch 25, 2002 1 Regulr Expressions A regulr expression descries or genertes lnguge: it is kind of shorthnd for listing the memers of lnguge.
More informationCS415 Compilers. Lexical Analysis and. These slides are based on slides copyrighted by Keith Cooper, Ken Kennedy & Linda Torczon at Rice University
CS415 Compilers Lexicl Anlysis nd These slides re sed on slides copyrighted y Keith Cooper, Ken Kennedy & Lind Torczon t Rice University First Progrmming Project Instruction Scheduling Project hs een posted
More informationCS103 Handout 32 Fall 2016 November 11, 2016 Problem Set 7
CS103 Hndout 32 Fll 2016 Novemer 11, 2016 Prolem Set 7 Wht cn you do with regulr expressions? Wht re the limits of regulr lnguges? On this prolem set, you'll find out! As lwys, plese feel free to drop
More informationFachgebiet Rechnersysteme1. 1. Boolean Algebra. 1. Boolean Algebra. Verification Technology. Content. 1.1 Boolean algebra basics (recap)
. Boolen Alger Fchgeiet Rechnersysteme. Boolen Alger Veriiction Technology Content. Boolen lger sics (recp).2 Resoning out Boolen expressions . Boolen Alger 2 The prolem o logic veriiction: Show tht two
More informationHomework 4. 0 ε 0. (00) ε 0 ε 0 (00) (11) CS 341: Foundations of Computer Science II Prof. Marvin Nakayama
CS 341: Foundtions of Computer Science II Prof. Mrvin Nkym Homework 4 1. UsetheproceduredescriedinLemm1.55toconverttheregulrexpression(((00) (11)) 01) into n NFA. Answer: 0 0 1 1 00 0 0 11 1 1 01 0 1 (00)
More 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 informationLecture 2 : Propositions DRAFT
CS/Mth 240: Introduction to Discrete Mthemtics 1/20/2010 Lecture 2 : Propositions Instructor: Dieter vn Melkeeek Scrie: Dlior Zelený DRAFT Lst time we nlyzed vrious mze solving lgorithms in order to illustrte
More informationRegular Language. Nonregular Languages The Pumping Lemma. The pumping lemma. Regular Language. The pumping lemma. Infinitely long words 3/17/15
Regulr Lnguge Nonregulr Lnguges The Pumping Lemm Models of Comput=on Chpter 10 Recll, tht ny lnguge tht cn e descried y regulr expression is clled regulr lnguge In this lecture we will prove tht not ll
More informationLearning Goals. Relational Query Languages. Formal Relational Query Languages. Formal Query Languages: Relational Algebra and Relational Calculus
Forml Query Lnguges: Reltionl Alger nd Reltionl Clculus Chpter 4 Lerning Gols Given dtse ( set of tles ) you will e le to express dtse query in Reltionl Alger (RA), involving the sic opertors (selection,
More information1. Extend QR downwards to meet the x-axis at U(6, 0). y
In the digrm, two stright lines re to be drwn through so tht the lines divide the figure OPQRST into pieces of equl re Find the sum of the slopes of the lines R(6, ) S(, ) T(, 0) Determine ll liner functions
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 informationBayesian Networks: Approximate Inference
pproches to inference yesin Networks: pproximte Inference xct inference Vrillimintion Join tree lgorithm pproximte inference Simplify the structure of the network to mkxct inferencfficient (vritionl methods,
More informationɛ-closure, Kleene s Theorem,
DEGefW5wiGH2XgYMEzUKjEmtCDUsRQ4d 1 A nice pper relevnt to this course is titled The Glory of the Pst 2 NICTA Resercher, Adjunct t the Austrlin Ntionl University nd Griffith University ɛ-closure, Kleene
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 information20 MATHEMATICS POLYNOMIALS
0 MATHEMATICS POLYNOMIALS.1 Introduction In Clss IX, you hve studied polynomils in one vrible nd their degrees. Recll tht if p(x) is polynomil in x, the highest power of x in p(x) is clled the degree of
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 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 informationExercises with (Some) Solutions
Exercises with (Some) Solutions Techer: Luc Tesei Mster of Science in Computer Science - University of Cmerino Contents 1 Strong Bisimultion nd HML 2 2 Wek Bisimultion 31 3 Complete Lttices nd Fix Points
More informationModel Reduction of Finite State Machines by Contraction
Model Reduction of Finite Stte Mchines y Contrction Alessndro Giu Dip. di Ingegneri Elettric ed Elettronic, Università di Cgliri, Pizz d Armi, 09123 Cgliri, Itly Phone: +39-070-675-5892 Fx: +39-070-675-5900
More informationGenetic Programming. Outline. Evolutionary Strategies. Evolutionary strategies Genetic programming Summary
Outline Genetic Progrmming Evolutionry strtegies Genetic progrmming Summry Bsed on the mteril provided y Professor Michel Negnevitsky Evolutionry Strtegies An pproch simulting nturl evolution ws proposed
More informationEhrenfeucht-Fraïssé Games: Applications and Complexity. Department of Mathematics and Computer Science University of Udine, Italy ESSLLI 2010 CPH
Ehrenfeucht-Frïssé Gmes: Applictions nd Complexity Angelo Montnri Nicol Vitcolonn Deprtment of Mthemtics nd Computer Science University of Udine, Itly ESSLLI 2010 CPH Outline Introduction to EF-gmes Inexpressivity
More informationThe Minimum Label Spanning Tree Problem: Illustrating the Utility of Genetic Algorithms
The Minimum Lel Spnning Tree Prolem: Illustrting the Utility of Genetic Algorithms Yupei Xiong, Univ. of Mrylnd Bruce Golden, Univ. of Mrylnd Edwrd Wsil, Americn Univ. Presented t BAE Systems Distinguished
More informationRegular Expressions (RE) Regular Expressions (RE) Regular Expressions (RE) Regular Expressions (RE) Kleene-*
Regulr Expressions (RE) Regulr Expressions (RE) Empty set F A RE denotes the empty set Opertion Nottion Lnguge UNIX Empty string A RE denotes the set {} Alterntion R +r L(r ) L(r ) r r Symol Alterntion
More informationSignal Flow Graphs. Consider a complex 3-port microwave network, constructed of 5 simpler microwave devices:
3/3/009 ignl Flow Grphs / ignl Flow Grphs Consider comple 3-port microwve network, constructed of 5 simpler microwve devices: 3 4 5 where n is the scttering mtri of ech device, nd is the overll scttering
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 informationFormal languages, automata, and theory of computation
Mälrdlen University TEN1 DVA337 2015 School of Innovtion, Design nd Engineering Forml lnguges, utomt, nd theory of computtion Thursdy, Novemer 5, 14:10-18:30 Techer: Dniel Hedin, phone 021-107052 The exm
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 informationExam 2, Mathematics 4701, Section ETY6 6:05 pm 7:40 pm, March 31, 2016, IH-1105 Instructor: Attila Máté 1
Exm, Mthemtics 471, Section ETY6 6:5 pm 7:4 pm, Mrch 1, 16, IH-115 Instructor: Attil Máté 1 17 copies 1. ) Stte the usul sufficient condition for the fixed-point itertion to converge when solving the eqution
More informationDesigning Information Devices and Systems I Fall 2016 Babak Ayazifar, Vladimir Stojanovic Homework 6. This homework is due October 11, 2016, at Noon.
EECS 16A Designing Informtion Devices nd Systems I Fll 2016 Bk Ayzifr, Vldimir Stojnovic Homework 6 This homework is due Octoer 11, 2016, t Noon. 1. Homework process nd study group Who else did you work
More informationSection 4: Integration ECO4112F 2011
Reding: Ching Chpter Section : Integrtion ECOF Note: These notes do not fully cover the mteril in Ching, ut re ment to supplement your reding in Ching. Thus fr the optimistion you hve covered hs een sttic
More informationCS 310 (sec 20) - Winter Final Exam (solutions) SOLUTIONS
CS 310 (sec 20) - Winter 2003 - Finl Exm (solutions) SOLUTIONS 1. (Logic) Use truth tles to prove the following logicl equivlences: () p q (p p) (q q) () p q (p q) (p q) () p q p q p p q q (q q) (p p)
More informationApplied Automata Theory
Applied Automt Theory Prof. Dr. Wolfgng Thoms RWTH Achen Course Notes compiled y Thierry Ccht Kosts Ppdimitropoulos Mrkus Schlütter Stefn Wöhrle Novemer 2, 2005 2 i Note These notes re sed on the courses
More informationCSE396 Prelim I Answer Key Spring 2017
Nme nd St.ID#: CSE96 Prelim I Answer Key Spring 2017 (1) (24 pts.) Define A to e the lnguge of strings x {, } such tht x either egins with or ends with, ut not oth. Design DFA M such tht L(M) = A. A node-rc
More informationOverview of Today s Lecture:
CPS 4 Computer Orgniztion nd Progrmming Lecture : Boolen Alger & gtes. Roert Wgner CPS4 BA. RW Fll 2 Overview of Tody s Lecture: Truth tles, Boolen functions, Gtes nd Circuits Krnugh mps for simplifying
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 informationSurface maps into free groups
Surfce mps into free groups lden Wlker Novemer 10, 2014 Free groups wedge X of two circles: Set F = π 1 (X ) =,. We write cpitl letters for inverse, so = 1. e.g. () 1 = Commuttors Let x nd y e loops. The
More informationSeptember 13 Homework Solutions
College of Engineering nd Computer Science Mechnicl Engineering Deprtment Mechnicl Engineering 5A Seminr in Engineering Anlysis Fll Ticket: 5966 Instructor: Lrry Cretto Septemer Homework Solutions. Are
More informationMAT137 Calculus! Lecture 27
MAT37 Clculus! Lecture 7 Tody: More out Integrls (Rest of the Videos) Antiderivtives Next: Fundmentl Theorem of Clculus NEW office hours: T & R @ BA 4 officil wesite http://uoft.me/mat37 Betriz Nvrro-Lmed
More informationThe Regulated and Riemann Integrals
Chpter 1 The Regulted nd Riemnn Integrls 1.1 Introduction We will consider severl different pproches to defining the definite integrl f(x) dx of function f(x). These definitions will ll ssign the sme vlue
More informationu(t)dt + i a f(t)dt f(t) dt b f(t) dt (2) With this preliminary step in place, we are ready to define integration on a general curve in C.
Lecture 4 Complex Integrtion MATH-GA 2451.001 Complex Vriles 1 Construction 1.1 Integrting complex function over curve in C A nturl wy to construct the integrl of complex function over curve in the complex
More informationDesigning Information Devices and Systems I Spring 2018 Homework 7
EECS 16A Designing Informtion Devices nd Systems I Spring 2018 omework 7 This homework is due Mrch 12, 2018, t 23:59. Self-grdes re due Mrch 15, 2018, t 23:59. Sumission Formt Your homework sumission should
More informationDefinite Integrals. The area under a curve can be approximated by adding up the areas of rectangles = 1 1 +
Definite Integrls --5 The re under curve cn e pproximted y dding up the res of rectngles. Exmple. Approximte the re under y = from x = to x = using equl suintervls nd + x evluting the function t the left-hnd
More informationReasoning with Bayesian Networks
Complexity of Probbilistic Inference Compiling Byesin Networks Resoning with Byesin Networks Lecture 5: Complexity of Probbilistic Inference, Compiling Byesin Networks Jinbo Hung NICTA nd ANU Jinbo Hung
More informationIST 4 Information and Logic
IST 4 Informtion nd Logic T = tody x= hw#x out x= hw#x due mon tue wed thr fri 31 M1 1 7 oh M1 14 oh 1 oh 2M2 21 oh oh 2 oh Mx= MQx out Mx= MQx due 28 oh M2 oh oh = office hours 5 3 12 oh 3 T 4 oh oh 19
More informationNetwork Analysis and Synthesis. Chapter 5 Two port networks
Network Anlsis nd Snthesis hpter 5 Two port networks . ntroduction A one port network is completel specified when the voltge current reltionship t the terminls of the port is given. A generl two port on
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 information