Reasoning About Bounds In Weighted Transition Systems
|
|
- Jasper Blaze Hart
- 5 years ago
- Views:
Transcription
1 Reasoning About Bounds In Weighted Transition Systems QuantLA 2017 September 18, 2017 Mikkel Hansen, Kim Guldstrand Larsen, Radu Mardare, Mathias Ruggaard Pedersen and Bingtian Xue {mhan, kgl, mardare, mrp, Department of Computer Science Aalborg University Denmark Slides adapted from Mikkel Hansen
2 Introduction
3 Introduction Background 1 Cyber-Physical Systems operate in environments that are inherently unpredictable and imprecise. inc./dec. temp. start temp. reading
4 Introduction Motivation 2 Observation When modeling physical phenomena, their quantitative nature is most often captured by means of observations and measurements. The accuracy of these measurements is highly dependent on the methods/equipment used to obtain them as well as the environment in which they are obtained.
5 Introduction Motivation 2 Observation When modeling physical phenomena, their quantitative nature is most often captured by means of observations and measurements. The accuracy of these measurements is highly dependent on the methods/equipment used to obtain them as well as the environment in which they are obtained. x ± 1 Example Consider measuring some physical phenomena with a piece of equipment that is known to be accurate within one unit.
6 Introduction Motivation 3 Example x ± 1 Consider measuring some physical phenomena with a piece of equipment that is known to be accurate within one unit. We may obtain a reading of x and thus conclude that the actual value is somewhere in the interval [x 1; x + 1].
7 Introduction Motivation 3 Example x ± 1 Consider measuring some physical phenomena with a piece of equipment that is known to be accurate within one unit. We may obtain a reading of x and thus conclude that the actual value is somewhere in the interval [x 1; x + 1]. Problem What quantity should we use in our model?
8 Introduction Motivation 4 Problem What quantity should we use in our model? Solution 1: Naive Approach Use the concrete value x regardless of the possible inaccuracy of the measurement. {a} 5 2 {b} {b}
9 Introduction Motivation 5 Solution 2: Abstractions Realize the inherent uncertainty in the quantitative measures and try to abstract it away in the models. In our example, a natural solution could be to use the interval [x 1; x + 1] as a quantitative measure. {a} [4; 6] [1; 3] {a} {b} The model then describes how the system can or may be implemented.
10 Introduction Motivation 6 Our Approach We abstract away the intermediate transitions in [x 1; x + 1], 4 {a} {a} {b}
11 Introduction Motivation 6 Our Approach We abstract away the intermediate transitions in [x 1; x + 1], 4 {a} {a} {b} and instead reason only about the lower/upper bounds on transition weights.
12 Introduction Contribution 7 Our Contribution Reasoning about min and max transitions, including bisimulation.
13 Introduction Contribution 7 Our Contribution Reasoning about min and max transitions, including bisimulation. Modal logic that is invariant under bisimulation.
14 Introduction Contribution 7 Our Contribution Reasoning about min and max transitions, including bisimulation. Modal logic that is invariant under bisimulation. Finite model property and satisfiability checking algorithm.
15 Introduction Contribution 7 Our Contribution Reasoning about min and max transitions, including bisimulation. Modal logic that is invariant under bisimulation. Finite model property and satisfiability checking algorithm. Complete axiomatization for the logic.
16 Models
17 Model Weighted Transition Systems 8 Definition: Weighted Transition System A weighted transition system (WTS) is a tuple M = (S,, l), where S is a non-empty set of states, S R 0 S is the transition relation, and l : S 2 AP is a labeling function mapping to each state a set of atomic propositions. {waiting} 1 s s s 3 {cleaning} {charging}
18 Model Example: Robot Vacuum Cleaner 9 Example: A model of a robot vacuum cleaner {waiting} 1 s s s 3 {cleaning} {charging} 3 states: waiting, cleaning and charging. The time it takes to move between states is given by the transition weights.
19 Model Image Sets 10 Definition: Image Set For arbitrary WTS M = (S,, l) the function θ : S (2 S 2 R 0 ) is defined for any state s S and any set of states T S as { } θ = x R 0 t T such that s x t We refer to θ(s)(t ) as the image from s to T or simply an image set. θ (s) (T ) = inf θ (s) (T ) and θ + (s) (T ) = sup θ (s) (T )
20 Model Example: Robot Vacuum Cleaner 11 Example: A model of a robot vacuum cleaner {waiting} 1 s s s 3 {cleaning} {charging} θ (s 1 ) ({s 2 }) = {0} θ (s 2 ) ({s 1 }) = {5, 10, 15} θ (s 1 ) ({s 2 }) = 0 θ (s 2 ) ({s 1 }) = 5 θ + (s 1 ) ({s 2 }) = 0 θ + (s 2 ) ({s 1 }) = 15
21 Model Bisimulation 12 Definition: Weighted Bisimilarity W Given a WTS M = (S,, l), a binary relation R on S is called a weighted bisimulation relation if and only if srt implies (Atomic Harmony) l(s) = l(t), (Zig) s x s implies t (Zag) t x t such that s Rt, and x t implies s x s such that s Rt. s 1 {a} 1 10 {b} s 2 {b} s 3 {a} {b} t t 2 R = (s 1, t 1 ), (t 1, s 1 ), (s 2, t 2 ), (t 2, s 2 ), (s 3, t 2 ), (t 2, s 3 ), (s 2, s 3 ), (s 3, s 2 ) is a bisimulation relation
22 Model Bisimulation 13 Definition: Generalized Weighted Bisimilarity Given a WTS M = (S,, l), an equivalence relation R on S is called a generalized weighted bisimulation iff srt implies (Atomic Harmony) l(s) = l(t), (Lower Bound) θ (s) (T ) = θ (t) (T ), and (Upper Bound) θ + (s) (T ) = θ + (t) (T ) for any R-equivalence class T S/R. {a} s t {a} {b} s t {b} θ (s) ({s, t }) = θ (t) ({s, t }) and θ + (s) ({s, t }) = θ + (t) ({s, t }) so s t but s W t
23 Model Bisimulation 14 Theorem: Relation between and W Generalized weighted bisimilarity is coarser than weighted bisimilarity, i.e. W
24 Logic
25 Logic Syntax and Semantics 15 Definition: Syntax of L L : ϕ, ψ ::= p ϕ ϕ ψ L r ϕ M r ϕ Definition: L r and M r Semantics M, s = L r ϕ iff θ (s) ( ϕ ) r M, s = M r ϕ iff θ + (s) ( ϕ ) r where ϕ = {t S M, t = ϕ}.
26 Logic Syntax and Semantics 16 Definition: L r and M r Semantics M, s = L r ϕ iff θ (s) ( ϕ ) r M, s = M r ϕ iff θ + (s) ( ϕ ) r where ϕ = {t S M, t = ϕ}. θ (s) ( ϕ ) θ (s) ( ϕ ) r θ θ + θ θ + r (a) M, s = L r ϕ (b) M, s = M r ϕ
27 Logic Syntax and Semantics 17 It is possible that L r ϕ and M r ϕ are both satisfied at the same time. θ (s) ( ϕ ) r θ θ + This also holds for their negation, L r ϕ and M r ϕ. θ (s) ( ϕ ) r θ θ +
28 Logic Bisimulation Invariance 18 Theorem: Bisimulation Invariance For any image-finite WTS M = (S,, l) and states s, t S it holds that s t iff [ ϕ L. M, s = ϕ iff M, t = ϕ]
29 Metatheory
30 Metatheory Axioms 19 (A1): L 0 (A2): L r+q ϕ L r ϕ if q > 0 (A2 ): M r ϕ M r+q ϕ if q > 0 (A3): L r ϕ L q ψ L min{r,q} (ϕ ψ) (A3 ): M r ϕ M q ψ M max{r,q} (ϕ ψ) (A4): L r (ϕ ψ) L r ϕ L r ψ (A5): L 0 ψ (L r ϕ L r (ϕ ψ)) (A5 ): L 0 ψ (M r ϕ M r (ϕ ψ)) (A6): L r+q ϕ M r ϕ if q > 0 (A7): M r ϕ L 0 ϕ (R1): ϕ ψ = ((L r ψ) (L 0 ϕ)) L r ϕ (R1 ): ϕ ψ = ((M r ψ) (L 0 ϕ)) M r ϕ (R2): ϕ ψ = L 0 ϕ L 0 ψ
31 Metatheory Axioms 19 (A1): L 0 (A2): L r+q ϕ L r ϕ if q > 0 (A2 ): M r ϕ M r+q ϕ if q > 0 (A3): L r ϕ L q ψ L min{r,q} (ϕ ψ) (A3 ): M r ϕ M q ψ M max{r,q} (ϕ ψ) (A4): L r (ϕ ψ) L r ϕ L r ψ (A5): L 0 ψ (L r ϕ L r (ϕ ψ)) (A5 ): L 0 ψ (M r ϕ M r (ϕ ψ)) (A6): L r+q ϕ M r ϕ if q > 0 (A7): M r ϕ L 0 ϕ (R1): ϕ ψ = ((L r ψ) (L 0 ϕ)) L r ϕ (R1 ): ϕ ψ = ((M r ψ) (L 0 ϕ)) M r ϕ (R2): ϕ ψ = L 0 ϕ L 0 ψ
32 Metatheory A2 and A2 20 (A2) L r+s ϕ L r ϕ, s > 0 (A2 ) M t ϕ M t+q ϕ, q > 0 + r + s t ϕ
33 Metatheory A3 21 (A3) L r ϕ L q ψ L min{r,q} (ϕ ψ) r q + ϕ ϕ ψ ψ
34 Metatheory A3 22 (A3 ) M r ϕ M q ψ M max{r,q} (ϕ ψ) r q + ϕ ϕ ψ ψ
35 Metatheory A6 23 (A8) L r+q ϕ M r ϕ, q > 0 + r + q r ϕ
36 Metatheory R1 and R1 24 (R1) ϕ ψ = ((L r ψ) (L 0 ϕ)) L r ϕ (R1 ) ϕ ψ = ((M s ψ) (L 0 ϕ)) M s ϕ r s + ψ ϕ
37 Metatheory Soundness 25 Lemma: Soundness ϕ implies = ϕ
38 Metatheory Finite Model Construction 26 Starting from a consistent formula ϕ L, we do the following based on ϕ 1 Construct a finite subset L[ϕ] of L 2 Construct a model M ϕ where: States are the maximal consistent sets (ultrafilters) of L[ϕ] Transitions are given by the formulae in these sets, i.e. L r ϕ u implies u x ϕ where x r. Then, M ϕ is a model for ϕ.
39 Metatheory Finite Model Property 27 Lemma: Truth Lemma If ϕ L is a consistent formula, then for formulae all ψ L[ϕ] and ultrafilters u L[ϕ] we have M ϕ, u = ψ iff ψ u Lemma: Finite Model Property For any consistent formula ϕ L, there exists a finite WTS M = (S,, l) and a state s S such that M, s = ϕ
40 Metatheory Completeness 28 Theorem: Completeness For any formula ϕ L it holds that = ϕ implies ϕ
41 Conclusions
42 Concluding Remarks 29 We have proposed abstracting away individual transition weights in a WTS by introducing the notion of an image set. We have proposed a modal logic that reasons about the minimum and maximum weights on transitions and shown that it has the finite model property. We have presented a procedure for determining the satisfiability of formulae in our logic (not covered in this talk). We have proposed an axiomatization for our logic and shown that is is complete.
43 Open Problems
44 Open Problems Strong Completeness 30 There is a stronger notion of completeness, often called strong completeness, which asserts that Φ = ϕ implies Φ ϕ for any set of formulae Φ L. Completeness is a special case of strong completeness where Φ =. In the case of compact logics, strong completeness follows directly from completeness. However, our logic is non-compact. Φ = {L q ϕ q < r} { L r ϕ}
45 Open Problems Temporal Specification 31 Many interesting properties of CPSs such as liveness and deadlock freeness cannot be expressed in modal logic. We would like to explore temporal specification languages such as CTL or LTL.
46 Thank you
A Complete Approximation Theory for Weighted Transition Systems,
A Complete Approximation Theory for Weighted Transition Systems, Mikkel Hansen 1, Kim Guldstrand Larsen 1, Radu Mardare 1, Mathias Ruggaard Pedersen 1, and Bingtian Xue 1 Department of Computer Science,
More informationT Reactive Systems: Temporal Logic LTL
Tik-79.186 Reactive Systems 1 T-79.186 Reactive Systems: Temporal Logic LTL Spring 2005, Lecture 4 January 31, 2005 Tik-79.186 Reactive Systems 2 Temporal Logics Temporal logics are currently the most
More informationOn simulations and bisimulations of general flow systems
On simulations and bisimulations of general flow systems Jen Davoren Department of Electrical & Electronic Engineering The University of Melbourne, AUSTRALIA and Paulo Tabuada Department of Electrical
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 informationTimo Latvala. February 4, 2004
Reactive Systems: Temporal Logic LT L Timo Latvala February 4, 2004 Reactive Systems: Temporal Logic LT L 8-1 Temporal Logics Temporal logics are currently the most widely used specification formalism
More informationStrong Completeness for Markovian Logics
Strong Completeness for Markovian Logics Dexter Kozen 1, Radu Mardare 2, and Prakash Panangaden 3 1. Computer Science Department, Cornell University, Ithaca, New York, USA 2. Department of Computer Science,
More informationNotes on Modal Logic
Notes on Modal Logic Notes for PHIL370 Eric Pacuit October 22, 2012 These short notes are intended to introduce some of the basic concepts of Modal Logic. The primary goal is to provide students in Philosophy
More informationNotes on Modal Logic
Notes on Modal Logic Notes for Philosophy 151 Eric Pacuit January 25, 2009 These short notes are intended to supplement the lectures and text ntroduce some of the basic concepts of Modal Logic. The primary
More informationMajority Logic. Introduction
Majority Logic Eric Pacuit and Samer Salame Department of Computer Science Graduate Center, City University of New York 365 5th Avenue, New York 10016 epacuit@cs.gc.cuny.edu, ssalame@gc.cuny.edu Abstract
More informationAN EXTENSION OF THE PROBABILITY LOGIC LP P 2. Tatjana Stojanović 1, Ana Kaplarević-Mališić 1 and Zoran Ognjanović 2
45 Kragujevac J. Math. 33 (2010) 45 62. AN EXTENSION OF THE PROBABILITY LOGIC LP P 2 Tatjana Stojanović 1, Ana Kaplarević-Mališić 1 and Zoran Ognjanović 2 1 University of Kragujevac, Faculty of Science,
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 informationESE601: Hybrid Systems. Introduction to verification
ESE601: Hybrid Systems Introduction to verification Spring 2006 Suggested reading material Papers (R14) - (R16) on the website. The book Model checking by Clarke, Grumberg and Peled. What is verification?
More informationNeighborhood Semantics for Modal Logic Lecture 5
Neighborhood Semantics for Modal Logic Lecture 5 Eric Pacuit ILLC, Universiteit van Amsterdam staff.science.uva.nl/ epacuit August 17, 2007 Eric Pacuit: Neighborhood Semantics, Lecture 5 1 Plan for the
More informationAn Introduction to Modal Logic V
An Introduction to Modal Logic V Axiomatic Extensions and Classes of Frames Marco Cerami Palacký University in Olomouc Department of Computer Science Olomouc, Czech Republic Olomouc, November 7 th 2013
More informationBisimulation for Neighbourhood Structures
Bisimulation for Neighbourhood Structures Helle Hvid Hansen 1,2 Clemens Kupke 2 Eric Pacuit 3 1 Vrije Universiteit Amsterdam (VUA) 2 Centrum voor Wiskunde en Informatica (CWI) 3 Universiteit van Amsterdam
More informationModal logics and their semantics
Modal logics and their semantics Joshua Sack Department of Mathematics and Statistics, California State University Long Beach California State University Dominguez Hills Feb 22, 2012 Relational structures
More informationInterval Temporal Logics over Strongly Discrete Linear Orders: the Complete Picture
Interval Temporal Logics over Strongly Discrete Linear Orders: the Complete Picture D.Bresolin, D. Della Monica, A. Montanari, P. Sala, G. Sciavicco ICE-TCS, School of Computer Science, Reykjavik University,
More informationModal Logic XXI. Yanjing Wang
Modal Logic XXI Yanjing Wang Department of Philosophy, Peking University May 17th, 2017 Advanced Modal Logic (2017 Spring) 1 Completeness via Canonicity Soundness and completeness Definition (Soundness)
More informationFormal Epistemology: Lecture Notes. Horacio Arló-Costa Carnegie Mellon University
Formal Epistemology: Lecture Notes Horacio Arló-Costa Carnegie Mellon University hcosta@andrew.cmu.edu Logical preliminaries Let L 0 be a language containing a complete set of Boolean connectives, including
More informationNeighborhood Semantics for Modal Logic Lecture 4
Neighborhood Semantics for Modal Logic Lecture 4 Eric Pacuit ILLC, Universiteit van Amsterdam staff.science.uva.nl/ epacuit August 16, 2007 Eric Pacuit: Neighborhood Semantics, Lecture 4 1 Plan for the
More informationA generalization of modal definability
A generalization of modal definability Tin Perkov Polytechnic of Zagreb Abstract. Known results on global definability in basic modal logic are generalized in the following sense. A class of Kripke models
More informationChapter 4: Computation tree logic
INFOF412 Formal verification of computer systems Chapter 4: Computation tree logic Mickael Randour Formal Methods and Verification group Computer Science Department, ULB March 2017 1 CTL: a specification
More informationAn Introduction to Modal Logic III
An Introduction to Modal Logic III Soundness of Normal Modal Logics Marco Cerami Palacký University in Olomouc Department of Computer Science Olomouc, Czech Republic Olomouc, October 24 th 2013 Marco Cerami
More informationModel Theory of Modal Logic Lecture 5. Valentin Goranko Technical University of Denmark
Model Theory of Modal Logic Lecture 5 Valentin Goranko Technical University of Denmark Third Indian School on Logic and its Applications Hyderabad, January 29, 2010 Model Theory of Modal Logic Lecture
More informationDefinability for Downward and Vertical XPath on Data Trees
Definability for Downward and Vertical XPath on Data Trees Sergio Abriola 1, María Emilia Descotte 1, and Santiago Figueira 1,2 1 University of Buenos Aires, Argentina 2 CONICET, Argentina Abstract. We
More informationModel Theory of XPath on Data Trees. Part II: Binary Bisimulation and Definability
Model Theory of XPath on Data Trees. Part II: Binary Bisimulation and Definability Sergio Abriola María Emilia Descotte Santiago Figueira University of Buenos Aires Abstract We study the expressive power
More informationBisimulation for conditional modalities
Bisimulation for conditional modalities Alexandru Baltag and Giovanni Ciná Institute for Logic, Language and Computation, University of Amsterdam March 21, 2016 Abstract We give a general definition of
More informationProperty Checking of Safety- Critical Systems Mathematical Foundations and Concrete Algorithms
Property Checking of Safety- Critical Systems Mathematical Foundations and Concrete Algorithms Wen-ling Huang and Jan Peleska University of Bremen {huang,jp}@cs.uni-bremen.de MBT-Paradigm Model Is a partial
More informationLogic: Propositional Logic (Part I)
Logic: Propositional Logic (Part I) Alessandro Artale Free University of Bozen-Bolzano Faculty of Computer Science http://www.inf.unibz.it/ artale Descrete Mathematics and Logic BSc course Thanks to Prof.
More informationIntroduction to Temporal Logic. The purpose of temporal logics is to specify properties of dynamic systems. These can be either
Introduction to Temporal Logic The purpose of temporal logics is to specify properties of dynamic systems. These can be either Desired properites. Often liveness properties like In every infinite run action
More informationarxiv:math/ v1 [math.lo] 5 Mar 2007
Topological Semantics and Decidability Dmitry Sustretov arxiv:math/0703106v1 [math.lo] 5 Mar 2007 March 6, 2008 Abstract It is well-known that the basic modal logic of all topological spaces is S4. However,
More informationSyntax and Semantics of Propositional Linear Temporal Logic
Syntax and Semantics of Propositional Linear Temporal Logic 1 Defining Logics L, M, = L - the language of the logic M - a class of models = - satisfaction relation M M, ϕ L: M = ϕ is read as M satisfies
More informationA Propositional Dynamic Logic for Instantial Neighborhood Semantics
A Propositional Dynamic Logic for Instantial Neighborhood Semantics Johan van Benthem, Nick Bezhanishvili, Sebastian Enqvist Abstract We propose a new perspective on logics of computation by combining
More informationLogics of Strong Noncontingency arxiv: v1 [cs.lo] 15 May 2015
Logics of Strong Noncontingency arxiv:1505.03950v1 [cs.lo] 15 May 2015 Jie Fan Abstract Inspired by Hintikka s treatment of question embedding verbs in [8] and the variations of noncontingency operator,
More informationAutomata on Infinite words and LTL Model Checking
Automata on Infinite words and LTL Model Checking Rodica Condurache Lecture 4 Lecture 4 Automata on Infinite words and LTL Model Checking 1 / 35 Labeled Transition Systems Let AP be the (finite) set of
More informationFuzzy Answer Set semantics for Residuated Logic programs
semantics for Logic Nicolás Madrid & Universidad de Málaga September 23, 2009 Aims of this paper We are studying the introduction of two kinds of negations into residuated : Default negation: This negation
More informationProbabilistic Model Checking Michaelmas Term Dr. Dave Parker. Department of Computer Science University of Oxford
Probabilistic Model Checking Michaelmas Term 2011 Dr. Dave Parker Department of Computer Science University of Oxford Overview Temporal logic Non-probabilistic temporal logic CTL Probabilistic temporal
More informationModal logics: an introduction
Modal logics: an introduction Valentin Goranko DTU Informatics October 2010 Outline Non-classical logics in AI. Variety of modal logics. Brief historical remarks. Basic generic modal logic: syntax and
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 informationTHEORY OF SYSTEMS MODELING AND ANALYSIS. Henny Sipma Stanford University. Master class Washington University at St Louis November 16, 2006
THEORY OF SYSTEMS MODELING AND ANALYSIS Henny Sipma Stanford University Master class Washington University at St Louis November 16, 2006 1 1 COURSE OUTLINE 8:37-10:00 Introduction -- Computational model
More informationTemporal Logic. Stavros Tripakis University of California, Berkeley. We have designed a system. We want to check that it is correct.
EE 244: Fundamental Algorithms for System Modeling, Analysis, and Optimization Fall 2016 Temporal logic Stavros Tripakis University of California, Berkeley Stavros Tripakis (UC Berkeley) EE 244, Fall 2016
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 informationFirst Order Logic (FOL) 1 znj/dm2017
First Order Logic (FOL) 1 http://lcs.ios.ac.cn/ znj/dm2017 Naijun Zhan March 19, 2017 1 Special thanks to Profs Hanpin Wang (PKU) and Lijun Zhang (ISCAS) for their courtesy of the slides on this course.
More informationModal Probability Logic
Modal Probability Logic ESSLLI 2014 - Logic and Probability Wes Holliday and Thomas Icard Berkeley and Stanford August 14, 2014 Wes Holliday and Thomas Icard: Modal Probability 1 References M. Fattorosi-Barnaba
More informationCompleteness Results for Memory Logics
Completeness Results for Memory Logics Carlos Areces Santiago Figueira Sergio Mera Abstract Memory logics are a family of modal logics in which standard relational structures are augmented with data structures
More informationb. Induction (LfP 50 3)
b. Induction (LfP 50 3) b.i. The principle of mathematical induction The principle of mathematical induction is a property of natural numbers. b.i.1. Natural numbers The natural numbers are the non-negative
More informationA Metrized Duality Theorem for Markov Processes
A Metrized Duality Theorem for Markov Processes Dexter Kozen Radu Mardare Prakash Panangaden Cornell University, USA Aalborg University, Denmark McGill University, Canada Abstract We extend our previous
More informationAdvanced Topics in LP and FP
Lecture 1: Prolog and Summary of this lecture 1 Introduction to Prolog 2 3 Truth value evaluation 4 Prolog Logic programming language Introduction to Prolog Introduced in the 1970s Program = collection
More informationArgumentation Theory and Modal Logic
Argumentation Theory and Modal Logic Davide Grossi ILLC, University of Amsterdam Preface Argumentation in a nutshell Arguing Arguing The Economist: Mr. Berlusconi is unfit to lead Italy because His election
More informationComputation Tree Logic
Computation Tree Logic Computation tree logic (CTL) is a branching-time logic that includes the propositional connectives as well as temporal connectives AX, EX, AU, EU, AG, EG, AF, and EF. The syntax
More informationCS256/Spring 2008 Lecture #11 Zohar Manna. Beyond Temporal Logics
CS256/Spring 2008 Lecture #11 Zohar Manna Beyond Temporal Logics Temporal logic expresses properties of infinite sequences of states, but there are interesting properties that cannot be expressed, e.g.,
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 informationA Faster-Than Relation for Semi-Markov Decision Processes
A Faster-Than Relation for Semi-Markov Decision Processes QAPL 2019 April 7, 2019 Mathias Ruggaard Pedersen, Giorgio Bacci, and Kim Guldstrand Larsen {mrp, grbacci, kgl}@cs.aau.dk Department of Computer
More informationTowards A Multi-Agent Subset Space Logic
Towards A Multi-Agent Subset Space Logic A Constructive Approach with Applications Department of Computer Science The Graduate Center of the City University of New York cbaskent@gc.cuny.edu www.canbaskent.net
More informationOverview. overview / 357
Overview overview6.1 Introduction Modelling parallel systems Linear Time Properties Regular Properties Linear Temporal Logic (LTL) Computation Tree Logic syntax and semantics of CTL expressiveness of CTL
More informationComputation Tree Logic
Computation Tree Logic Hao Zheng Department of Computer Science and Engineering University of South Florida Tampa, FL 33620 Email: zheng@cse.usf.edu Phone: (813)974-4757 Fax: (813)974-5456 Hao Zheng (CSE,
More informationThe modal logic of forcing
Joel David Hamkins New York University, Philosophy The City University of New York, Mathematics College of Staten Island of CUNY The CUNY Graduate Center London, August 5 6, 2011 This is joint work with
More informationAlan Bundy. Automated Reasoning LTL Model Checking
Automated Reasoning LTL Model Checking Alan Bundy Lecture 9, page 1 Introduction So far we have looked at theorem proving Powerful, especially where good sets of rewrite rules or decision procedures have
More informationMathematical Logic. Introduction to Reasoning and Automated Reasoning. Hilbert-style Propositional Reasoning. Chiara Ghidini. FBK-IRST, Trento, Italy
Introduction to Reasoning and Automated Reasoning. Hilbert-style Propositional Reasoning. FBK-IRST, Trento, Italy Deciding logical consequence Problem Is there an algorithm to determine whether a formula
More informationCyclic Proofs for Linear Temporal Logic
Cyclic Proofs for Linear Temporal Logic Ioannis Kokkinis Thomas Studer Abstract Annotated sequents provide an elegant approach for the design of deductive systems for temporal logics. Their proof theory,
More informationLinear Temporal Logic and Büchi Automata
Linear Temporal Logic and Büchi Automata Yih-Kuen Tsay Department of Information Management National Taiwan University FLOLAC 2009 Yih-Kuen Tsay (SVVRL @ IM.NTU) Linear Temporal Logic and Büchi Automata
More informationPropositional Dynamic Logic
Propositional Dynamic Logic Contents 1 Introduction 1 2 Syntax and Semantics 2 2.1 Syntax................................. 2 2.2 Semantics............................... 2 3 Hilbert-style axiom system
More informationSemantical study of intuitionistic modal logics
Semantical study of intuitionistic modal logics Department of Intelligence Science and Technology Graduate School of Informatics Kyoto University Kensuke KOJIMA January 16, 2012 Abstract We investigate
More informationBasic Algebraic Logic
ELTE 2013. September Today Past 1 Universal Algebra 1 Algebra 2 Transforming Algebras... Past 1 Homomorphism 2 Subalgebras 3 Direct products 3 Varieties 1 Algebraic Model Theory 1 Term Algebras 2 Meanings
More informationIntroduction to Neighborhood Semantics for. Modal Logic. ILLC, University of Amsterdam. January 7, 2007
Introduction to Neighborhood Semantics for Modal Logic Eric Pacuit January 7, 2007 ILLC, University of Amsterdam staff.science.uva.nl/ epacuit epacuit@science.uva.nl Introduction 1. Motivation 2. Neighborhood
More informationChapter 6: Computation Tree Logic
Chapter 6: Computation Tree Logic Prof. Ali Movaghar Verification of Reactive Systems Outline We introduce Computation Tree Logic (CTL), a branching temporal logic for specifying system properties. A comparison
More informationBoolean Algebra and Propositional Logic
Boolean Algebra and Propositional Logic Takahiro Kato September 10, 2015 ABSTRACT. This article provides yet another characterization of Boolean algebras and, using this characterization, establishes a
More informationProofs. Joe Patten August 10, 2018
Proofs Joe Patten August 10, 2018 1 Statements and Open Sentences 1.1 Statements A statement is a declarative sentence or assertion that is either true or false. They are often labelled with a capital
More informationA Note on Graded Modal Logic
A Note on Graded Modal Logic Maarten de Rijke Studia Logica, vol. 64 (2000), pp. 271 283 Abstract We introduce a notion of bisimulation for graded modal logic. Using these bisimulations the model theory
More informationModal and temporal logic
Modal and temporal logic N. Bezhanishvili I. Hodkinson C. Kupke Imperial College London 1 / 83 Overview Part II 1 Soundness and completeness. Canonical models. 3 lectures. 2 Finite model property. Filtrations.
More informationModel Checking: An Introduction
Model Checking: An Introduction Meeting 3, CSCI 5535, Spring 2013 Announcements Homework 0 ( Preliminaries ) out, due Friday Saturday This Week Dive into research motivating CSCI 5535 Next Week Begin foundations
More information09 Modal Logic II. CS 3234: Logic and Formal Systems. October 14, Martin Henz and Aquinas Hobor
Martin Henz and Aquinas Hobor October 14, 2010 Generated on Thursday 14 th October, 2010, 11:40 1 Review of Modal Logic 2 3 4 Motivation Syntax and Semantics Valid Formulas wrt Modalities Correspondence
More informationLTL and CTL. Lecture Notes by Dhananjay Raju
LTL and CTL Lecture Notes by Dhananjay Raju draju@cs.utexas.edu 1 Linear Temporal Logic: LTL Temporal logics are a convenient way to formalise and verify properties of reactive systems. LTL is an infinite
More informationLogical Characterizations of Simulation and Bisimulation for Fuzzy Transition Systems
Logical Characterizations of Simulation and Bisimulation for Fuzzy Transition Systems Hengyang Wu 1 Yuxin Deng 2 1 Information Engineer College, Hangzhou Dianzi University Hangzhou 310018, P.R. China 2
More informationSocratic Proofs for Some Temporal Logics RESEARCH REPORT
Section of Logic and Cognitive Science Institute of Psychology Adam Mickiewicz University in Poznań Mariusz Urbański Socratic Proofs for Some Temporal Logics RESEARCH REPORT Szamarzewskiego 89, 60-589
More informationFuzzy Propositional Logic for the Knowledge Representation
Fuzzy Propositional Logic for the Knowledge Representation Alexander Savinov Institute of Mathematics Academy of Sciences Academiei 5 277028 Kishinev Moldova (CIS) Phone: (373+2) 73-81-30 EMAIL: 23LSII@MATH.MOLDOVA.SU
More informationSKETCHY NOTES FOR WEEKS 7 AND 8
SKETCHY NOTES FOR WEEKS 7 AND 8 We are now ready to start work on the proof of the Completeness Theorem for first order logic. Before we start a couple of remarks are in order (1) When we studied propositional
More informationA Logic for Reasoning about Upper Probabilities
Journal of Artificial Intelligence Research 17 (2002) 57-81 Submitted 12/01; published 8/02 A Logic for Reasoning about Upper Probabilities Joseph Y. Halpern Riccardo Pucella Department of Computer Science
More informationFinite-State Model Checking
EECS 219C: Computer-Aided Verification Intro. to Model Checking: Models and Properties Sanjit A. Seshia EECS, UC Berkeley Finite-State Model Checking G(p X q) Temporal logic q p FSM Model Checker Yes,
More informationReasoning with Probabilities. Eric Pacuit Joshua Sack. Outline. Basic probability logic. Probabilistic Epistemic Logic.
Reasoning with July 28, 2009 Plan for the Course Day 1: Introduction and Background Day 2: s Day 3: Dynamic s Day 4: Reasoning with Day 5: Conclusions and General Issues Probability language Let Φ be a
More informationInterpretability Logic
Interpretability Logic Logic and Applications, IUC, Dubrovnik vukovic@math.hr web.math.pmf.unizg.hr/ vukovic/ Department of Mathematics, Faculty of Science, University of Zagreb September, 2013 Interpretability
More informationNeighborhood Semantics for Modal Logic Lecture 3
Neighborhood Semantics for Modal Logic Lecture 3 Eric Pacuit ILLC, Universiteit van Amsterdam staff.science.uva.nl/ epacuit August 15, 2007 Eric Pacuit: Neighborhood Semantics, Lecture 3 1 Plan for the
More informationModel Checking for Modal Intuitionistic Dependence Logic
1/71 Model Checking for Modal Intuitionistic Dependence Logic Fan Yang Department of Mathematics and Statistics University of Helsinki Logical Approaches to Barriers in Complexity II Cambridge, 26-30 March,
More informationLinear-Time Logic. Hao Zheng
Linear-Time Logic Hao Zheng Department of Computer Science and Engineering University of South Florida Tampa, FL 33620 Email: zheng@cse.usf.edu Phone: (813)974-4757 Fax: (813)974-5456 Hao Zheng (CSE, USF)
More informationDescription Logics. Foundations of Propositional Logic. franconi. Enrico Franconi
(1/27) Description Logics Foundations of Propositional Logic Enrico Franconi franconi@cs.man.ac.uk http://www.cs.man.ac.uk/ franconi Department of Computer Science, University of Manchester (2/27) Knowledge
More informationBisimulation for Neighbourhood Structures
Bisimulation for Neighbourhood Structures Helle Hvid Hansen 1,2 Clemens Kupke 2 Eric Pacuit 3 1 Vrije Universiteit Amsterdam (VUA) 2 Centrum voor Wiskunde en Informatica (CWI) 3 Universiteit van Amsterdam
More informationAxiomatisation of Hybrid Logic
Imperial College London Department of Computing Axiomatisation of Hybrid Logic by Louis Paternault Submitted in partial fulfilment of the requirements for the MSc Degree in Advanced Computing of Imperial
More informationFrom Liveness to Promptness
From Liveness to Promptness Orna Kupferman Hebrew University Nir Piterman EPFL Moshe Y. Vardi Rice University Abstract Liveness temporal properties state that something good eventually happens, e.g., every
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 informationKnowable as known after an announcement
RESEARCH REPORT IRIT/RR 2008-2 FR Knowable as known after an announcement Philippe Balbiani 1 Alexandru Baltag 2 Hans van Ditmarsch 1,3 Andreas Herzig 1 Tomohiro Hoshi 4 Tiago de Lima 5 1 Équipe LILAC
More informationconservative social laws.
ECAI 2012 Luc De Raedt et al. (Eds.) 2012 The Author(s). This article is published online with Open Access by IOS Press and distributed under the terms of the Creative Commons Attribution Non-Commercial
More informationTemporal & Modal Logic. Acronyms. Contents. Temporal Logic Overview Classification PLTL Syntax Semantics Identities. Concurrency Model Checking
Temporal & Modal Logic E. Allen Emerson Presenter: Aly Farahat 2/12/2009 CS5090 1 Acronyms TL: Temporal Logic BTL: Branching-time Logic LTL: Linear-Time Logic CTL: Computation Tree Logic PLTL: Propositional
More informationHarmonious Logic: Craig s Interpolation Theorem and its Descendants. Solomon Feferman Stanford University
Harmonious Logic: Craig s Interpolation Theorem and its Descendants Solomon Feferman Stanford University http://math.stanford.edu/~feferman Interpolations Conference in Honor of William Craig 13 May 2007
More informationLTL is Closed Under Topological Closure
LTL is Closed Under Topological Closure Grgur Petric Maretić, Mohammad Torabi Dashti, David Basin Department of Computer Science, ETH Universitätstrasse 6 Zürich, Switzerland Abstract We constructively
More informationPropositional and Predicate Logic - V
Propositional and Predicate Logic - V Petr Gregor KTIML MFF UK WS 2016/2017 Petr Gregor (KTIML MFF UK) Propositional and Predicate Logic - V WS 2016/2017 1 / 21 Formal proof systems Hilbert s calculus
More informationAn Independence Relation for Sets of Secrets
Sara Miner More Pavel Naumov An Independence Relation for Sets of Secrets Abstract. A relation between two secrets, known in the literature as nondeducibility, was originally introduced by Sutherland.
More informationProof Theoretical Studies on Semilattice Relevant Logics
Proof Theoretical Studies on Semilattice Relevant Logics Ryo Kashima Department of Mathematical and Computing Sciences Tokyo Institute of Technology Ookayama, Meguro, Tokyo 152-8552, Japan. e-mail: kashima@is.titech.ac.jp
More informationPropositional and Predicate Logic - VII
Propositional and Predicate Logic - VII Petr Gregor KTIML MFF UK WS 2015/2016 Petr Gregor (KTIML MFF UK) Propositional and Predicate Logic - VII WS 2015/2016 1 / 11 Theory Validity in a theory A theory
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 informationLogics For Epistemic Programs
1 / 48 Logics For Epistemic Programs by Alexandru Baltag and Lawrence S. Moss Chang Yue Dept. of Philosophy PKU Dec. 9th, 2014 / Seminar 2 / 48 Outline 1 Introduction 2 Epistemic Updates and Our Target
More information