we could choose to work with the following symbols for natural numbers: Syntax: zero,one,two,...,twentyseven,...
|
|
- Angela Matthews
- 6 years ago
- Views:
Transcription
1 main Snoncontent Sdcpreview Scontent Content Real- Systems Lecture 3: Duration Calculus I Dr. Bernd Westphal Albert-Ludwigs-Universität Freiburg, Germany Symbols predicate and function symbols state variables and domain values global (or logical) variables State Assertions Terms rigid terms intervals remarks 4/ main main Content Introduction Observables and Evolutions Duration Calculus (DC) Semantical Correctness Proofs DC Decidability DC Implementables PLC-Automata d Automata (TA), Uppaal Networks of d Automata Region/Zone-Abstraction TA model-checking Extended d Automata Undecidability Results obs : D(obs) hobs, i,t hobs, i,t... Automatic Verification......whether a TA satisfies a DC formula, observer-based Recent Results: d Sequence Diagrams, or Quasi-equal Clocks, or Automatic Code Generation, or... Duration Calculus: Syntax Overview 23/49 2/39 5/ Sdcoverview main Duration Calculus: Preview gas valve ame sensor Duration Calculus is an interval logic. Formulae are evaluated in an (implicitly given) interval. ignition Strangest operators: almost everywhere Example: G (Holds in a given interval[b,e] iff the gas valve is open almost everywhere.) G,F,I,H :,} DefineL :,} asg F. chop Example: ( I ; I ; I ) = (Ignition phases last at least one time unit.) integral Example: 6 = L 2 (At most 5% leakage time within intervals of at least 6 time units.) Duration Calculus: Overview We will introduce four syntactical categories (and abbreviations): (i) Symbols: }} (ii) State Assertions: P ::= X = d P P P2 (iii) Terms: θ ::= x l P f(θ,...,θn) (iv) Formulae: F ::= p(θ,...,θn) F F F2 x F F ;F2 (v) Abbreviations:, P, P t, P t, F, F 27/3 3/39 6/39
2 Sdcsymb main Duration Calculus: Symbols Same Game: Function Symbols true,false,=,<,>,,, f,g, X,Y,Z, d, x,y,z, We assume a set of function symbols to be given, typical elementsf,g. Each function symbolf has an arityn N; shorthand notation: f/n. A functionsymbolf/n is called a constant if and only ifn =. In the following, we assume the following function symbols: constants: i/ for eachi N, binary (i.e.n = 2): +,. The semantics of an n-ary function symbol f is a function from R n to R, denoted ˆf, i.e. ˆf : R n R. For constants (arityn = ) we have ˆf R. Examples: ˆ = R, 27 ˆ = 27 R, ˆ+ : R R R, ˆ+(a,b) = a+b, ˆ+(,2) = 3. /39 Semantics Syntax 7/ Sdcsymb Sdcsymb Symbols: Predicate Symbols }} true,false,=,<,>,,, f,g, X,Y,Z, d, x,y,z, We assume a set of predicate symbols to be given, typical elements. Each predicate symbolp has an arityn N; shorthand notation: p/n. A predicatesymbolp/n is called a constant if and only ifn =. In the following, we assume the following predicate symbols: constants: true,false. binary (i.e.n = 2): =, <, >,,. Semantical domains: truth values B = tt,ff}, and real numbers R. The semantics of an n-ary predicate symbol p is a function from R n to B, denoted ˆp, i.e. ˆp : R n B. For constants (arityn = ) we have ˆp B. Examples: true ˆ = tt, false ˆ = ff, ˆ= : R R B, ˆ=(a,b) = tt, iffa = b, ˆ=(a,b) = ff, iffa b. ˆ=(3,7) = ff, ˆ=(2,2) = tt. One More To better distinguish syntax from semantics, we could choose to work with the following symbols for natural numbers: Syntax: zero,one,two,...,twentyseven,... (all with arity) Semantics: zero ˆ = R, one ˆ = R, two ˆ = 2 R,..., ˆ twentyseven = 27 R,... /39 8/39 Semantics Syntax Sdcsymb Sdcsymb Once Again: Syntax vs. Semantics Predicate symbols are principally freely chosen, we could also consider the following ones: / /3 geq/2 To semantically work with a predicate symbol, we need to define a meaning. One possible choice: ˆ : R B tt, ifa N and digit sum ofa equals27 ˆ (a) = ff, otherwise ˆ : R R R B tt, ifax ˆ (a,b,c) 2 +bx+c = has at least one solution = ff, otherwise ˆ geq : R R B geq(a,b) ˆ = tt, ifa b ff, otherwise One More To better distinguish syntax from semantics, we could choose to work with the following symbols for natural numbers: Syntax:,,2,...,27,... (all with arity) Semantics: ˆ = R, ˆ = R, ˆ2 = 2 R,..., 27 ˆ = 27 R,... 9/39 2/39
3 H G I F t Sdcsymb Sdcsymb Symbols: State Variables and Domain Values true,false,=,<,>,,, f,g, X,Y,Z, d, x,y,z, We assume a set Obs of state variables or observables, typical elements X,Y,Z. Each statevariable X has a finite (semantical) domaind(x) = d,...,dn}. A state variable with domain,} is called boolean observable. For each domaind,...,dn} of a state variable in Obs we assume symbolsd,...,dn with ˆdi = di, i n. Example: state variable F ( flame sensor ), domain D(F) =,}, symbols,withˆ = N,ˆ = N. state variable T ( traffic D(T) = symbols red, green with with red D(T), = green D(T). lights ), domain red,green}, red ˆ = green ˆ Example: Evolutions vs. Interpretation of State Variables π : obs = H,obs2 = G,obs3 = I,obs3 = F π(t) = (,,,), I(H)(t) = HI(t) = π(t) =, I(I)(t) = II(t) = π(t) 3 =, I : Obs ( D): H G I F 3/39 6/ Sdcsymb Sdcsymb Interpretation of State Variables The last semantical domain we consider is the set of points in time, mostly, = R + (continuous / dense), sometimes = N (discrete time). The semantics of a state variable is time-dependent. It is given by an interpretationi, i.e. a mapping I : Obs ( D), D = D(X), X Obs assigning to each state variablex Obs a function I(X) : D(X) such thati(x)(t) D(X) denotes the value thatx has at timet. For convenience, we shall abbreviate I(X) to XI. Predicate / Function Symbols vs. State Variables Note: The choice of function and predicate symbols introduced earlier, i.e. true,false,=,<,>,,,,,..., +, and their semantics, i.e. ˆ true is the truth valuett B, ˆ= : R 2 B is the equality relation on real numbers, ˆ is the (real) number zero from R, ˆ+ : R 2 R is the addition function on real numbers, is fixed throughout the lecture. The choice of observables and their domains depends on the system we want to describe. 4/39 7/ Sdcsymb Sdcsymb Evolutions over vs. Interpretation of State Variables Let Obs = obs,...,obsn} be a set of state variables. Evolution (over time) of Obs: π : D(obs) D(obsn). Interpretation ofobs: I : Obs ( D). Both,π andi, represent the same timed behaviour if, for allt, I(obsi)(t) = π(t) i, i n, or π(t) = (I(obs)(t),...,I(obsn)(t)) = (obsi(t),...,obsni(t)). Symbols: Global Variables true,false,=,<,>,,, f,g, X,Y,Z, d, x,y,z, We assume a set GVar of global (or logical) variables, typical elements x,y,z. The semantics of a global variable is given by a valuation, i.e. a mapping V : GVar R assigning to each global variablex GVar a real numberv(x) R. We useval to denote the set of all valuations, i.e.val = (GVar R). Global variables are fixed over time in system evolutions. 5/39 8/39
4 Sdcstass Sdcsymb Symbols: Overview Syntax Semantics predicate symbols true,false,=,<,>,, ˆ true = tt B, ˆ= : R 2 B function symbols f/n,g ˆf : R n R state variables X,Y,Z I(X) : D(X) domain values d ˆd D(X) global variables x,y,z V(x) R State Assertions: Syntax The set of state assertions is defined by the following grammar: P ::= X = d P P P2 where X Obs is a state variable, d denotes a value fromx s domain, We shall use P,Q,R to denote state assertions. Here,,, =,, and are like keywords (or terminal symbols) in programming languages. Abbreviations: We shall writex instead ofx = ifx is boolean, i.e. ifd(x) =,}, Assume the usual precedence: binds stronger than Define, =, as usual. 9/39 22/ Sdcstass main Duration Calculus: State Assertions State Assertions: Examples P ::= X = d P P P2 Observables F,G, D(F) =,}, D(G) =,,2}. F = F (F = ) F G G = 2, F = 2 F = G F = G = F = G = (F = G = ), ( F) = G =, ( F = ) G = 2/39 23/ Sdcstass Sdcoverview Duration Calculus: Overview We will introduce four syntactical categories (and abbreviations): (i) Symbols: }} (ii) State Assertions: P ::= X = d P P P2 (iii) Terms: θ ::= x l P f(θ,...,θn) (iv) Formulae: F ::= p(θ,...,θn) F F F2 x F F ;F2 (v) Abbreviations:, P, P t, P t, F, F State Assertions: Semantics The semantics of state assertion P is a function I P :,}, i.e.,i P (t) denotes the truth value ofp at timet. The valuei P (t) is defined inductively over the structure ofp : I (t) =, I (t) =,, ifxi = d I X = d (t) =, otherwise, I P (t) = I P (t), ifi P (t) = I P2 (t) = I P P2 (t) =, otherwise, 2/39 24/39
5 Sdcoverview Sdcstass State Assertions: Notes If X is a boolean observer. the following equalities hold: I X (t) = I X = (t) = I(X)(t) = XI(t). I P is also called interpretation ofp. We shall writepi as a shorthand notation. Here, the state assertionsandare treated like boolean values (likett andff), it will become clear in a minute, why,is a better choice thantt andff. Duration Calculus: Overview We will introduce four syntactical categories (and abbreviations): (i) Symbols: }} (ii) State Assertions: P ::= X = d P P P2 (iii) Terms: θ ::= x l P f(θ,...,θn) (iv) Formulae: F ::= p(θ,...,θn) F F F2 x F F ;F2 (v) Abbreviations:, P, P t, P t, F, F 25/39 28/ Sdcterm Sdcstass State Assertions: Example Interpretation I of boolean observables G and F : GI FI Consider state assertionl := G F. LI(.2) =, because LI(2) =, because Interpretation of L as timing diagram: LI Terms: Syntax Duration terms (or DC terms, or just terms) are defined by the following grammar: θ ::= x l P f(θ,...,θn) where x is a global variable fromgvar, P is a state assertion, and f a function symbol (of arityn). l and are like keywords (or terminal symbols) in programming languages. l is called length operator, is called integral operator. Notation: we may write function symbols in infix notation as usual, i.e. we may writeθ +θ2 instead of+(θ,θ2). 26/39 29/ Sdcterm main Duration Calculus: Terms Terms: Syntax Duration terms (or DC terms, or just terms) are defined by the following grammar: θ ::= x l P f(θ,...,θn) where x is a global variable fromgvar, P is a state assertion, and f a function symbol (of arityn). l and are like keywords (or terminal symbols) in programming languages. l is called length operator, is called integral operator. Notation: we may write function symbols in infix notation as usual, i.e. we may writeθ +θ2 instead of+(θ,θ2). Definition. [Rigid] A term without length and integral operators is called rigid. 27/39 29/39
6 Sdcterm Sdcterm Towards Semantics of Terms: Intervals Letb,e be points in time s.t.b e. Then[b,e] denotes the closed intervalx b x e}. We use Intv to denote the set of closed intervals in the time domain, i.e. Intv := [b,e] b,e }. Closed intervals of the form[b,b] are called point intervals. Terms: Is the Semantics Well-defined? e So,I P (V,[b,e]) is PI(t)dt but does the integral always exist? b IOW: is there a PI which is not (Riemann-)integrable? Yes. For instance, ift Q PI(t) =, ift / Q To exclude such functions, DC considers only interpretations I satisfying the following condition of finite variability: For each state variablex and each interval[b,e] there is a finite partition of[b,e] such that the interpretation XI is constant on each part. Thus a functionxi is of finite variability if and only if, on each interval[b,e], the function XI has only finitely many points of discontinuity. 3/39 33/ Sdcterm Sdcterm Terms: Semantics The semantics of a termθ is a function I θ : Val Intv R, that is,i θ maps a pair consisting of a valuation and an interval to a real number. I θ (V,[b,e]) is called the value (or interpretation) ofθ under interpretationi and valuationv in the interval[b,e]. The valuei θ (V,[b,e]) is defined inductively over the structure ofθ: I x (V,[b,e]) = V(x), I l (V,[b,e]) = e b, e I P (V,[b,e]) = PI(t)dt, b I f(θ,...,θn) (V,[b,e]) = ˆf(I θ (V,[b,e]),...,I θn (V,[b,e])), Terms: Remarks Remark 2.5. The semanticsi θ of a term is insensitive against changes of the interpretation I at individual time points. More formally: LetI,I2 be interpretations ofobs such thati(x)(t) = I2(X)(t) for allx Obs and allt \t,...,tn}. ThenI θ (V,[b,e]) = I2 θ (V,[b,e]) for all termsθ and intervals[b,e]. Remark 2.6. The semanticsi θ (V,[b,e]) of a rigid term does not depend on the interval[b,e]. 3/39 34/ Sdcterm Sdcterm Terms: Example V(x) = 2. LI Consider the termθ = x L. I θ (V,[.5,3.25])= I (x, L) (V,[.5,3.25]) =ˆ ( I x (V,[.5,3.25]), I L (V,[.5,3.25]) ) =ˆ ( V(x), I L (V,[.5,3.25]) ) =ˆ ( 2, I L (V,[.5,3.25]) ) ( 3.25 ) =ˆ 2, LI(t)dt =ˆ ( 2,.25 )= 2.25= 25.5 I θ (V,[.5,.5]) = Syntax / Semantics Overview Syntax Semantics predicate symbols true,false,=,<,>,, ˆ true = tt B, ˆ= : R 2 B function symbols f/n,g ˆf : R n R state variables X,Y,Z I(X) : D(X) domain values d ˆd D(X) global variables x,y,z V(x) R state assertions P I P :,} I P (t),} terms θ I θ : Val Intv R I θ (V,[b,e]) R 32/39 35/39
7 main Scontent Content Symbols predicate and function symbols state variables and domain values global (or logical) variables State Assertions Terms rigid terms intervals remarks References Olderog, E.-R. and Dierks, H. (28). Real- Systems - Formal Specification and Automatic Verification. Cambridge University Press. 36/39 39/ Sttwytt Tell Them What You ve Told Them... State assertions over state variables (or observables), and predicate symbols are evaluated at points in time. The semantics of a state assertion is a truth value. Terms are evaluated over intervals and can measure the accumulated duration of a state assertion, measure the length of intervals, and use function symbols. The semantics of a term is a real number. The value of rigid terms is independent from the considered interval. The semantics of terms is insensitive against changes at finitely many points in time. 37/ main References 38/39
Lecture 3: Duration Calculus I
Real-Time Systems Lecture 3: Duration Calculus I 27--26 Dr. Bernd Westphal Albert-Ludwigs-Universität Freiburg, Germany 3 27--26 main Content Introduction Observables and Evolutions Duration Calculus (DC)
More informationLecture 03: Duration Calculus I
Real-Time Systems Lecture 03: Duration Calculus I 2014-05-08 Dr. Bernd Westphal 03 2014-05-08 main Albert-Ludwigs-Universität Freiburg, Germany Contents & Goals Last Lecture: Model of timed behaviour:
More informationLecture 05: Duration Calculus III
Real-Time Systems Lecture 05: Duration Calculus III 2014-05-20 Dr. Bernd Westphal Albert-Ludwigs-Universität Freiburg, Germany Contents & Goals Last Lecture: DC Syntax and Semantics: Formulae This Lecture:
More informationReal-Time Systems. Lecture 10: Timed Automata Dr. Bernd Westphal. Albert-Ludwigs-Universität Freiburg, Germany main
Real-Time Systems Lecture 10: Timed Automata 2013-06-04 10 2013-06-04 main Dr. Bernd Westphal Albert-Ludwigs-Universität Freiburg, Germany Contents & Goals Last Lecture: PLC, PLC automata This Lecture:
More informationLecture 11: Timed Automata
Real-Time Systems Lecture 11: Timed Automata 2014-07-01 11 2014-07-01 main Dr. Bernd Westphal Albert-Ludwigs-Universität Freiburg, Germany Contents & Goals Last Lecture: DC (un)decidability This Lecture:
More informationLecture 9: DC Implementables II
Real-Time Systems Lecture 9: DC Implementables II 2017-11-28 Dr. Bernd Westphal Albert-Ludwigs-Universität Freiburg, Germany 9 2017-11-28 main Content Correctness Proof for the Gas Burner Implementables
More informationReal-Time Systems. Lecture 15: The Universality Problem for TBA Dr. Bernd Westphal. Albert-Ludwigs-Universität Freiburg, Germany
Real-Time Systems Lecture 15: The Universality Problem for TBA 2013-06-26 15 2013-06-26 main Dr. Bernd Westphal Albert-Ludwigs-Universität Freiburg, Germany Contents & Goals Last Lecture: Extended Timed
More informationA Theory of Duration Calculus with Application
A Theory of Duration Calculus with Application Michael R. Hansen 1 and Dang Van Hung 2 1 Informatics and Math. Modelling, Technical University of Denmark Ricard Petersens Plads, DK-2800 Lyngby, Denmark
More informationLecture 10: PLC Automata
Real-ime Systems Lecture 10: PLC Automata 2017-11-30 Dr. Bernd Westphal Dr. Jochen Hoenicke Albert-Ludwigs-Universität Freiburg, Germany 10 2017-11-30 main he Plan Full DC DC Implementables PLC-Automata
More informationDeclarative modelling for timing
Declarative modelling for timing The real-time logic: Duration Calculus Michael R. Hansen mrh@imm.dtu.dk Informatics and Mathematical Modelling Technical University of Denmark 02153 Declarative Modelling,
More informationTHE LANGUAGE OF FIRST-ORDER LOGIC (FOL) Sec2 Sec1(1-16)
THE LANGUAGE OF FIRST-ORDER LOGIC (FOL) Sec2 Sec1(1-16) FOL: A language to formulate knowledge Logic is the study of entailment relationslanguages, truth conditions and rules of inference. FOL or Predicate
More informationDuration Calculus Introduction
Duration Calculus Introduction Michael R. Hansen mrh@imm.dtu.dk Informatics and Mathematical Modelling Technical University of Denmark 02240 Computability and Semantics, Spring 05, c Michael R. Hansen
More informationPROPOSITIONAL LOGIC. VL Logik: WS 2018/19
PROPOSITIONAL LOGIC VL Logik: WS 2018/19 (Version 2018.2) Martina Seidl (martina.seidl@jku.at), Armin Biere (biere@jku.at) Institut für Formale Modelle und Verifikation BOX Game: Rules 1. The game board
More informationPropositional Logic: Syntax
Logic Logic is a tool for formalizing reasoning. There are lots of different logics: probabilistic logic: for reasoning about probability temporal logic: for reasoning about time (and programs) epistemic
More informationFoundations of Artificial Intelligence
Foundations of Artificial Intelligence 7. Propositional Logic Rational Thinking, Logic, Resolution Joschka Boedecker and Wolfram Burgard and Frank Hutter and Bernhard Nebel Albert-Ludwigs-Universität Freiburg
More informationPropositional logic (revision) & semantic entailment. p. 1/34
Propositional logic (revision) & semantic entailment p. 1/34 Reading The background reading for propositional logic is Chapter 1 of Huth/Ryan. (This will cover approximately the first three lectures.)
More informationInf2D 06: Logical Agents: Knowledge Bases and the Wumpus World
Inf2D 06: Logical Agents: Knowledge Bases and the Wumpus World School of Informatics, University of Edinburgh 26/01/18 Slide Credits: Jacques Fleuriot, Michael Rovatsos, Michael Herrmann Outline Knowledge-based
More informationApplied Logic. Lecture 1 - Propositional logic. Marcin Szczuka. Institute of Informatics, The University of Warsaw
Applied Logic Lecture 1 - Propositional logic Marcin Szczuka Institute of Informatics, The University of Warsaw Monographic lecture, Spring semester 2017/2018 Marcin Szczuka (MIMUW) Applied Logic 2018
More informationif t 1,...,t k Terms and P k is a k-ary predicate, then P k (t 1,...,t k ) Formulas (atomic formulas)
FOL Query Evaluation Giuseppe De Giacomo Università di Roma La Sapienza Corso di Seminari di Ingegneria del Software: Data and Service Integration Laurea Specialistica in Ingegneria Informatica Università
More informationPredicate Logic. Xinyu Feng 09/26/2011. University of Science and Technology of China (USTC)
University of Science and Technology of China (USTC) 09/26/2011 Overview Predicate logic over integer expressions: a language of logical assertions, for example x. x + 0 = x Why discuss predicate logic?
More informationThe semantics of propositional logic
The semantics of propositional logic Readings: Sections 1.3 and 1.4 of Huth and Ryan. In this module, we will nail down the formal definition of a logical formula, and describe the semantics of propositional
More informationFoundations of Artificial Intelligence
Foundations of Artificial Intelligence 7. Propositional Logic Rational Thinking, Logic, Resolution Wolfram Burgard, Maren Bennewitz, and Marco Ragni Albert-Ludwigs-Universität Freiburg Contents 1 Agents
More informationFoundations of Artificial Intelligence
Foundations of Artificial Intelligence 7. Propositional Logic Rational Thinking, Logic, Resolution Joschka Boedecker and Wolfram Burgard and Bernhard Nebel Albert-Ludwigs-Universität Freiburg May 17, 2016
More informationNatural Deduction for Propositional Logic
Natural Deduction for Propositional Logic Bow-Yaw Wang Institute of Information Science Academia Sinica, Taiwan September 10, 2018 Bow-Yaw Wang (Academia Sinica) Natural Deduction for Propositional Logic
More informationOutline. Overview. Syntax Semantics. Introduction Hilbert Calculus Natural Deduction. 1 Introduction. 2 Language: Syntax and Semantics
Introduction Arnd Poetzsch-Heffter Software Technology Group Fachbereich Informatik Technische Universität Kaiserslautern Sommersemester 2010 Arnd Poetzsch-Heffter ( Software Technology Group Fachbereich
More informationPropositional Logic: Part II - Syntax & Proofs 0-0
Propositional Logic: Part II - Syntax & Proofs 0-0 Outline Syntax of Propositional Formulas Motivating Proofs Syntactic Entailment and Proofs Proof Rules for Natural Deduction Axioms, theories and theorems
More informationTimed Automata VINO 2011
Timed Automata VINO 2011 VeriDis Group - LORIA July 18, 2011 Content 1 Introduction 2 Timed Automata 3 Networks of timed automata Motivation Formalism for modeling and verification of real-time systems.
More information02917 Advanced Topics in Embedded Systems. Michael R. Ha. Brief Introduction to Duration Calculus. Michael R. Hansen
Brief Introduction to Duration Calculus nsen 1 DTU Informatics, Technical University of Denmark Brief Introduction to Duration Calculus MRH 17/06/2010 Plan for today: A motivating example wireless sensor
More informationWhy Knowledge Representation?
CSE 3401: Intro to AI & LP Knowledge Representation & First-Order Logic Required Readings: R & N Chapter 8 Optional: If you need more background: 7.1-7.3 Motivation for logic, basic introduction to semantics.
More informationA Logic Primer. Stavros Tripakis University of California, Berkeley
EE 144/244: Fundamental Algorithms for System Modeling, Analysis, and Optimization Fall 2015 A Logic Primer Stavros Tripakis University of California, Berkeley Stavros Tripakis (UC Berkeley) EE 144/244,
More informationFirst-Order Logic First-Order Theories. Roopsha Samanta. Partly based on slides by Aaron Bradley and Isil Dillig
First-Order Logic First-Order Theories Roopsha Samanta Partly based on slides by Aaron Bradley and Isil Dillig Roadmap Review: propositional logic Syntax and semantics of first-order logic (FOL) Semantic
More informationPřednáška 12. Důkazové kalkuly Kalkul Hilbertova typu. 11/29/2006 Hilbertův kalkul 1
Přednáška 12 Důkazové kalkuly Kalkul Hilbertova typu 11/29/2006 Hilbertův kalkul 1 Formal systems, Proof calculi A proof calculus (of a theory) is given by: A. a language B. a set of axioms C. a set of
More informationWhy Knowledge Representation? Example. Example. CSE 3401: Intro to AI & LP Knowledge Representation & First-Order Logic
CSE 3401: Intro to AI & LP Knowledge Representation & First-Order Logic Required Readings: Chapter 8 Optional: If you need more background: Why Knowledge Representation? Consider the task of understanding
More informationA Little Logic. Propositional Logic. Satisfiability Problems. Solving Sudokus. First Order Logic. Logic Programming
A Little Logic International Center for Computational Logic Technische Universität Dresden Germany Propositional Logic Satisfiability Problems Solving Sudokus First Order Logic Logic Programming A Little
More informationTheoretical Foundations of the UML
Theoretical Foundations of the UML Lecture 17+18: A Logic for MSCs Joost-Pieter Katoen Lehrstuhl für Informatik 2 Software Modeling and Verification Group moves.rwth-aachen.de/teaching/ws-1718/fuml/ 5.
More informationLecture 4: OCL Semantics
Software Design, Modelling and Analysis in UML Lecture 4: OCL Semantics 2016-11-03 Prof. Dr. Andreas Podelski, Dr. Bernd Westphal Albert-Ludwigs-Universität Freiburg, Germany 4 2016-11-03 main Content
More informationDynamic Semantics. Dynamic Semantics. Operational Semantics Axiomatic Semantics Denotational Semantic. Operational Semantics
Dynamic Semantics Operational Semantics Denotational Semantic Dynamic Semantics Operational Semantics Operational Semantics Describe meaning by executing program on machine Machine can be actual or simulated
More informationCS156: The Calculus of Computation Zohar Manna Winter 2010
Page 3 of 35 Page 4 of 35 quantifiers CS156: The Calculus of Computation Zohar Manna Winter 2010 Chapter 2: First-Order Logic (FOL) existential quantifier x. F [x] there exists an x such that F [x] Note:
More informationPredicate Logic. CSE 595 Semantic Web Instructor: Dr. Paul Fodor Stony Brook University
Predicate Logic CSE 595 Semantic Web Instructor: Dr. Paul Fodor Stony Brook University http://www3.cs.stonybrook.edu/~pfodor/courses/cse595.html 1 The alphabet of predicate logic Variables Constants (identifiers,
More informationCS1021. Why logic? Logic about inference or argument. Start from assumptions or axioms. Make deductions according to rules of reasoning.
3: Logic Why logic? Logic about inference or argument Start from assumptions or axioms Make deductions according to rules of reasoning Logic 3-1 Why logic? (continued) If I don t buy a lottery ticket on
More informationClassical First-Order Logic
Classical First-Order Logic Software Formal Verification Maria João Frade Departmento de Informática Universidade do Minho 2008/2009 Maria João Frade (DI-UM) First-Order Logic (Classical) MFES 2008/09
More informationLogic. proof and truth syntacs and semantics. Peter Antal
Logic proof and truth syntacs and semantics Peter Antal antal@mit.bme.hu 10/9/2015 1 Knowledge-based agents Wumpus world Logic in general Syntacs transformational grammars Semantics Truth, meaning, models
More informationA Logic Primer. Stavros Tripakis University of California, Berkeley. Stavros Tripakis (UC Berkeley) EE 144/244, Fall 2014 A Logic Primer 1 / 35
EE 144/244: Fundamental Algorithms for System Modeling, Analysis, and Optimization Fall 2014 A Logic Primer Stavros Tripakis University of California, Berkeley Stavros Tripakis (UC Berkeley) EE 144/244,
More informationHow do PLC look like? What s special about PLC? What is a PLC? /50 2/50 5/50 6/50 3/ Splc main
http://wikimedia.org (public domain) How do PLC look like? Albert-Ludwigs-Universität Freiburg, Germany Dr. Bernd Westphal 2013-05-29 Lecture 09: PLC Automata Real-ime Systems 4/50 http://wikimedia.org
More informationTimed Automata. Chapter Clocks and clock constraints Clock variables and clock constraints
Chapter 10 Timed Automata In the previous chapter, we have discussed a temporal logic where time was a discrete entities. A time unit was one application of the transition relation of an LTS. We could
More information7. Propositional Logic. Wolfram Burgard and Bernhard Nebel
Foundations of AI 7. Propositional Logic Rational Thinking, Logic, Resolution Wolfram Burgard and Bernhard Nebel Contents Agents that think rationally The wumpus world Propositional logic: syntax and semantics
More informationA Higher-Order Duration Calculus and Its Completeness 1
A Higher-Order Duration Calculus and Its Completeness 1 Zhan Naijun Lab. of Computer Science and Technology, Institute of Software, the Chinese Academy of Sciences, Beijing, 100080, P.R. China Email: znj@ox.ios.ac.cn
More informationLogic. Propositional Logic: Syntax. Wffs
Logic Propositional Logic: Syntax Logic is a tool for formalizing reasoning. There are lots of different logics: probabilistic logic: for reasoning about probability temporal logic: for reasoning about
More informationContext Free Grammars
Automata and Formal Languages Context Free Grammars Sipser pages 101-111 Lecture 11 Tim Sheard 1 Formal Languages 1. Context free languages provide a convenient notation for recursive description of languages.
More informationDatabase Theory VU , SS Complexity of Query Evaluation. Reinhard Pichler
Database Theory Database Theory VU 181.140, SS 2018 5. Complexity of Query Evaluation Reinhard Pichler Institut für Informationssysteme Arbeitsbereich DBAI Technische Universität Wien 17 April, 2018 Pichler
More informationLinear Temporal Logic (LTL)
Chapter 9 Linear Temporal Logic (LTL) This chapter introduces the Linear Temporal Logic (LTL) to reason about state properties of Labelled Transition Systems defined in the previous chapter. We will first
More informationLecture 6: Formal Syntax & Propositional Logic. First: Laziness in Haskell. Lazy Lists. Monads Later. CS 181O Spring 2016 Kim Bruce
Lecture 6: Formal Syntax & CS 181O Spring 2016 Kim Bruce First: Laziness in Haskell Some slide content taken from Unger and Michaelis Lazy Lists Monads Later fib 0 = 1 fib 1 = 1 fib n = fib (n-1) + fib
More informationIntelligent Agents. First Order Logic. Ute Schmid. Cognitive Systems, Applied Computer Science, Bamberg University. last change: 19.
Intelligent Agents First Order Logic Ute Schmid Cognitive Systems, Applied Computer Science, Bamberg University last change: 19. Mai 2015 U. Schmid (CogSys) Intelligent Agents last change: 19. Mai 2015
More informationFirst Order Logic: Syntax and Semantics
CS1081 First Order Logic: Syntax and Semantics COMP30412 Sean Bechhofer sean.bechhofer@manchester.ac.uk Problems Propositional logic isn t very expressive As an example, consider p = Scotland won on Saturday
More informationFirst-Order Logic. 1 Syntax. Domain of Discourse. FO Vocabulary. Terms
First-Order Logic 1 Syntax Domain of Discourse The domain of discourse for first order logic is FO structures or models. A FO structure contains Relations Functions Constants (functions of arity 0) FO
More informationFirst Order Logic (FOL)
First Order Logic (FOL) CE417: Introduction to Artificial Intelligence Sharif University of Technology Spring 2013 Soleymani Course material: Artificial Intelligence: A Modern Approach, 3 rd Edition, Chapter
More information185.A09 Advanced Mathematical Logic
185.A09 Advanced Mathematical Logic www.volny.cz/behounek/logic/teaching/mathlog13 Libor Běhounek, behounek@cs.cas.cz Lecture #1, October 15, 2013 Organizational matters Study materials will be posted
More informationPropositional and Predicate Logic. jean/gbooks/logic.html
CMSC 630 February 10, 2009 1 Propositional and Predicate Logic Sources J. Gallier. Logic for Computer Science, John Wiley and Sons, Hoboken NJ, 1986. 2003 revised edition available on line at http://www.cis.upenn.edu/
More informationEquational Logic and Term Rewriting: Lecture I
Why so many logics? You all know classical propositional logic. Why would we want anything more? Equational Logic and Term Rewriting: Lecture I One reason is that we might want to change some basic logical
More informationFormal Methods for Java
Formal Methods for Java Lecture 12: Soundness of Sequent Calculus Jochen Hoenicke Software Engineering Albert-Ludwigs-University Freiburg June 12, 2017 Jochen Hoenicke (Software Engineering) Formal Methods
More informationFrom Constructibility and Absoluteness to Computability and Domain Independence
From Constructibility and Absoluteness to Computability and Domain Independence Arnon Avron School of Computer Science Tel Aviv University, Tel Aviv 69978, Israel aa@math.tau.ac.il Abstract. Gödel s main
More informationCS 2800: Logic and Computation Fall 2010 (Lecture 13)
CS 2800: Logic and Computation Fall 2010 (Lecture 13) 13 October 2010 1 An Introduction to First-order Logic In Propositional(Boolean) Logic, we used large portions of mathematical language, namely those
More informationNonclassical logics (Nichtklassische Logiken)
Nonclassical logics (Nichtklassische Logiken) VU 185.249 (lecture + exercises) http://www.logic.at/lvas/ncl/ Chris Fermüller Technische Universität Wien www.logic.at/people/chrisf/ chrisf@logic.at Winter
More informationPLC-automata: a new class of implementable real-time automata
Theoretical Computer Science 253 (2001) 61 93 www.elsevier.com/locate/tcs PLC-automata: a new class of implementable real-time automata Henning Dierks 1 University of Oldenburg, Fachbereich Informatik,
More informationMAI0203 Lecture 7: Inference and Predicate Calculus
MAI0203 Lecture 7: Inference and Predicate Calculus Methods of Artificial Intelligence WS 2002/2003 Part II: Inference and Knowledge Representation II.7 Inference and Predicate Calculus MAI0203 Lecture
More informationAn Introduction to Hybrid Systems Modeling
CS620, IIT BOMBAY An Introduction to Hybrid Systems Modeling Ashutosh Trivedi Department of Computer Science and Engineering, IIT Bombay CS620: New Trends in IT: Modeling and Verification of Cyber-Physical
More informationFirst-Order Predicate Logic. Basics
First-Order Predicate Logic Basics 1 Syntax of predicate logic: terms A variable is a symbol of the form x i where i = 1, 2, 3.... A function symbol is of the form fi k where i = 1, 2, 3... und k = 0,
More informationMathematical Foundations of Logic and Functional Programming
Mathematical Foundations of Logic and Functional Programming lecture notes The aim of the course is to grasp the mathematical definition of the meaning (or, as we say, the semantics) of programs in two
More informationLearning Goals of CS245 Logic and Computation
Learning Goals of CS245 Logic and Computation Alice Gao April 27, 2018 Contents 1 Propositional Logic 2 2 Predicate Logic 4 3 Program Verification 6 4 Undecidability 7 1 1 Propositional Logic Introduction
More information02 Propositional Logic
SE 2F03 Fall 2005 02 Propositional Logic Instructor: W. M. Farmer Revised: 25 September 2005 1 What is Propositional Logic? Propositional logic is the study of the truth or falsehood of propositions or
More information3. Only sequences that were formed by using finitely many applications of rules 1 and 2, are propositional formulas.
1 Chapter 1 Propositional Logic Mathematical logic studies correct thinking, correct deductions of statements from other statements. Let us make it more precise. A fundamental property of a statement is
More informationChapter 4: Classical Propositional Semantics
Chapter 4: Classical Propositional Semantics Language : L {,,, }. Classical Semantics assumptions: TWO VALUES: there are only two logical values: truth (T) and false (F), and EXTENSIONALITY: the logical
More informationPredicate Logic. Xinyu Feng 11/20/2013. University of Science and Technology of China (USTC)
University of Science and Technology of China (USTC) 11/20/2013 Overview Predicate logic over integer expressions: a language of logical assertions, for example x. x + 0 = x Why discuss predicate logic?
More informationFirst Order Logic vs Propositional Logic CS477 Formal Software Dev Methods
First Order Logic vs Propositional Logic CS477 Formal Software Dev Methods Elsa L Gunter 2112 SC, UIUC egunter@illinois.edu http://courses.engr.illinois.edu/cs477 Slides based in part on previous lectures
More informationECE473 Lecture 15: Propositional Logic
ECE473 Lecture 15: Propositional Logic Jeffrey Mark Siskind School of Electrical and Computer Engineering Spring 2018 Siskind (Purdue ECE) ECE473 Lecture 15: Propositional Logic Spring 2018 1 / 23 What
More informationPropositional Calculus - Hilbert system H Moonzoo Kim CS Division of EECS Dept. KAIST
Propositional Calculus - Hilbert system H Moonzoo Kim CS Division of EECS Dept. KAIST moonzoo@cs.kaist.ac.kr http://pswlab.kaist.ac.kr/courses/cs402-07 1 Review Goal of logic To check whether given a formula
More informationLecture 3: Semantics of Propositional Logic
Lecture 3: Semantics of Propositional Logic 1 Semantics of Propositional Logic Every language has two aspects: syntax and semantics. While syntax deals with the form or structure of the language, it is
More informationTheory of Computation
Theory of Computation Dr. Sarmad Abbasi Dr. Sarmad Abbasi () Theory of Computation / Lecture 3: Overview Decidability of Logical Theories Presburger arithmetic Decidability of Presburger Arithmetic Dr.
More informationComputational Logic. Davide Martinenghi. Spring Free University of Bozen-Bolzano. Computational Logic Davide Martinenghi (1/26)
Computational Logic Davide Martinenghi Free University of Bozen-Bolzano Spring 2010 Computational Logic Davide Martinenghi (1/26) Propositional Logic - algorithms Complete calculi for deciding logical
More informationStatic Program Analysis
Static Program Analysis Lecture 16: Abstract Interpretation VI (Counterexample-Guided Abstraction Refinement) Thomas Noll Lehrstuhl für Informatik 2 (Software Modeling and Verification) noll@cs.rwth-aachen.de
More informationAutomated Reasoning Lecture 5: First-Order Logic
Automated Reasoning Lecture 5: First-Order Logic Jacques Fleuriot jdf@inf.ac.uk Recap Over the last three lectures, we have looked at: Propositional logic, semantics and proof systems Doing propositional
More informationPeano Arithmetic. CSC 438F/2404F Notes (S. Cook) Fall, Goals Now
CSC 438F/2404F Notes (S. Cook) Fall, 2008 Peano Arithmetic Goals Now 1) We will introduce a standard set of axioms for the language L A. The theory generated by these axioms is denoted PA and called Peano
More informationLogic. Propositional Logic: Syntax
Logic Propositional Logic: Syntax Logic is a tool for formalizing reasoning. There are lots of different logics: probabilistic logic: for reasoning about probability temporal logic: for reasoning about
More informationPolynomial Space. The classes PS and NPS Relationship to Other Classes Equivalence PS = NPS A PS-Complete Problem
Polynomial Space The classes PS and NPS Relationship to Other Classes Equivalence PS = NPS A PS-Complete Problem 1 Polynomial-Space-Bounded TM s A TM M is said to be polyspacebounded if there is a polynomial
More informationComplexity. Complexity Theory Lecture 3. Decidability and Complexity. Complexity Classes
Complexity Theory 1 Complexity Theory 2 Complexity Theory Lecture 3 Complexity For any function f : IN IN, we say that a language L is in TIME(f(n)) if there is a machine M = (Q, Σ, s, δ), such that: L
More informationICS141: Discrete Mathematics for Computer Science I
ICS141: Discrete Mathematics for Computer Science I Dept. Information & Computer Sci., Originals slides by Dr. Baek and Dr. Still, adapted by J. Stelovsky Based on slides Dr. M. P. Frank and Dr. J.L. Gross
More information22c:145 Artificial Intelligence
22c:145 Artificial Intelligence Fall 2005 Propositional Logic Cesare Tinelli The University of Iowa Copyright 2001-05 Cesare Tinelli and Hantao Zhang. a a These notes are copyrighted material and may not
More informationLecture 1: Logical Foundations
Lecture 1: Logical Foundations Zak Kincaid January 13, 2016 Logics have two components: syntax and semantics Syntax: defines the well-formed phrases of the language. given by a formal grammar. Typically
More informationFundamentals of Software Engineering
Fundamentals of Software Engineering First-Order Logic Ina Schaefer Institute for Software Systems Engineering TU Braunschweig, Germany Slides by Wolfgang Ahrendt, Richard Bubel, Reiner Hähnle (Chalmers
More information22c:145 Artificial Intelligence. First-Order Logic. Readings: Chapter 8 of Russell & Norvig.
22c:145 Artificial Intelligence First-Order Logic Readings: Chapter 8 of Russell & Norvig. Einstein s Puzzle in Logic We used propositinal variables to specify everything: x 1 = house #1 is red ; x 2 =
More informationcis32-ai lecture # 18 mon-3-apr-2006
cis32-ai lecture # 18 mon-3-apr-2006 today s topics: propositional logic cis32-spring2006-sklar-lec18 1 Introduction Weak (search-based) problem-solving does not scale to real problems. To succeed, problem
More informationACLT: Algebra, Categories, Logic in Topology - Grothendieck's generalized topological spaces (toposes)
ACLT: Algebra, Categories, Logic in Topology - Grothendieck's generalized topological spaces (toposes) Steve Vickers CS Theory Group Birmingham 2. Theories and models Categorical approach to many-sorted
More informationPropositional Logic: Logical Agents (Part I)
Propositional Logic: Logical Agents (Part I) This lecture topic: Propositional Logic (two lectures) Chapter 7.1-7.4 (this lecture, Part I) Chapter 7.5 (next lecture, Part II) Next lecture topic: First-order
More informationINTRODUCTION TO PREDICATE LOGIC HUTH AND RYAN 2.1, 2.2, 2.4
INTRODUCTION TO PREDICATE LOGIC HUTH AND RYAN 2.1, 2.2, 2.4 Neil D. Jones DIKU 2005 Some slides today new, some based on logic 2004 (Nils Andersen), some based on kernebegreber (NJ 2005) PREDICATE LOGIC:
More informationHerbrand Theorem, Equality, and Compactness
CSC 438F/2404F Notes (S. Cook and T. Pitassi) Fall, 2014 Herbrand Theorem, Equality, and Compactness The Herbrand Theorem We now consider a complete method for proving the unsatisfiability of sets of first-order
More informationClassical First-Order Logic
Classical First-Order Logic Software Formal Verification Maria João Frade Departmento de Informática Universidade do Minho 2009/2010 Maria João Frade (DI-UM) First-Order Logic (Classical) MFES 2009/10
More informationLecture 12: Core State Machines II
Software Design, Modelling and Analysis in UML Lecture 12: Core State Machines II 2015-12-15 12 2015-12-15 main Prof. Dr. Andreas Podelski, Dr. Bernd Westphal Albert-Ludwigs-Universität Freiburg, Germany
More informationREAL-TIME control systems usually consist of some
1 A Formal Design Technique for Real-Time Embedded Systems Development using Duration Calculus François Siewe, Dang Van Hung, Hussein Zedan and Antonio Cau Abstract In this paper we present a syntactical
More informationFinite Automata Theory and Formal Languages TMV027/DIT321 LP Recap: Logic, Sets, Relations, Functions
Finite Automata Theory and Formal Languages TMV027/DIT321 LP4 2017 Formal proofs; Simple/strong induction; Mutual induction; Inductively defined sets; Recursively defined functions. Lecture 3 Ana Bove
More informationLogical reasoning - Can we formalise our thought processes?
Logical reasoning - Can we formalise our thought processes? Why study (mathematical) logic? Logic: the science or method of reasoning Logical: able to reason correctly Human reasoning poorly understood,
More information