Symbolic CTL Model Checking
|
|
- Joy Daniels
- 5 years ago
- Views:
Transcription
1 Symbolic CTL Model Checking Crystal Chang Din Precise Modeling and Analysis group (PMA), University of Oslo INF Specification and Verification of Parallel Systems Crystal Chang UiO Symbolic CTL Model Checking / 27
2 Outline 1 Computation Tree Logic (CTL) 2 CTL Model Checking Algorithm 3 Symbolic CTL Model Checking Crystal Chang UiO Symbolic CTL Model Checking / 27
3 Recall of LTL A linear logic over an infinite sequence of states. Crystal Chang UiO Symbolic CTL Model Checking / 27
4 Transition System and Computation Tree Assume TS is finite, and has no terminal states, we can unfold it at a chosen state into an infinite computation tree. CTL introduces two path quantifiers: : all computations that start in a state (implicitly expressed in LTL) : some computations that start in a state (cannot be expressed in LTL) Crystal Chang UiO Symbolic CTL Model Checking / 27
5 Some Basic CTL Formulae Crystal Chang UiO Symbolic CTL Model Checking / 27
6 Syntax of CTL State formulae: Φ ::= true α Φ Φ 1 Φ 2 ϕ ϕ where α AP (atomic proposition) Path formulae: ϕ ::= Φ Φ 1 U Φ 2 Four possible ways to turn path formulae into state formulae: U U Crystal Chang UiO Symbolic CTL Model Checking / 27
7 Examples of CTL formulae Illegal CTL formulae (x = 1 y > 4) (true U (x = 1)) Legal CTL formulae (x = 1 y > 4) (true U (x = 1)) Crystal Chang UiO Symbolic CTL Model Checking / 27
8 Derived Temporal Modalities eventually Φ (true U Φ) Φ holds potentially Φ (true U Φ) Φ is inevitable always Φ Φ ( Φ) potentially always Φ Φ Φ ( Φ) invariantly Φ Crystal Chang UiO Symbolic CTL Model Checking / 27
9 Satisfaction Relation for CTL Let transition system TS = (S,Act,,I,AP,L), state s S, α be an atomic proposition, Φ 1, Φ 2 be CTL state formulae, and ϕ be a CTL path formulae. The satisfaction relation is defined for state formulae by s α iff α L(s) s Φ iff not s Φ s Φ 1 Φ 2 iff (s Φ 1 ) and (s Φ 2 ) s ϕ iff π ϕ for some π Path(s) s ϕ iff π ϕ for all π Path(s) For path π, the satisfaction relation for path formulae is defined by π Φ iff π[1] Φ π Φ 1 U Φ 2 iff j 0. (π[j] Φ 2 ( 0 k < j.π[k] Φ 1 )) Crystal Chang UiO Symbolic CTL Model Checking / 27
10 Expressiveness of CTL vs. LTL Intuitively, the LTL formula α is equivalent to the CTL formula α. However, s 0 α and s 0 α are shown in the following case. 1 α: α will eventually forever hold from some state 2 α: On any computation, eventually some state, s say, is reached such that s α Crystal Chang UiO Symbolic CTL Model Checking / 27
11 Satisfaction Set Given a transition system TS, the satisfaction set Sat(Φ) for CTL-state formula Φ is defined by: For example: Sat(Φ) = { s S s Φ} Sat( a) = {s 3 } Crystal Chang UiO Symbolic CTL Model Checking / 27
12 CTL Semantics for Transition System TS Φ iff s 0 I. s 0 Φ in other words, TS Φ iff I Sat(Φ) Crystal Chang UiO Symbolic CTL Model Checking / 27
13 Outline 1 Computation Tree Logic (CTL) 2 CTL Model Checking Algorithm 3 Symbolic CTL Model Checking Crystal Chang UiO Symbolic CTL Model Checking / 27
14 CTL in Existential Normal Form (ENF) Φ ::= true α Φ Φ 1 Φ 2 Φ ( Φ 1 U Φ 2 ) Φ Other CTL formulae can be translated into equivalent ENF formulae: Φ (true U Φ) Φ Φ (Φ 1 U Φ 2 ) ( Φ 2 U ( Φ 1 Φ 2 )) Φ 2 Φ Φ Φ Φ = (true U Φ) CTL in ENF has the same expressiveness as CTL We will use ENF of CTL in the model checking algorithm Crystal Chang UiO Symbolic CTL Model Checking / 27
15 Overview of the Algorithm To verify for a given transition system TS and CTL formula Φ whether TS Φ, the procedure is: 1 recursive computation of the sets Sat(Ψ) for all subformulae Ψ of Φ 2 checking whether I Sat(Φ) Crystal Chang UiO Symbolic CTL Model Checking / 27
16 Computation of the Satisfaction Sets Crystal Chang UiO Symbolic CTL Model Checking / 27
17 Sat( Φ) T 0 = Sat(Φ) and T i+1 = T i {s Sat(Φ) Post(s) T i } until T i+1 = T i (reach the greatest fix point) i.e. Sat( b) = {s 0, s 2, s 4 } Crystal Chang UiO Symbolic CTL Model Checking / 27
18 Sat( (Φ 1 U Φ 2 )) T 0 = Sat(Φ 2 ) and T i+1 = T i {s Sat(Φ 1 ) Post(s) T i } until T i+1 = T i (reach the smallest fix point) i.e. Sat( (true U (a = c) (a b))) = {s 4, s 5, s 6, s 7 } Crystal Chang UiO Symbolic CTL Model Checking / 27
19 Time Complexity Let TS be a finite transition system with N states and K transitions. Ψ a subformula of Φ. The time complexity of calculating Sat(Ψ) is O(N+K) Also, there are Φ subformulae of Φ. The total time complexity of calculating Sat(Φ) is therefore O((N+K) Φ ) Crystal Chang UiO Symbolic CTL Model Checking / 27
20 Outline 1 Computation Tree Logic (CTL) 2 CTL Model Checking Algorithm 3 Symbolic CTL Model Checking Crystal Chang UiO Symbolic CTL Model Checking / 27
21 Why Symbolic? Original version of CTL model checking single state and single transition at a time record all the predecessors and successors in each state iterative computation: union and intersection of sets state explosion problem in large transition systems Symbolic version sets of states and sets of transitions at a time binary encoding of states one boolean function for each satisfaction set one boolean function for all the transitions iterative computation:conjunction and disjunction of a sequence of bits very efficient Crystal Chang UiO Symbolic CTL Model Checking / 27
22 Encoding States Binary encoding (enc) of states, as vectors of n bits: enc : S {0, 1} n For example: 8 states (s 0, s 1,..., s 7 ) can be encoded with 3 bits s 0 : 000 s 1 : s 7 : 111 Crystal Chang UiO Symbolic CTL Model Checking / 27
23 Two Boolean Functions (X T and ) X T : to encode set of states T S (i.e. T=Sat(α)): X T : {0, 1} n {0,1} s.t. X T (s)=1 iff s T : to encode set of transitions S x S: : {0, 1} 2n {0,1} s.t. (s,s )=1 iff s s Crystal Chang UiO Symbolic CTL Model Checking / 27
24 Sat( b) in Symbolic Version binary decision tree (BDT) 8 states (s 0, s 1,..., s 7 ) can be encoded with 3 bits (z 1 z 2 z 3 ) X T (z 1, z 2, z 3 ) {0,1},T=Sat(b) i.e. X T (s 2 ) = X T (0,1,0) = 1 (z 1, z 2, z 3, z 1, z 2, z 3 ) {0,1} i.e. (s 1, s 2 ) = (0,0,1,0,1,0) = 0 Crystal Chang UiO Symbolic CTL Model Checking / 27
25 Symbolic Computation T 0 = Sat(Φ 2 ) and T i+1 = T i {s Sat(Φ 1 ) Post(s) T i } T 0 = Sat(Φ) and T i+1 = T i {s Sat(Φ) Post(s) T i } continue the example from last slide: f 0 : f 1 : f 2 : Crystal Chang UiO Symbolic CTL Model Checking / 27
26 From BDT to BDD binary decision diagram (BDD): a reduced version of BDT Crystal Chang UiO Symbolic CTL Model Checking / 27
27 Reference C. Baier and J.-P. Katoen, Principles of Model Checking (The MIT Press, 2008). Figures, algorithms and samples taken from Chapter 6 of the book above. Crystal Chang UiO Symbolic CTL Model Checking / 27
Hoare Logic and Model Checking. LTL and CTL: a perspective. Learning outcomes. Model Checking Lecture 12: Loose ends
Learning outcomes Hoare Logic and Model Checking Model Checking Lecture 12: Loose ends Dominic Mulligan Based on previous slides by Alan Mycroft and Mike Gordon Programming, Logic, and Semantics Group
More informationComputation Tree Logic vs. Linear Temporal Logic. Slides from Robert Bellarmine Krug University of Texas at Austin
Computation Tree Logic vs. Linear Temporal Logic Slides from Robert Bellarmine Krug University of Texas at Austin CTL vs. LTL (2 / 40) Outline 1. Some Definitions And Notation 2. LTL 3. CTL 4. CTL vs.
More informationComputational Tree Logic and Model Checking A simple introduction. F. Raimondi
Computational Tree Logic and Model Checking A simple introduction F. Raimondi I am Franco Raimondi, f.raimondi@cs.ucl.ac.uk Slides, coursework, coursework solutions can be found online: http://www.cs.ucl.ac.uk/staff/f.raimondi/
More informationLinear-Time vs. Branching-Time Properties
EE 144/244: Fundamental Algorithms for System Modeling, Analysis, and Optimization Fall 2014 Temporal logic CTL Stavros Tripakis University of California, Berkeley Stavros Tripakis (UC Berkeley) EE 144/244,
More informationLecture 7: Computation Tree Logics
Lecture 7: Computation Tree Loics Model of Computation Computation Tree Loics The Loic CTL Path Formulas and State Formulas CTL and LTL Expressive Power of Loics 1 Model of Computation a b State Transition
More informationLecture 2: Linear vs. Branching time. Temporal Logics: CTL, CTL*. CTL model checking algorithm. Counter-example generation.
CS 267: Automated Verification Lecture 2: Linear vs. Branching time. Temoral Logics: CTL, CTL*. CTL model checking algorithm. Counter-examle generation. Instructor: Tevfik Bultan Linear Time vs. Branching
More informationA Constraint-based Approach to Medical Guidelines and Protocols
A Constraint-based Approach to Medical Guidelines and Protocols Arjen Hommersom 1, Perry Groot 1, Peter Lucas 1 Mar Marcos 2, and Begoña Martínez-Salvador 2 1 University of Nijmegen {arjenh, perry, peterl}@cs.ru.nl
More informationA Unified View of Consequence Relation, Belief Revision and Conditional Logic
A Unified View of Consequence Relation, Belief Revision and Conditional Logic Hirofumi Katsuno NTT Basic Research Laboratories Musashinoshi, Tokyo 180 Japan katsuno(dntt-20.ntt. jp Ken Satoh ICOT Research
More informationChoice of Temporal Logic Specifications. Narayanan Sundaram EE219C Lecture
Choice of Temporal Logic Specifications Narayanan Sundaram EE219C Lecture 1 CTL Vs LTL The Final Showdown 2 Why should we choose one over the other? Expressiveness Clarity/Intuitiveness Algorithmic Complexity
More informationReview: Logistic regression, Gaussian naïve Bayes, linear regression, and their connections
Review: Logistic regression, Gaussian naïve Bayes, linear regression, and their connections New: Bias-variance decomposition, biasvariance tradeoff, overfitting, regularization, and feature selection Yi
More informationComprehensive Mitigation Framework for Concurrent Application of Multiple Clinical Practice Guidelines
Comprehensive Mitigation Framework for Concurrent Application of Multiple Clinical Practice Guidelines Szymon Wilk a,b,, Martin Michalowski c, Wojtek Michalowski b, Daniela Rosu b, Marc Carrier d, Mounira
More information5. Suppose there are 4 new cases of breast cancer in group A and 5 in group B. 1. Sample space: the set of all possible outcomes of an experiment.
Probability January 15, 2013 Debdeep Pati Introductory Example Women in a given age group who give birth to their first child relatively late in life (after 30) are at greater risk for eventually developing
More informationMore Examples and Applications on AVL Tree
CSCI2100 Tutorial 11 Jianwen Zhao Department of Computer Science and Engineering The Chinese University of Hong Kong Adapted from the slides of the previous offerings of the course Recall in lectures we
More informationStepwise Knowledge Acquisition in a Fuzzy Knowledge Representation Framework
Stepwise Knowledge Acquisition in a Fuzzy Knowledge Representation Framework Thomas E. Rothenfluh 1, Karl Bögl 2, and Klaus-Peter Adlassnig 2 1 Department of Psychology University of Zurich, Zürichbergstraße
More informationThe Semantics of Intention Maintenance for Rational Agents
The Semantics of Intention Maintenance for Rational Agents Michael P. Georgeffand Anand S. Rao Australian Artificial Intelligence Institute Level 6, 171 La Trobe Street, Melbourne Victoria 3000, Australia
More informationSpeaker Notes: Qualitative Comparative Analysis (QCA) in Implementation Studies
Speaker Notes: Qualitative Comparative Analysis (QCA) in Implementation Studies PART 1: OVERVIEW Slide 1: Overview Welcome to Qualitative Comparative Analysis in Implementation Studies. This narrated powerpoint
More informationChapter 2. Knowledge Representation: Reasoning, Issues, and Acquisition. Teaching Notes
Chapter 2 Knowledge Representation: Reasoning, Issues, and Acquisition Teaching Notes This chapter explains how knowledge is represented in artificial intelligence. The topic may be launched by introducing
More informationConvolutional Coding: Fundamentals and Applications. L. H. Charles Lee. Artech House Boston London
Convolutional Coding: Fundamentals and Applications L. H. Charles Lee Artech House Boston London Contents Preface xi Chapter 1 Introduction of Coded Digital Communication Systems 1 1.1 Introduction 1 1.2
More informationSome Connectivity Concepts in Bipolar Fuzzy Graphs
Annals of Pure and Applied Mathematics Vol. 7, No. 2, 2014, 98-108 ISSN: 2279-087X (P), 2279-0888(online) Published on 30 September 2014 www.researchmathsci.org Annals of Some Connectivity Concepts in
More informationIncluding Quantification in Defeasible Reasoning for the Description Logic EL
Including Quantification in Defeasible Reasoning for the Description Logic EL Maximilian Pensel and Anni-Yasmin Turhan Institute for Theoretical Computer Science, Technische Universität Dresden first-name.last-name
More informationThe Loss of Heterozygosity (LOH) Algorithm in Genotyping Console 2.0
The Loss of Heterozygosity (LOH) Algorithm in Genotyping Console 2.0 Introduction Loss of erozygosity (LOH) represents the loss of allelic differences. The SNP markers on the SNP Array 6.0 can be used
More informationAnnouncements. Perceptual Grouping. Quiz: Fourier Transform. What you should know for quiz. What you should know for quiz
Announcements Quiz on Tuesday, March 10. Material covered (Union not Intersection) All lectures before today (March 3). Forsyth and Ponce Readings: Chapters 1.1, 4, 5.1, 5.2, 5.3, 7,8, 9.1, 9.2, 9.3, 6.5.2,
More informationLecture 2: Foundations of Concept Learning
Lecture 2: Foundations of Concept Learning Cognitive Systems - Machine Learning Part I: Basic Approaches to Concept Learning Version Space, Candidate Elimination, Inductive Bias last change October 18,
More informationSolving problems by searching
Solving problems by searching Chapter 3 14 Jan 2004 CS 3243 - Blind Search 1 Outline Problem-solving agents Problem types Problem formulation Example problems Basic search algorithms 14 Jan 2004 CS 3243
More informationIntro to Theory of Computation
Intro to Theory of Computation LECTURE 13 Last time: Turing Machines and Variants Today Turing Machine Variants Church-Turing Thesis Sofya Raskhodnikova 2/23/2016 Sofya Raskhodnikova; based on slides by
More informationIterated Belief Change and Exogenous Actions in the Situation Calculus
Iterated Belief Change and Exogenous Actions in the Situation Calculus Steven Shapiro and Maurice Pagnucco 2 Abstract. We present a novel theory of action and change capable of dealing with discord between
More information1 (vi) maths Multiple Choice Questions (MCQs) CLASS: VI SUBJECT: MATHS. Chapter - 1
1 (vi) maths Multiple Choice Questions (MCQs) CLASS: VI SUBJECT: MATHS Chapter - 1 The smallest two digit number is (a) 10 (b) 90 (c) 99 (d) none Greatest three digit number using three distinct digit
More informationDATE 2006 Session 5B: Timing and Noise Analysis
DATE 2006 Session 5B: Timing and Noise Analysis Bus Stuttering : An Encoding Technique To Reduce Inductive Noise In Off-Chip Data Transmission Authors: Brock J. LaMeres, Agilent Technologies Sunil P. Khatri,
More informationChapter 3 Software Packages to Install How to Set Up Python Eclipse How to Set Up Eclipse... 42
Table of Contents Preface..... 21 About the Authors... 23 Acknowledgments... 24 How This Book is Organized... 24 Who Should Buy This Book?... 24 Where to Find Answers to Review Questions and Exercises...
More informationCalculating volume scotomas for patients with central scotomas
APPENDIX Calculating volume scotomas for patients with central scotomas This appendix provides formulas to derive the shape and extent of volume scotomas for some simple examples of bilateral central field
More informationMS&E 226: Small Data
MS&E 226: Small Data Lecture 10: Introduction to inference (v2) Ramesh Johari ramesh.johari@stanford.edu 1 / 17 What is inference? 2 / 17 Where did our data come from? Recall our sample is: Y, the vector
More informationPrentice Hall Connected Mathematics 2, 8th Grade Units 2006 Correlated to: Michigan Grade Level Content Expectations (GLCE), Mathematics (Grade 8)
NUMBER AND OPERATIONS Understand real number concepts N.ME.08.01 Understand the meaning of a square root of a number and its connection to the square whose area is the number; understand the meaning of
More informationFoundations of AI. 10. Knowledge Representation: Modeling with Logic. Concepts, Actions, Time, & All the Rest
Foundations of AI 10. Knowledge Representation: Modeling with Logic Concepts, Actions, Time, & All the Rest Wolfram Burgard, Andreas Karwath, Bernhard Nebel, and Martin Riedmiller 10/1 Contents Knowledge
More informationPHP2500: Introduction to Biostatistics. Lecture III: Introduction to Probability
PHP2500: Introduction to Biostatistics Lecture III: Introduction to Probability 1 . 2 Example: 40% of adults aged 40-74 in Rhode Island have pre-diabetes, a condition that raises the risk of type 2 diabetes,
More informationBusiness Statistics Probability
Business Statistics The following was provided by Dr. Suzanne Delaney, and is a comprehensive review of Business Statistics. The workshop instructor will provide relevant examples during the Skills Assessment
More informationNeural Coding. Computing and the Brain. How Is Information Coded in Networks of Spiking Neurons?
Neural Coding Computing and the Brain How Is Information Coded in Networks of Spiking Neurons? Coding in spike (AP) sequences from individual neurons Coding in activity of a population of neurons Spring
More informationMeasurement and meaningfulness in Decision Modeling
Measurement and meaningfulness in Decision Modeling Brice Mayag University Paris Dauphine LAMSADE FRANCE Chapter 2 Brice Mayag (LAMSADE) Measurement theory and meaningfulness Chapter 2 1 / 47 Outline 1
More informationRolls,E.T. (2016) Cerebral Cortex: Principles of Operation. Oxford University Press.
Digital Signal Processing and the Brain Is the brain a digital signal processor? Digital vs continuous signals Digital signals involve streams of binary encoded numbers The brain uses digital, all or none,
More informationMITOCW conditional_probability
MITOCW conditional_probability You've tested positive for a rare and deadly cancer that afflicts 1 out of 1000 people, based on a test that is 99% accurate. What are the chances that you actually have
More informationPredicting Breast Cancer Survival Using Treatment and Patient Factors
Predicting Breast Cancer Survival Using Treatment and Patient Factors William Chen wchen808@stanford.edu Henry Wang hwang9@stanford.edu 1. Introduction Breast cancer is the leading type of cancer in women
More informationCayley Graphs. Ryan Jensen. March 26, University of Tennessee. Cayley Graphs. Ryan Jensen. Groups. Free Groups. Graphs.
Cayley Forming Free Cayley Cayley University of Tennessee March 26, 2014 Group Cayley Forming Free Cayley Definition A group is a nonempty set G with a binary operation which satisfies the following: (i)
More informationSequential Decision Making
Sequential Decision Making Sequential decisions Many (most) real world problems cannot be solved with a single action. Need a longer horizon Ex: Sequential decision problems We start at START and want
More informationCISC453 Winter Probabilistic Reasoning Part B: AIMA3e Ch
CISC453 Winter 2010 Probabilistic Reasoning Part B: AIMA3e Ch 14.5-14.8 Overview 2 a roundup of approaches from AIMA3e 14.5-14.8 14.5 a survey of approximate methods alternatives to the direct computing
More informationRepresentation Theorems for Multiple Belief Changes
Representation Theorems for Multiple Belief Changes Dongmo Zhang 1,2 Shifu Chen 1 Wujia Zhu 1,2 Zhaoqian Chen 1 1 State Key Lab. for Novel Software Technology Department of Computer Science and Technology
More informationMental Imagery. What is Imagery? What We Can Imagine 3/3/10. What is nature of the images? What is the nature of imagery for the other senses?
Mental Imagery What is Imagery? What is nature of the images? Exact copy of original images? Represented in terms of meaning? If so, then how does the subjective sensation of an image arise? What is the
More informationLoop Dependence and Parallelism
Loop Dependence and Parallelism Announcements Reading assignments for next week due Midterm is Monday March 6th, example midterms posted Assignment 2 is due the week after that. Start now! Today Data dependencies
More informationGenerating Obstacle Conditions for Requirements Completeness
Generating Obstacle Conditions for Requirements Completeness Dalal Alrajeh, Jeff Kramer, Axel van Lamsweerde, Alessandra Russo, and Sebastian Uchitel Department of Computing, Imperial College London, UK
More informationIdentifying Parkinson s Patients: A Functional Gradient Boosting Approach
Identifying Parkinson s Patients: A Functional Gradient Boosting Approach Devendra Singh Dhami 1, Ameet Soni 2, David Page 3, and Sriraam Natarajan 1 1 Indiana University Bloomington 2 Swarthmore College
More informationBayesian additive decision trees of biomarker by treatment interactions for predictive biomarkers detection and subgroup identification
Bayesian additive decision trees of biomarker by treatment interactions for predictive biomarkers detection and subgroup identification Wei Zheng Sanofi-Aventis US Comprehend Info and Tech Talk outlines
More informationReadings: Textbook readings: OpenStax - Chapters 1 11 Online readings: Appendix D, E & F Plous Chapters 10, 11, 12 and 14
Readings: Textbook readings: OpenStax - Chapters 1 11 Online readings: Appendix D, E & F Plous Chapters 10, 11, 12 and 14 Still important ideas Contrast the measurement of observable actions (and/or characteristics)
More informationNatural Scene Statistics and Perception. W.S. Geisler
Natural Scene Statistics and Perception W.S. Geisler Some Important Visual Tasks Identification of objects and materials Navigation through the environment Estimation of motion trajectories and speeds
More informationThe Evolution of Cooperation: The Genetic Algorithm Applied to Three Normal- Form Games
The Evolution of Cooperation: The Genetic Algorithm Applied to Three Normal- Form Games Scott Cederberg P.O. Box 595 Stanford, CA 949 (65) 497-7776 (cederber@stanford.edu) Abstract The genetic algorithm
More informationIntroduction to Logic: Inductive Classification
Introduction to Logic: Inductive Classification Based on the ML lecture by Raymond J. Mooney University of Texas at Austin 1 Sample Category Learning Problem Instance language: size
More informationSemantic Structure of the Indian Sign Language
Semantic Structure of the Indian Sign Language Purushottam Kar and Achla M. Raina Indian Institute of Technology Kanpur 6 January 2008 Overview Indian Sign Language An Introduction Sociolinguistic and
More informationCHAPTER 6 HUMAN BEHAVIOR UNDERSTANDING MODEL
127 CHAPTER 6 HUMAN BEHAVIOR UNDERSTANDING MODEL 6.1 INTRODUCTION Analyzing the human behavior in video sequences is an active field of research for the past few years. The vital applications of this field
More informationIntelligent Agents. CmpE 540 Principles of Artificial Intelligence
CmpE 540 Principles of Artificial Intelligence Intelligent Agents Pınar Yolum pinar.yolum@boun.edu.tr Department of Computer Engineering Boğaziçi University 1 Chapter 2 (Based mostly on the course slides
More informationIdentification of Tissue Independent Cancer Driver Genes
Identification of Tissue Independent Cancer Driver Genes Alexandros Manolakos, Idoia Ochoa, Kartik Venkat Supervisor: Olivier Gevaert Abstract Identification of genomic patterns in tumors is an important
More informationIEEE SIGNAL PROCESSING LETTERS, VOL. 13, NO. 3, MARCH A Self-Structured Adaptive Decision Feedback Equalizer
SIGNAL PROCESSING LETTERS, VOL 13, NO 3, MARCH 2006 1 A Self-Structured Adaptive Decision Feedback Equalizer Yu Gong and Colin F N Cowan, Senior Member, Abstract In a decision feedback equalizer (DFE),
More informationA Logic of Emotions for Intelligent Agents
A Logic of Emotions for Intelligent Agents Bas R. Steunebrink Department of ICS Utrecht University Utrecht, The Netherlands bass@cs.uu.nl Mehdi Dastani Department of ICS Utrecht University Utrecht, The
More informationAsalient problem in genomic signal processing is the design
412 IEEE JOURNAL OF SELECTED TOPICS IN SIGNAL PROCESSING, VOL. 2, NO. 3, JUNE 2008 Optimal Intervention in Asynchronous Genetic Regulatory Networks Babak Faryabi, Student Member, IEEE, Jean-François Chamberland,
More informationInternal logic viewed from observation space. Theory and a case study
Internal logic viewed from observation space: Theory and a case study Motohiko Hatakeyama and Ichiro Tsuda Department of Mathematics, Graduate School of Science, Hokkaido University, Sapporo, 060-0810,
More informationDesign Safety Verification of Medical Device Models using Automata Theory
Design Safety Verification of Medical Device Models using Automata Theory A Thesis Presented to The Faculty of Computer Science Program California State University Channel Islands In (Partial) Fulfillment
More informationRumor Detection on Twitter with Tree-structured Recursive Neural Networks
1 Rumor Detection on Twitter with Tree-structured Recursive Neural Networks Jing Ma 1, Wei Gao 2, Kam-Fai Wong 1,3 1 The Chinese University of Hong Kong 2 Victoria University of Wellington, New Zealand
More informationRegression CHAPTER SIXTEEN NOTE TO INSTRUCTORS OUTLINE OF RESOURCES
CHAPTER SIXTEEN Regression NOTE TO INSTRUCTORS This chapter includes a number of complex concepts that may seem intimidating to students. Encourage students to focus on the big picture through some of
More informationDescribe what is meant by a placebo Contrast the double-blind procedure with the single-blind procedure Review the structure for organizing a memo
Please note the page numbers listed for the Lind book may vary by a page or two depending on which version of the textbook you have. Readings: Lind 1 11 (with emphasis on chapters 10, 11) Please note chapter
More informationStatistical Decision Theory and Bayesian Analysis
Statistical Decision Theory and Bayesian Analysis Chapter 3: Prior Information and Subjective Probability Lili MOU moull12@sei.pku.edu.cn http://sei.pku.edu.cn/ moull12 11 MayApril 2015 Reference 3, James
More informationCentral Algorithmic Techniques. Iterative Algorithms
Central Algorithmic Techniques Iterative Algorithms Code Representation of an Algorithm class InsertionSortAlgorithm extends SortAlgorithm { void sort(int a[]) throws Exception { for (int i = 1; i < a.length;
More informationModeling Agents as Qualitative Decision Makers
Modeling Agents as Qualitative Decision Makers Ronen I. Brafman Dept. of Computer Science University of British Columbia Vancouver, B.C. Canada V6T 1Z4 brafman@cs.ubc.ca Moshe Tennenholtz Industrial Engineering
More informationAnalyzing Human Negotiation using Automated Cognitive Behavior Analysis: The Effect of Personality. Pedro Sequeira & Stacy Marsella
Analyzing Human Negotiation using Automated Cognitive Behavior Analysis: The Effect of Personality Pedro Sequeira & Stacy Marsella Outline Introduction Methodology Results Summary & Conclusions Outline
More informationDescribe what is meant by a placebo Contrast the double-blind procedure with the single-blind procedure Review the structure for organizing a memo
Please note the page numbers listed for the Lind book may vary by a page or two depending on which version of the textbook you have. Readings: Lind 1 11 (with emphasis on chapters 5, 6, 7, 8, 9 10 & 11)
More informationCognitive Fallacies in Group Settings. Daniel O Leary University of Southern California
Cognitive Fallacies in Group Settings Daniel O Leary University of Southern California From: AAAI Technical Report SS-94-07. Compilation copyright 1994, AAAI (www.aaai.org). All rights reserved. Abstract
More informationWhat Happened to Bob? Semantic Data Mining of Context Histories
What Happened to Bob? Semantic Data Mining of Context Histories Michael Wessel, Marko Luther, Ralf Möller Racer Systems DOCOMO Euro-Labs Uni Hamburg A mobile community service 1300+ users in 60+ countries
More informationCS612 - Algorithms in Bioinformatics
Spring 2016 Protein Structure February 7, 2016 Introduction to Protein Structure A protein is a linear chain of organic molecular building blocks called amino acids. Introduction to Protein Structure Amine
More informationEvolutionary Programming
Evolutionary Programming Searching Problem Spaces William Power April 24, 2016 1 Evolutionary Programming Can we solve problems by mi:micing the evolutionary process? Evolutionary programming is a methodology
More informationLECTURE 5: REACTIVE AND HYBRID ARCHITECTURES
Reactive Architectures LECTURE 5: REACTIVE AND HYBRID ARCHITECTURES An Introduction to MultiAgent Systems http://www.csc.liv.ac.uk/~mjw/pubs/imas There are many unsolved (some would say insoluble) problems
More informationOn the Effectiveness of Specification-Based Structural Test-Coverage Criteria as Test-Data Generators for Safety-Critical Systems
On the Effectiveness of Specification-Based Structural Test-Coverage Criteria as Test-Data Generators for Safety-Critical Systems A DISSERTATION SUBMITTED TO THE FACULTY OF UNIVERSITY OF MINNESOTA BY Devaraj
More informationA Scientific Model of Consciousness that Explains Spirituality and Enlightened States
A Scientific Model of Consciousness that Explains Spirituality and Enlightened States Frank Heile, Ph.D. Physics degrees from Stanford and MIT consciousness@frankheile.com April 2016 Outline Part 1: Agents
More informationLecture 13: Finding optimal treatment policies
MACHINE LEARNING FOR HEALTHCARE 6.S897, HST.S53 Lecture 13: Finding optimal treatment policies Prof. David Sontag MIT EECS, CSAIL, IMES (Thanks to Peter Bodik for slides on reinforcement learning) Outline
More informationFuzzy-set Qualitative Comparative Analysis Summary 1
Fuzzy-set Qualitative Comparative Analysis Summary Arthur P. Tomasino Bentley University Fuzzy-set Qualitative Comparative Analysis (fsqca) is a relatively new but accepted method for understanding case-based
More informationIntention Is Commitment with Expectation
Intention Is Commitment with Expectation 375 Abstract Modal logics with possible worlds semantics provide a means to describe the rational behavior of agents in terms of mental states, such as beliefs,
More informationReview Questions in Introductory Knowledge... 37
Table of Contents Preface..... 17 About the Authors... 19 How This Book is Organized... 20 Who Should Buy This Book?... 20 Where to Find Answers to Review Questions and Exercises... 20 How to Report Errata...
More information56:134 Process Engineering
56:134 Process Engineering Homework #2 Solutions Your role as a process analyst is to reduce cycle time of the process in Figure 1. The duration of each activity is as follows: Release PCB1 2 minutes Release
More informationChapter 3 Tools for Practical Theorizing: Theoretical Maps and Ecosystem Maps
Chapter 3 Tools for Practical Theorizing: Theoretical Maps and Ecosystem Maps Chapter Outline I. Introduction A. Understanding theoretical languages requires universal translators 1. Theoretical maps identify
More informationMethods for Determining Random Sample Size
Methods for Determining Random Sample Size This document discusses how to determine your random sample size based on the overall purpose of your research project. Methods for determining the random sample
More informationRemarks on Bayesian Control Charts
Remarks on Bayesian Control Charts Amir Ahmadi-Javid * and Mohsen Ebadi Department of Industrial Engineering, Amirkabir University of Technology, Tehran, Iran * Corresponding author; email address: ahmadi_javid@aut.ac.ir
More informationStatistics for Psychology
Statistics for Psychology SIXTH EDITION CHAPTER 12 Prediction Prediction a major practical application of statistical methods: making predictions make informed (and precise) guesses about such things as
More informationImportance of factors contributing to work-related stress: comparison of four metrics
Importance of factors contributing to work-related stress: comparison of four metrics Mounia N. Hocine, Natalia Feropontova, Ndèye Niang, Karim Aït-Bouziad, Gilbert Saporta Conservatoire national des arts
More informationAudio: In this lecture we are going to address psychology as a science. Slide #2
Psychology 312: Lecture 2 Psychology as a Science Slide #1 Psychology As A Science In this lecture we are going to address psychology as a science. Slide #2 Outline Psychology is an empirical science.
More informationDEPARTMENT OF COMPUTER SCIENCE AND ENGINEERING. CP 7026-Software Quality Assurance Unit-I. Part-A
DEPARTMENT OF COMPUTER SCIENCE AND ENGINEERING CP 7026-Software Quality Assurance Unit-I 1. What is quality? 2. What are the Views of Quality? 3. What is Quality Cost? 4. What is Quality Audit? 5. What
More informationA Computational Theory of Belief Introspection
A Computational Theory of Belief Introspection Kurt Konolige Artificial Intelligence Center SRI International Menlo Park, California 94025 Abstract Introspection is a general term covering the ability
More informationIntroduction: Statistics and Engineering
Introduction: Statistics and Engineering STAT:2020 Probability and Statistics for Engineering and Physical Sciences Week 1 - Lecture 1 Book Sections 1.1-1.2.4, 1.3: Introduction 1 / 13 Where do engineering
More informationCancer Hallmark Automata (I): Model, Therapy and Complexity
Cancer Hallmark Automata (I): Model, Therapy and Complexity Loes Olde Loohuis Andreas Witzel Bud Mishra January 10, 2012 Abstract This paper introduces Cancer Hallmark Automata, a formalism to model the
More informationMedical Knowledge Base Consistency Checking and Its Application to CADIAG-l/BIN
Medical Knowledge Base Consistency Checking and Its Application to CADIAG-l/BIN Wolfgang Moser t, Klaus-Peter Adlassnigt tgsf-forschungszentrum fiir Umwelt und Gesundheit GmbH Institut fiir Medizinische
More informationPropositional Logic and Formal Codification of Behavioral Operations
Behavior and Philosophy, 41, 83-115 (2014). 2014 Cambridge Center for Behavioral Studies Propositional Logic and Formal Codification of Behavioral Operations Gunnar Salthe and Jon A. Lokke Ostfold University
More informationHandling Partial Preferences in the Belief AHP Method: Application to Life Cycle Assessment
Handling Partial Preferences in the Belief AHP Method: Application to Life Cycle Assessment Amel Ennaceur 1, Zied Elouedi 1, and Eric Lefevre 2 1 University of Tunis, Institut Supérieur de Gestion de Tunis,
More informationContents. 2 Statistics Static reference method Sampling reference set Statistics Sampling Types...
Department of Medical Protein Research, VIB, B-9000 Ghent, Belgium Department of Biochemistry, Ghent University, B-9000 Ghent, Belgium http://www.computationalproteomics.com icelogo manual Niklaas Colaert
More informationA Three Agent Model of Consciousness Explains Spirituality and Multiple Nondual Enlightened States Frank Heile, Ph.D.
A Three Agent Model of Consciousness Explains Spirituality and Multiple Nondual Enlightened States Frank Heile, Ph.D. Author and Physicist (Degrees from Stanford and MIT) frank@spiritualityexplained.com
More informationOn the number of palindromically rich words
On the number of palindromically rich words Amy Glen School of Engineering & IT Murdoch University, Perth, Australia amyglen@gmailcom http://amyglenwordpresscom 59th AustMS Annual Meeting @ Flinders University
More information2016 Denise M. Guérin. Presented for Boston College Employee Development Office April 6, 2016 by Denise M. Guérin, JD, MS-PPM, PMP
2016 Denise M. Guérin Presented for Boston College Employee Development Office April 6, 2016 by Denise M. Guérin, JD, MS-PPM, PMP 1 Q&A from Session #2 Review of Network Logic Diagram Critical Path Method
More information