Department of Computer Science

Slides:



Advertisements
Similar presentations
Algorithmic Software Verification VII. Computation tree logic and bisimulations.
Advertisements

Lecture 23UofH - COSC Dr. Verma 1 COSC 3340: Introduction to Theory of Computation University of Houston Dr. Verma Lecture 23.
CS 208: Computing Theory Assoc. Prof. Dr. Brahim Hnich Faculty of Computer Sciences Izmir University of Economics.
Lecture 6 Nondeterministic Finite Automata (NFA)
CSE 105 Theory of Computation Alexander Tsiatas Spring 2012 Theory of Computation Lecture Slides by Alexander Tsiatas is licensed under a Creative Commons.
Software Engineering, COMP 201 Slide 1 Automata and Formal Languages Moore and Mealy Automata Ralf Möller Hamburg Univ. of Technology based on slides by.
Models and methods in systems biology Daniel Kluesing Algorithms in Biology Spring 2009.
1 Introduction to Computability Theory Lecture3: Regular Expressions Prof. Amos Israeli.
SCB : 1 Department of Computer Science Simulation and Complexity SCB : Simulating Complex Biosystems Susan Stepney Department of Computer Science Leo Caves.
Describing Syntax and Semantics
ECE 331 – Digital Systems Design Introduction to Sequential Logic Circuits (aka. Finite State Machines) and FSM Analysis (Lecture #19)
Model Checking LTL over (discrete time) Controllable Linear System is Decidable P. Tabuada and G. J. Pappas Michael, Roozbeh Ph.D. Course November 2005.
Final Exam Review Cummulative Chapters 0, 1, 2, 3, 4, 5 and 7.
University of Toronto Department of Computer Science © 2001, Steve Easterbrook CSC444 Lec17 1 Lecture 17: Formal Modeling Methods Formal Modeling Techniques.
CSE 311 Foundations of Computing I Lecture 6 Predicate Logic, Logical Inference Spring
Formal Methods 1. Software Engineering and Formal Methods  Every software engineering methodology is based on a recommended development process  proceeding.
Intro to Discrete Structures
Introduction to Software Testing Chapter 9.4 Model-Based Grammars Paul Ammann & Jeff Offutt
Discrete Mathematics, Part II CSE 2353 Fall 2007 Margaret H. Dunham Department of Computer Science and Engineering Southern Methodist University Some slides.
Mathematical Modeling and Formal Specification Languages CIS 376 Bruce R. Maxim UM-Dearborn.
Lecture 7 Topics –Boolean Algebra 1. Logic and Bits Operation Computers represent information by bit A bit has two possible values, namely zero and one.
Some Probability Theory and Computational models A short overview.
CSE 311 Foundations of Computing I Lecture 21 Finite State Machines Autumn 2011 CSE 3111.
CSE 311 Foundations of Computing I Lecture 21 Finite State Machines Spring
Lecture 1 Computation and Languages CS311 Fall 2012.
Alan Turing WWII code-breaker mathematical proof of ‘Turing machines’ …in particular, “Universal Turing machine” laid foundations of computer science father.
Bioinformatics for Stem Cell Lecture 2 Debashis Sahoo, PhD.
CSE 311 Foundations of Computing I Lecture 7 Logical Inference Autumn 2012 CSE
Programming Languages and Design Lecture 3 Semantic Specifications of Programming Languages Instructor: Li Ma Department of Computer Science Texas Southern.
THE IMPORTANCE OF DISCRETE MATHEMATICS IN COMPUTER TECHNOLOGY.
Dale Roberts Department of Computer and Information Science, School of Science, IUPUI Dale Roberts, Lecturer Computer Science, IUPUI
Equivalent Opposite PTPRC low  CD19 low FAM60A low  NUAK1 high XIST high  RPS4Y1 low COL3A1 high  SPARC high Boolean analysis of large gene-expression.
Logic Design (CE1111 ) Lecture 6 (Chapter 6) Registers &Counters Prepared by Dr. Lamiaa Elshenawy 1.
Boolean Algebra and Computer Logic Mathematical Structures for Computer Science Chapter 7 Copyright © 2006 W.H. Freeman & Co.MSCS Slides Boolean Logic.
Computer Science 516 A Little On Finite State Machines.
Mealy Machines Finite State Machines with Outputs given on the transitions.
CSE 20: Discrete Mathematics for Computer Science Prof. Shachar Lovett.
CENG 424-Logic for CS Introduction Based on the Lecture Notes of Konstantin Korovin, Valentin Goranko, Russel and Norvig, and Michael Genesereth.
Universal Gate – NOR Universal Gate - NOR Digital Electronics
Digital Logic.
Universal Gate – NAND Universal Gate - NAND Digital Electronics
Requirements Techniques, cont.
Propositional Calculus: Boolean Functions and Expressions
Universal Gate – NAND Universal Gate - NAND Digital Electronics
CIS Automata and Formal Languages – Pei Wang
Impact of Formal Methods in Biology and Medicine Final Review
Impact of Formal Methods in Biology and Medicine
Bioinformatics for Stem Cell Lecture 2
Universal Gate – NAND Universal Gate - NAND Digital Electronics
Universal Gate – NOR Universal Gate - NOR Digital Electronics
Impact of Formal Methods in Biology and Medicine
Propositional Calculus: Boolean Algebra and Simplification
Data Types, Identifiers, and Expressions
Discrete Mathematics and its Applications
MiDReG: Mining Developmentally Regulated Genes
CSE 311 Foundations of Computing I
Universal Gate – NAND Universal Gate - NAND Digital Electronics
Department of Computer Science
Transcriptional response to mating in whole A. gambiae females.
Lecture 20: Combinatorial Circuits I
Boolean Algebra Introduction CSCI 240
Discrete Mathematics and its Applications
Universal Gate – NOR Universal Gate - NOR Digital Electronics
Negations of quantifiers
CSE 311: Foundations of Computing
Department of Computer Science Abdul Wali Khan University Mardan
Motivation Combinational logic functions can be represented, and defined, by truth tables. Sequential logic function cannot, because their behavior depends.
Discrete Mathematics and its Applications
Lecture One: Automata Theory Amjad Ali
Introduction to Biological Systems
Presentation transcript:

Department of Computer Science Formal Methods Debashis Sahoo Department of Computer Science CSE291 – H00 – Lecture 14

Formal Models Broad View Narrow View application of discrete mathematics to software engineering Narrow View Use of a formal language a set of strings over some well-defined alphabet, with rules for distinguishing which strings belong to the language Formal reasoning about formulae in the language E.g. formal proofs: use axioms and proof rules to demonstrate that some formula is in the language What I would like to cover are these points: More formal Basic intro to boolean logic Describe with example Show how these are applied Markers vs cell types Normal vs cancer

Formal Models A finite state machine (FSM) description State Transition Table, Initial State Petri nets State charts A set of properties Invariants Temporal logic formulas What I would like to cover are these points: More formal Basic intro to boolean logic Describe with example Show how these are applied Markers vs cell types Normal vs cancer

Finite State Machine A set of states An initial state A set of transitions A set of final states

Finite State Machine A set of input variables A set of state variables State variables are logical functions of input and previous states.

A 4-bit counter circuit

Analysis of Digital Systems Boolean state space exploration Property p holds in this path

Six Boolean Implications Sparse quadrants are highlighted. Prepare a comparison slides. Correlation vs Boolean If then Get rid of slide numbers Divide the pictures: Two slides First show Asymmetric Symmetric [Sahoo et al. Genome Biology 08]

Boolean Invariants

MiDReG Algorithm MiDReG = (Mining Developmentally Regulated Genes) Boolean Implications A high => B low Differentiation Expression Gene A Gene B Replace seed with Gene A Same slides with and without gene X Just Differentiation Make the arrow visible Spell MiDReG [Sahoo et al. PNAS 2010]

MiDReG Algorithm MiDReG = (Mining Developmentally Regulated Genes) [Sahoo et al. PNAS 2010]

MiDReG Algorithm MiDReG = (Mining Developmentally Regulated Genes) [Sahoo et al. PNAS 2010]

More B Cell Genes [Sahoo et al. PNAS 2010]

Validation of B Cell Genes So far we have confirmed 15 genes by qPCR. [Weissman Lab] Jun Seita, Deepta Bhattacharya [Sahoo et al. PNAS 2010]

Analysis of Predicted Genes 41 mice knockout available out of 62 predicted B cell genes 26/41 have defects in B cell function and differentiation [Sahoo et al. PNAS 2010]

The Branchpoint between B and T Cell Development [Inlay*, Bhattacharya*, Sahoo* et al. Genes Dev 09] [Weissman Lab] Matthew A. Inlay