Model Checking in the Propositional µ-calculus
|
|
- Randell Dalton
- 6 years ago
- Views:
Transcription
1 Model Checking in the Propositional µ-calculus Ka I Violet Pun INF Specification and Verification of Parallel Systems 13 th May, 2011
2 Overview Model Checking is a useful means to automatically ascertain the specification of a system Use logics to specify the properties of a system Use a decision procedure to decide if the system satisfies the specification Propositional µ-calculus Branching time temporal logic Expressive logic: many branching time logics can be translated into this logic Fully characterize the behaviour of finite-state processes Tableau-based proof system Top-down proofs Determine whether states in a finite-state system satisfy propositions specified in µ-calculus Violet Pun Model Checking in the Propositional µ-calculus 2 / 24
3 Syntax Grammar of the propositions Φ ::= A X Φ Φ Φ a Φ νx.φ formula {Φ,..., } atomic formulas A = {A,..., } propositional variables V = {X,..., } actions symbols Act = {a,..., } propositional connectives and modal operator a recursion operator ν Violet Pun Model Checking in the Propositional µ-calculus 3 / 24
4 Syntax Modal operators in µ-calculus are indexed by an action a [a]φ can be written as a Φ a a b a a b Φ Φ Φ Φ Φ Φ Figure: a Φ Figure: [a]φ Violet Pun Model Checking in the Propositional µ-calculus 4 / 24
5 Syntax Recursion operators are used for recursive formula νx.φ and µx.φ, ν is a greatest fixed point operator µ is a least fixed point operator µx.φ is written as νx. Φ[ X /X ] Syntactic Restrictions on Φ Any occurrence of X in Φ must occur inside the scope of an even number of negation to maintain monotonicity Violet Pun Model Checking in the Propositional µ-calculus 5 / 24
6 Transition System Models of µ-calculus is a labelled transition system A representation of operational behaviour of procecsses S, Act, S is a set of states {s,... } Act is a set of actions {a,... } is a transition relation on S Act S, written as s a s for some state s Violet Pun Model Checking in the Propositional µ-calculus 6 / 24
7 Model of µ-calculus Models for the µ-calculus is a quadruple of the form S, Act,, V S, Act, is a labelled transition system V is a function, called valuation, maps each A A to sets of states where A holds Violet Pun Model Checking in the Propositional µ-calculus 7 / 24
8 Semantics of the propositions Semantics of the µ-calculus is written in the form Φ e A e = V (A) X e = e(x ) Φ e = S Φ e Φ 1 Φ 2 e = Φ 1 e Φ 2 e Remarks a Φ e = ϕ a ( Φ e), where ϕ a (S) = {s s S.s a s} νx.φ e = {S S S Φ e[x S]} 1 e is an environment which maps variables to sets of states 2 e[x S] represents the environment e with variable X replaced by S Violet Pun Model Checking in the Propositional µ-calculus 8 / 24
9 Lattice For any set χ, 2 χ,,, is a complete lattice where 2 χ a set ordering relation 2 χ, is a partially ordered set the least upper bound the greatest lower bound Violet Pun Model Checking in the Propositional µ-calculus 9 / 24
10 Fixed points A fixed point of a function φ over a lattice is φ(s) = S, where S χ and a set of fixed points is written as {S χ φ(s) = S} A greatest fixed point, X, of φ is X {S χ φ(s) = S} X, X {S χ φ(s) = S}, X X A least fixed point, X, of φ is X {S χ φ(s) = S} X, X {S χ φ(s) = S}, X X Violet Pun Model Checking in the Propositional µ-calculus 10 / 24
11 Fixed points A function φ is monotone over a lattice if X 1 X 2 φ(x 1 ) φ(x 2 ) Tarski s Fixed Point Theorem If the function φ over a lattice is monotonic, then it has Greatest fixed point νφ {S χ S φ(s)} Least fixed point µφ {S χ φ(s) S} Violet Pun Model Checking in the Propositional µ-calculus 11 / 24
12 Fixed points For µ-calculus, given an environment e, a function φ is defined by Syntactic Restrictions on Φ φ(s) = Φ e[x S] Any occurrences of X in Φ must occur inside the scope of an even number of negation guarantees function φ over a lattice defined by 2 S to be monotonic, because is anti-monotonic Hence, φ has a greatest fixed point νφ. Violet Pun Model Checking in the Propositional µ-calculus 12 / 24
13 Fixed points 2 S,,, is finite every monotonic function over a finite complete lattice is continuous Kleene s Fixed Point Theorem The greatest/least fixed point of a continuous funtion φ νφ = i=0 φ i µφ = i=0 φ i where φ 0 = S φ i+1 = φ(φ i ) φ 0 = φ i+1 = φ(φ i ) Violet Pun Model Checking in the Propositional µ-calculus 13 / 24
14 Fixed points!!(!! )!!!(!)!}!!!!!!!" =!!!! =!} =!!!!(!)}!" =!!!!!!!!!! =!}!" =!!!! =!} =!!!(!)!}!" =!!!!!!!!!!(!)}!!!!!!!(!! ) Violet Pun Model Checking in the Propositional µ-calculus 14 / 24
15 The Tableau-Based Proof System The proofs are conducted in a top-down fashion: conclusions above premises A decision procedure to determine if states have properties specified Not necessary to examine every state in the system Reuse information computated in one phase of the tableau construction process Violet Pun Model Checking in the Propositional µ-calculus 15 / 24
16 The Tableau-Based Proof System Proof rules operate on sequents Sequents H M s Φ M is a model s is a state from M H is a set of hypotheses {s :Γ} s a state Γ a closed recursive formula written as σ,..., for short Violet Pun Model Checking in the Propositional µ-calculus 16 / 24
17 The Tableau-Based Proof System Tableau for a sequent σ is a maximal proof tree constructed by the tableau rules and having σ as the root Given a sequent σ that is resulting from applying a rule to σ, σ is the child of σ σ is the parent of σ a sequent in a tableau is a leaf if it does not have any children the height of a tableau is the length of the longest sequence σ 0, σ 1,... Violet Pun Model Checking in the Propositional µ-calculus 17 / 24
18 The Tableau-Based Proof System Definition A leaf H s Φ is successful if 1 Φ A and s V (Φ), or 2 Φ is A for some A A and s V (A), or 3 Φ is a Φ for some a and Φ, or 4 Φ is νx.φ when s : νx.φ H for some X and Φ A tableau is successful when all its leaves are successful A sequent σ has a proof if it has a successful tableau Violet Pun Model Checking in the Propositional µ-calculus 18 / 24
19 Tableau rules for the propositional µ-calculus H s Φ H s Φ 1 Φ 2 R1 R2 H s Φ H s Φ 1 H s Φ 1 Φ 2 H s (Φ 1 Φ 2 ) R3 R4 H s Φ 2 H s Φ 1, H s Φ 2 H s a Φ R5 (s {s s a s }) H s Φ H s a Φ R6 ({s 1, s 2,...} = {s s a s }) H s 1 Φ, H s 2 Φ,... H s νx.φ R7 (s : νx.φ H) H {s : νx.φ} s Φ[νX.Φ/X ] H s νx.φ R8 (s : νx.φ H) H {s : νx.φ} s Φ[νX.Φ/X ] where H = H {s : Γ νx.φ Γ} Violet Pun Model Checking in the Propositional µ-calculus 19 / 24
20 Tableau rules for the propositional µ-calculus R7 H s νx.φ (s : νx.φ H) H {s : νx.φ} s Φ[νX.Φ/X ] where H = H {s : Γ νx.φ Γ} A state satisifes a recursive property if it satisfies the unrolling of the property. Assumptions involving formulas having the the recursive formula as a subformula are removed. Violet Pun Model Checking in the Propositional µ-calculus 20 / 24
21 Model Checking Algorithm Example algorithm: a simple straightforward procedure Violet Pun Model Checking in the Propositional µ-calculus 21 / 24
22 Model Checking Algorithm The simple algorithm is not efficient Reason: Exponential behaviour for formulas Nested modal operator No provision for storing the reseults of sequents whose truth has been determined Violet Pun Model Checking in the Propositional µ-calculus 22 / 24
23 Possible solution Save the result from the previous computation and look it up later Truth of sequents can be deduced solely based on the truth of the other sequents Suppose that H s νx.φ has a successful tableau. Then H {s : νx.φ} s Γ has a successful tableau if and only if H s Γ does. Violet Pun Model Checking in the Propositional µ-calculus 23 / 24
24 References I [Cleaveland, 1990] Cleaveland, R. (1990). Tableau-based model checking in the propositional mu-calculus. Acta Informatica, 27: [Emerson, 1997] Emerson, E. A. (1997). Model checking and the mu-calculus. In DIMACS Series in Discrete Mathematics, pages American Mathematical Society. [Nielson et al., 1999] Nielson, F., Nielson, H.-R., and Hankin, C. L. (1999). Principles of Program Analysis. Springer-Verlag. Violet Pun Model Checking in the Propositional µ-calculus 24 / 24
Introduction 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 informationA Tableau Proof System with Names for Modal Mu-calculus
A Tableau Proof System with Names for Modal Mu-calculus School of Informatics University of Edinburgh Edinburgh, UK cps@inf.ed.ac.uk Abstract Howard Barringer was a pioneer in the study of temporal logics
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 informationA Tableau-Based Decision Procedure for Right Propositional Neighborhood Logic (RPNL )
A Tableau-Based Decision Procedure for Right Propositional Neighborhood Logic (RPNL ) Davide Bresolin Angelo Montanari Dipartimento di Matematica e Informatica Università degli Studi di Udine {bresolin,
More informationPropositional Calculus - Semantics (3/3) Moonzoo Kim CS Dept. KAIST
Propositional Calculus - Semantics (3/3) Moonzoo Kim CS Dept. KAIST moonzoo@cs.kaist.ac.kr 1 Overview 2.1 Boolean operators 2.2 Propositional formulas 2.3 Interpretations 2.4 Logical Equivalence and substitution
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 informationLOGIC PROPOSITIONAL REASONING
LOGIC PROPOSITIONAL REASONING WS 2017/2018 (342.208) Armin Biere Martina Seidl biere@jku.at martina.seidl@jku.at Institute for Formal Models and Verification Johannes Kepler Universität Linz Version 2018.1
More informationPropositional Logic: Deductive Proof & Natural Deduction Part 1
Propositional Logic: Deductive Proof & Natural Deduction Part 1 CS402, Spring 2016 Shin Yoo Deductive Proof In propositional logic, a valid formula is a tautology. So far, we could show the validity of
More informationHelsinki University of Technology Laboratory for Theoretical Computer Science Research Reports 99
Helsinki University of Technology Laboratory for Theoretical Computer Science Research Reports 99 Teknillisen korkeakoulun tietojenkäsittelyteorian laboratorion tutkimusraportti 99 Espoo 2005 HUT-TCS-A99
More informationDeciding the First Levels of the Modal µ Alternation Hierarchy by Formula Construction
Deciding the First Levels of the Modal µ Alternation Hierarchy by Formula Construction Karoliina Lehtinen and Sandra Quickert Laboratory for Foundations of Computer Science, University of Edinburgh 10
More informationPropositional Calculus - Natural deduction Moonzoo Kim CS Dept. KAIST
Propositional Calculus - Natural deduction Moonzoo Kim CS Dept. KAIST moonzoo@cs.kaist.ac.kr 1 Review Goal of logic To check whether given a formula Á is valid To prove a given formula Á ` Á Syntactic
More informationA tableau-based decision procedure for a branching-time interval temporal logic
A tableau-based decision procedure for a branching-time interval temporal logic Davide Bresolin Angelo Montanari Dipartimento di Matematica e Informatica Università degli Studi di Udine {bresolin, montana}@dimi.uniud.it
More informationŁukasz Kaiser Joint work with Diana Fischer and Erich Grädel
Quantitative Systems, Modal Logics and Games Łukasz Kaiser Joint work with Diana Fischer and Erich Grädel Mathematische Grundlagen der Informatik RWTH Aachen AlgoSyn, February 28 Quantitative Systems (Łukasz
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 informationTemporal Logic Model Checking
18 Feb, 2009 Thomas Wahl, Oxford University Temporal Logic Model Checking 1 Temporal Logic Model Checking Thomas Wahl Computing Laboratory, Oxford University 18 Feb, 2009 Thomas Wahl, Oxford University
More informationComputational Logic. Davide Martinenghi. Spring Free University of Bozen-Bolzano. Computational Logic Davide Martinenghi (1/30)
Computational Logic Davide Martinenghi Free University of Bozen-Bolzano Spring 2010 Computational Logic Davide Martinenghi (1/30) Propositional Logic - sequent calculus To overcome the problems of natural
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 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 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 informationPropositional logic. Programming and Modal Logic
Propositional logic Programming and Modal Logic 2006-2007 4 Contents Syntax of propositional logic Semantics of propositional logic Semantic entailment Natural deduction proof system Soundness and completeness
More informationPart 1: Propositional Logic
Part 1: Propositional Logic Literature (also for first-order logic) Schöning: Logik für Informatiker, Spektrum Fitting: First-Order Logic and Automated Theorem Proving, Springer 1 Last time 1.1 Syntax
More informationModel Checking for the -calculus. Paolo Zuliani , Spring 2011
Model Checking for the -calculus Paolo Zuliani 15-817, Spring 2011 Outline What is the -calculus? Semantics Model Checking algorithms [Other fixpoint theorems] The -calculus A language for describing properties
More informationPrefixed Tableaus and Nested Sequents
Prefixed Tableaus and Nested Sequents Melvin Fitting Dept. Mathematics and Computer Science Lehman College (CUNY), 250 Bedford Park Boulevard West Bronx, NY 10468-1589 e-mail: melvin.fitting@lehman.cuny.edu
More informationPropositional Logic: Evaluating the Formulas
Institute for Formal Models and Verification Johannes Kepler University Linz VL Logik (LVA-Nr. 342208) Winter Semester 2015/2016 Propositional Logic: Evaluating the Formulas Version 2015.2 Armin Biere
More informationDeductive Systems. Lecture - 3
Deductive Systems Lecture - 3 Axiomatic System Axiomatic System (AS) for PL AS is based on the set of only three axioms and one rule of deduction. It is minimal in structure but as powerful as the truth
More informationQuery Reasoning on Data Trees with Counting
Query Reasoning on Data Trees with Counting Everardo Bárcenas 1,2, Edgard Benítez-Guerrero 2, and Jesús Lavalle 3,4 1 CONACYT 2 Universidad Veracruzana 3 Benemérita Universidad Autónoma de Puebla 4 Instituto
More informationComp487/587 - Boolean Formulas
Comp487/587 - Boolean Formulas 1 Logic and SAT 1.1 What is a Boolean Formula Logic is a way through which we can analyze and reason about simple or complicated events. In particular, we are interested
More informationTemporal logics and explicit-state model checking. Pierre Wolper Université de Liège
Temporal logics and explicit-state model checking Pierre Wolper Université de Liège 1 Topics to be covered Introducing explicit-state model checking Finite automata on infinite words Temporal Logics and
More informationVerifying Properties of Neural Networks
Verifying Properties of Neural Networks Pedro Rodrigues 1, J. Félix Costa 2, and Hava T. Siegelmann 3 1 Departamento de Informática, Faculdade de Ciências da Universidade de Lisboa, Campo Grande, 1749-016
More informationA Resolution Method for Modal Logic S5
EPiC Series in Computer Science Volume 36, 2015, Pages 252 262 GCAI 2015. Global Conference on Artificial Intelligence A Resolution Method for Modal Logic S5 Yakoub Salhi and Michael Sioutis Université
More informationCS156: The Calculus of Computation
CS156: The Calculus of Computation Zohar Manna Winter 2010 It is reasonable to hope that the relationship between computation and mathematical logic will be as fruitful in the next century as that between
More informationComputation Tree Logic (CTL) & Basic Model Checking Algorithms
Computation Tree Logic (CTL) & Basic Model Checking Algorithms Martin Fränzle Carl von Ossietzky Universität Dpt. of Computing Science Res. Grp. Hybride Systeme Oldenburg, Germany 02917: CTL & Model Checking
More informationA 3 Valued Contraction Model Checking Game: Deciding on the World of Partial Information
A 3 Valued Contraction Model Checking Game: Deciding on the World of Partial Information Jandson S. Ribeiro and Aline Andrade Distributed Systems Laboratory (LaSiD) Computer Science Department Mathematics
More informationA refined calculus for Intuitionistic Propositional Logic
A refined calculus for Intuitionistic Propositional Logic Mauro Ferrari 1, Camillo Fiorentini 2, Guido Fiorino 3 1 Dipartimento di Informatica e Comunicazione, Università degli Studi dell Insubria Via
More informationAn optimal tableau-based decision algorithm for Propositional Neighborhood Logic
An optimal tableau-based decision algorithm for Propositional Neighborhood Logic Davide Bresolin, Angelo Montanari, and Pietro Sala Department of Mathematics and Computer Science, University of Udine,
More informationThe Calculus of Computation: Decision Procedures with Applications to Verification. Part I: FOUNDATIONS. by Aaron Bradley Zohar Manna
The Calculus of Computation: Decision Procedures with Applications to Verification Part I: FOUNDATIONS by Aaron Bradley Zohar Manna 1. Propositional Logic(PL) Springer 2007 1-1 1-2 Propositional Logic(PL)
More informationCSCE 222 Discrete Structures for Computing. Propositional Logic. Dr. Hyunyoung Lee. !!!!!! Based on slides by Andreas Klappenecker
CSCE 222 Discrete Structures for Computing Propositional Logic Dr. Hyunyoung Lee Based on slides by Andreas Klappenecker 1 Propositions A proposition is a declarative sentence that is either true or false
More informationNatural Deduction. Formal Methods in Verification of Computer Systems Jeremy Johnson
Natural Deduction Formal Methods in Verification of Computer Systems Jeremy Johnson Outline 1. An example 1. Validity by truth table 2. Validity by proof 2. What s a proof 1. Proof checker 3. Rules of
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 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 informationLecture 10: Gentzen Systems to Refinement Logic CS 4860 Spring 2009 Thursday, February 19, 2009
Applied Logic Lecture 10: Gentzen Systems to Refinement Logic CS 4860 Spring 2009 Thursday, February 19, 2009 Last Tuesday we have looked into Gentzen systems as an alternative proof calculus, which focuses
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 informationFixpoint Extensions of Temporal Description Logics
Fixpoint Extensions of Temporal Description Logics Enrico Franconi Faculty of Computer Science Free University of Bozen-Bolzano, Italy franconi@inf.unibz.it David Toman School of Computer Science University
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 informationThe Modal µ-calculus Caught Off Guard
The Modal µ-calculus Caught Off Guard Oliver Friedmann 1 and Martin Lange 2 1 Dept. of Computer Science, University of Munich, Germany 2 Dept. of Elect. Eng. and Computer Science, University of Kassel,
More informationPropositional Calculus - Deductive Systems
Propositional Calculus - Deductive Systems Moonzoo Kim CS Division of EECS Dept. KAIST moonzoo@cs.kaist.ac.kr http://pswlab.kaist.ac.kr/courses/cs402-07 1 Deductive proofs (1/3) Suppose we want to know
More informationPropositional logic. Programming and Modal Logic
Propositional logic Programming and Modal Logic 2006-2007 4 Contents Syntax of propositional logic Semantics of propositional logic Semantic entailment Natural deduction proof system Soundness and completeness
More informationThe Importance of Being Formal. Martin Henz. February 5, Propositional Logic
The Importance of Being Formal Martin Henz February 5, 2014 Propositional Logic 1 Motivation In traditional logic, terms represent sets, and therefore, propositions are limited to stating facts on sets
More informationPart 1: Propositional Logic
Part 1: Propositional Logic Literature (also for first-order logic) Schöning: Logik für Informatiker, Spektrum Fitting: First-Order Logic and Automated Theorem Proving, Springer 1 Last time 1.1 Syntax
More informationA Tableau Calculus for Minimal Modal Model Generation
M4M 2011 A Tableau Calculus for Minimal Modal Model Generation Fabio Papacchini 1 and Renate A. Schmidt 2 School of Computer Science, University of Manchester Abstract Model generation and minimal model
More informationModel Checking & Program Analysis
Model Checking & Program Analysis Markus Müller-Olm Dortmund University Overview Introduction Model Checking Flow Analysis Some Links between MC and FA Conclusion Apology for not giving proper credit to
More informationReckhow s Theorem. Yuval Filmus. November 2010
Reckhow s Theorem Yuval Filmus November 2010 1 Introduction In 5.3.1 of his thesis [2], Reckhow showed that any two Frege systems p-simulate each other. One of the difficulties involves translation of
More informationFixed-point elimination in Heyting algebras 1
1/32 Fixed-point elimination in Heyting algebras 1 Silvio Ghilardi, Università di Milano Maria João Gouveia, Universidade de Lisboa Luigi Santocanale, Aix-Marseille Université TACL@Praha, June 2017 1 See
More informationSome model theory for the modal µ-calculus: syntactic characterisations of semantic properties
Some model theory for the modal µ-calculus: syntactic characterisations of semantic properties Gaëlle Fontaine Yde Venema Institute for Logic, Language and Computation Universiteit van Amsterdam The Netherlands
More information2.5.2 Basic CNF/DNF Transformation
2.5. NORMAL FORMS 39 On the other hand, checking the unsatisfiability of CNF formulas or the validity of DNF formulas is conp-complete. For any propositional formula φ there is an equivalent formula in
More informationFirst-Order Logic. Chapter Overview Syntax
Chapter 10 First-Order Logic 10.1 Overview First-Order Logic is the calculus one usually has in mind when using the word logic. It is expressive enough for all of mathematics, except for those concepts
More informationCTL-RP: A Computational Tree Logic Resolution Prover
1 -RP: A Computational Tree Logic Resolution Prover Lan Zhang a,, Ullrich Hustadt a and Clare Dixon a a Department of Computer Science, University of Liverpool Liverpool, L69 3BX, UK E-mail: {Lan.Zhang,
More informationOn Modal µ-calculus And Non-Well-Founded Set Theory
On Modal µ-calculus And Non-Well-Founded Set Theory Luca Alberucci (albe@iam.unibe.ch) and Vincenzo Salipante (salipant@iam.unibe.ch) Institut für Informatik und angewandte Mathematik, Universität Bern,
More informationPROPOSITIONAL MIXED LOGIC: ITS SYNTAX AND SEMANTICS
PROPOSITIONAL MIXED LOGIC: ITS SYNTAX AND SEMANTICS Karim NOUR 1 and Abir NOUR 2 Abstract In this paper, we present a propositional logic (called mixed logic) containing disjoint copies of minimal, intuitionistic
More informationParameter Synthesis for Timed Kripke Structures
Parameter Synthesis for Timed Kripke Structures Extended Abstract Micha l Knapik 1 and Wojciech Penczek 1,2 1 Institute of Computer Science, PAS, Warsaw, Poland 2 University of Natural Sciences and Humanities,
More informationMathematics for linguists
Mathematics for linguists WS 2009/2010 University of Tübingen January 7, 2010 Gerhard Jäger Mathematics for linguists p. 1 Inferences and truth trees Inferences (with a finite set of premises; from now
More informationProgram Schemata Technique to Solve Propositional Program Logics Revised
Program Schemata Technique to Solve Propositional Program Logics Revised Nikolay Shilov A.P. Ershov Institute of Informatics Systems, Russian Academy of Sciences Lavren ev av. 6, 630090 Novosibirsk, Russia
More informationPropositional Logic Language
Propositional Logic Language A logic consists of: an alphabet A, a language L, i.e., a set of formulas, and a binary relation = between a set of formulas and a formula. An alphabet A consists of a finite
More informationPropositional Logics and their Algebraic Equivalents
Propositional Logics and their Algebraic Equivalents Kyle Brooks April 18, 2012 Contents 1 Introduction 1 2 Formal Logic Systems 1 2.1 Consequence Relations......................... 2 3 Propositional Logic
More informationModel Checking Fixed Point Logic with Chop
Model Checking Fixed Point Logic with Chop Martin Lange and Colin Stirling Laboratory for Foundations of Computer Science Division of Informatics University of Edinburgh {martin,cps}@dcs.ed.ac.uk Abstract.
More informationFrom Frame Properties to Hypersequent Rules in Modal Logics
From Frame Properties to Hypersequent Rules in Modal Logics Ori Lahav School of Computer Science Tel Aviv University Tel Aviv, Israel Email: orilahav@post.tau.ac.il Abstract We provide a general method
More informationMonodic fragments of first-order temporal logics
Outline of talk Most propositional temporal logics are decidable. But the decision problem in predicate (first-order) temporal logics has seemed near-hopeless. Monodic fragments of first-order temporal
More informationModel checking (III)
Theory and Algorithms Model checking (III) Alternatives andextensions Rafael Ramirez rafael@iua.upf.es Trimester1, Oct2003 Slide 9.1 Logics for reactive systems The are many specification languages for
More informationSemantics for Propositional Logic
Semantics for Propositional Logic An interpretation (also truth-assignment, valuation) of a set of propositional formulas S is a function that assigns elements of {f,t} to the propositional variables in
More informationThe logic of Σ formulas
The logic of Σ formulas Andre Kornell UC Davis BLAST August 10, 2018 Andre Kornell (UC Davis) The logic of Σ formulas BLAST August 10, 2018 1 / 22 the Vienna Circle The meaning of a proposition is the
More informationSYNTACTIC CHARACTERISATIONS OF SEMANTIC PROPERTIES
Logical Methods in Computer Science Vol. 14(1:14)2018, pp. 1 51 https://lmcs.episciences.org/ Submitted Nov. 24, 2010 Published Feb. 06, 2018 SOME MODEL THEORY FOR THE MODAL µ-calculus: SYNTACTIC CHARACTERISATIONS
More informationDecision procedure for Default Logic
Decision procedure for Default Logic W. Marek 1 and A. Nerode 2 Abstract Using a proof-theoretic approach to non-monotone reasoning we introduce an algorithm to compute all extensions of any (propositional)
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 informationProving Completeness for Nested Sequent Calculi 1
Proving Completeness for Nested Sequent Calculi 1 Melvin Fitting abstract. Proving the completeness of classical propositional logic by using maximal consistent sets is perhaps the most common method there
More informationGuest lecturer: Mark Reynolds, The University of Western Australia
Università degli studi di Udine Laurea Magistrale: Informatica Lectures for April/May 2014 La verifica del software: temporal logic Lecture 05 CTL Satisfiability via tableau Guest lecturer: Mark Reynolds,
More informationPropositional Calculus - Soundness & Completeness of H
Propositional Calculus - Soundness & Completeness of H Moonzoo Kim CS Dept. KAIST moonzoo@cs.kaist.ac.kr 1 Review Goal of logic To check whether given a formula Á is valid To prove a given formula Á `
More informationAn Algorithm for Automatic Demonstration of Logical Theorems
An Algorithm for Automatic Demonstration of Logical Theorems Orlando Zaldivar-Zamorategui Jorge Carrera-Bolaños Abstract. The automatic demonstration of theorems (ADT) is and has been an area of intensive
More informationRevising Specifications with CTL Properties using Bounded Model Checking
Revising Specifications with CTL Properties using Bounded Model Checking No Author Given No Institute Given Abstract. During the process of software development, it is very common that inconsistencies
More informationCourse Runtime Verification
Course Martin Leucker (ISP) Volker Stolz (Høgskolen i Bergen, NO) INF5140 / V17 Chapters of the Course Chapter 1 Recall in More Depth Chapter 2 Specification Languages on Words Chapter 3 LTL on Finite
More information03 Propositional Logic II
Martin Henz February 12, 2014 Generated on Wednesday 12 th February, 2014, 09:49 1 Review: Syntax and Semantics of Propositional Logic 2 3 Propositional Atoms and Propositions Semantics of Formulas Validity,
More informationNested Epistemic Logic Programs
Nested Epistemic Logic Programs Kewen Wang 1 and Yan Zhang 2 1 Griffith University, Australia k.wang@griffith.edu.au 2 University of Western Sydney yan@cit.uws.edu.au Abstract. Nested logic programs and
More informationOptimal Tableaux for Right Propositional Neighborhood Logic over Linear Orders
Optimal Tableaux for Right Propositional Neighborhood Logic over Linear Orders Davide Bresolin 1, Angelo Montanari 2, Pietro Sala 2, and Guido Sciavicco 3 1 Department of Computer Science, University of
More informationTableau vs. Sequent Calculi for Minimal Entailment
Electronic Colloquium on Computational Complexity, Report No. 32 (2014) Tableau vs. Sequent Calculi for Minimal Entailment Olaf Beyersdorff and Leroy Chew School of Computing, University of Leeds, UK Abstract.
More informationIntroduction to Logic in Computer Science: Autumn 2006
Introduction to Logic in Computer Science: Autumn 2006 Ulle Endriss Institute for Logic, Language and Computation University of Amsterdam Ulle Endriss 1 Plan for Today The first part of the course will
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 informationFirst-order Temporal Logic with Fixpoint Operators. over the Natural Numbers. Konstantinos Mamouras
Imperial College London Department of Computing First-order Temporal Logic with Fixpoint Operators over the Natural Numbers by Konstantinos Mamouras Submitted in partial fulfilment of the requirements
More informationLING 501, Fall 2004: Laws of logic and the definitions of the connectives
LING 501, Fall 2004: Laws of logic and the definitions of the connectives Modified October 24, adding a test yourself section at the end. Modified October 21, correcting errors noted in class on October
More informationChapter 11: Automated Proof Systems
Chapter 11: Automated Proof Systems SYSTEM RS OVERVIEW Hilbert style systems are easy to define and admit a simple proof of the Completeness Theorem but they are difficult to use. Automated systems are
More informationOn Sequent Calculi for Intuitionistic Propositional Logic
On Sequent Calculi for Intuitionistic Propositional Logic Vítězslav Švejdar Jan 29, 2005 The original publication is available at CMUC. Abstract The well-known Dyckoff s 1992 calculus/procedure for intuitionistic
More informationTowards the use of Simplification Rules in Intuitionistic Tableaux
Towards the use of Simplification Rules in Intuitionistic Tableaux Mauro Ferrari 1, Camillo Fiorentini 2 and Guido Fiorino 3 1 Dipartimento di Informatica e Comunicazione, Università degli Studi dell Insubria,
More informationPROOFS IN PREDICATE LOGIC AND COMPLETENESS; WHAT DECIDABILITY MEANS HUTH AND RYAN 2.3, SUPPLEMENTARY NOTES 2
PROOFS IN PREDICATE LOGIC AND COMPLETENESS; WHAT DECIDABILITY MEANS HUTH AND RYAN 2.3, SUPPLEMENTARY NOTES 2 Neil D. Jones DIKU 2005 12 September, 2005 Some slides today new, some based on logic 2004 (Nils
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 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 informationCS156: The Calculus of Computation Zohar Manna Autumn 2008
Page 3 of 52 Page 4 of 52 CS156: The Calculus of Computation Zohar Manna Autumn 2008 Lecturer: Zohar Manna (manna@cs.stanford.edu) Office Hours: MW 12:30-1:00 at Gates 481 TAs: Boyu Wang (wangboyu@stanford.edu)
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 informationModel checking the basic modalities of CTL with Description Logic
Model checking the basic modalities of CTL with Description Logic Shoham Ben-David Richard Trefler Grant Weddell David R. Cheriton School of Computer Science University of Waterloo Abstract. Model checking
More informationPropositional Logic: Models and Proofs
Propositional Logic: Models and Proofs C. R. Ramakrishnan CSE 505 1 Syntax 2 Model Theory 3 Proof Theory and Resolution Compiled at 11:51 on 2016/11/02 Computing with Logic Propositional Logic CSE 505
More informationMaximal Introspection of Agents
Electronic Notes in Theoretical Computer Science 70 No. 5 (2002) URL: http://www.elsevier.nl/locate/entcs/volume70.html 16 pages Maximal Introspection of Agents Thomas 1 Informatics and Mathematical Modelling
More informationPartial model checking via abstract interpretation
Partial model checking via abstract interpretation N. De Francesco, G. Lettieri, L. Martini, G. Vaglini Università di Pisa, Dipartimento di Ingegneria dell Informazione, sez. Informatica, Via Diotisalvi
More information