1 April 2009Instructor: Tasneem Darwish1 University of Palestine Faculty of Applied Engineering and Urban Planning Software Engineering Department Formal.

Slides:



Advertisements
Similar presentations
18 April 2009Instructor: Tasneem Darwish1 University of Palestine Faculty of Applied Engineering and Urban Planning Software Engineering Department Formal.
Advertisements

18 April 2009Instructor: Tasneem Darwish1 University of Palestine Faculty of Applied Engineering and Urban Planning Software Engineering Department Formal.
Steps of a Design Brief V Design Brief  Problem, identification, and definition Establish a clear idea of what is to be accomplished. Identify.
25 February 2009Instructor: Tasneem Darwish1 University of Palestine Faculty of Applied Engineering and Urban Planning Software Engineering Department.
22 March 2009Instructor: Tasneem Darwish1 University of Palestine Faculty of Applied Engineering and Urban Planning Software Engineering Department Introduction.
13 May 2009Instructor: Tasneem Darwish1 University of Palestine Faculty of Applied Engineering and Urban Planning Software Engineering Department Introduction.
12 April 2009Instructor: Tasneem Darwish1 University of Palestine Faculty of Applied Engineering and Urban Planning Software Engineering Department Formal.
04 March 2009Instructor: Tasneem Darwish1 University of Palestine Faculty of Applied Engineering and Urban Planning Software Engineering Department Introduction.
08 March 2009Instructor: Tasneem Darwish1 University of Palestine Faculty of Applied Engineering and Urban Planning Software Engineering Department Introduction.
Copyright © Cengage Learning. All rights reserved. CHAPTER 1 SPEAKING MATHEMATICALLY SPEAKING MATHEMATICALLY.
Instructor: Tasneem Darwish
Discrete Structures Chapter 5 Relations and Functions Nurul Amelina Nasharuddin Multimedia Department.
Analytical Methods in CS (CIS 505)
EE1J2 – Discrete Maths Lecture 7
Sets. Copyright © Peter Cappello Definition Visualize a dictionary as a directed graph. Nodes represent words If word w is defined in terms of word.
Instructor: Tasneem Darwish1 University of Palestine Faculty of Applied Engineering and Urban Planning Software Engineering Department Software Systems.
13 May 2009Instructor: Tasneem Darwish1 University of Palestine Faculty of Applied Engineering and Urban Planning Software Engineering Department Formal.
10 May 2009Instructor: Tasneem Darwish1 University of Palestine Faculty of Applied Engineering and Urban Planning Software Engineering Department Formal.
01 March 2009Instructor: Tasneem Darwish1 University of Palestine Faculty of Applied Engineering and Urban Planning Software Engineering Department Introduction.
Digital Logic Design ESGD2201
The Z Notation: relations and functions Compiled By Tariq R. Soomro, Ph.D. Reference: Text Book Week-7.
22 March 2009Instructor: Tasneem Darwish1 University of Palestine Faculty of Applied Engineering and Urban Planning Software Engineering Department Formal.
Instructor: Tasneem Darwish1 University of Palestine Faculty of Applied Engineering and Urban Planning Software Engineering Department Object Oriented.
Instructore: Tasneem Darwish1 University of Palestine Faculty of Applied Engineering and Urban Planning Software Engineering Department Concurrent and.
SOFTWARE ENGINEERING BIT-8 APRIL, 16,2008 Introduction to UML.
12 April 2009Instructor: Tasneem Darwish1 University of Palestine Faculty of Applied Engineering and Urban Planning Software Engineering Department Formal.
Instructor: Tasneem Darwish1 University of Palestine Faculty of Applied Engineering and Urban Planning Software Engineering Department Object Oriented.
Instructore: Tasneem Darwish1 University of Palestine Faculty of Applied Engineering and Urban Planning Software Engineering Department Requirement engineering.
Instructor: Tasneem Darwish1 University of Palestine Faculty of Applied Engineering and Urban Planning Software Engineering Department Object Oriented.
INTRODUCTION TO THE THEORY OF COMPUTATION INTRODUCTION MICHAEL SIPSER, SECOND EDITION 1.
Copyright © 2007 Pearson Education, Inc. Slide 1-1.
Michaelmas Term 2004 Discrete Mathematics CSC 141 Discrete Mathematics Dr. Corina Sas and Ms. Nelly Bencomo
Fall 2015 COMP 2300 Discrete Structures for Computation Donghyun (David) Kim Department of Mathematics and Physics North Carolina Central University 1.
University of Palestine Faculty of Applied Engineering and Urban Planning Software Engineering Department Introduction to computer vision Chapter 2: Image.
Set, Combinatorics, Probability & Number Theory Mathematical Structures for Computer Science Chapter 3 Copyright © 2006 W.H. Freeman & Co.MSCS Slides Set,
17 May 2009Instructor: Tasneem Darwish1 University of Palestine Faculty of Applied Engineering and Urban Planning Software Engineering Department Formal.
08 April 2009Instructor: Tasneem Darwish1 University of Palestine Faculty of Applied Engineering and Urban Planning Software Engineering Department Formal.
Instructor: Tasneem Darwish1 University of Palestine Faculty of Applied Engineering and Urban Planning Software Engineering Department Object Oriented.
Eng. Mohammed Timraz Electronics & Communication Engineer University of Palestine Faculty of Engineering and Urban planning Software Engineering Department.
Instructor: Tasneem Darwish1 University of Palestine Faculty of Applied Engineering and Urban Planning Software Engineering Department Software Systems.
03 May 2009Instructor: Tasneem Darwish1 University of Palestine Faculty of Applied Engineering and Urban Planning Software Engineering Department Introduction.
Math Chapter 6 Part II. POWER SETS In mathematics, given a set S, the power set of S, written P(S) or 2 n(S), is the set of all subsets of S. Remember.
Chapter 2: Basic Structures: Sets, Functions, Sequences, and Sums (1)
Chapter 2 Section 1 - Slide 1 Copyright © 2009 Pearson Education, Inc. AND.
Sets Goal: Introduce the basic terminology of set theory.
Database System Concepts, 5th Ed. ©Silberschatz, Korth and Sudarshan See for conditions on re-usewww.db-book.com ICOM 5016 – Introduction.
Thinking Mathematically Venn Diagrams and Subsets.
Discrete Mathematics Lecture # 17 Function. Relations and Functions  A function F from a set X to a set Y is a relation from X to Y that satisfies the.
Lecture 7: Relations Dr Andrew Purkiss-Trew Cancer Research UK Mathematics for Computing.
Chapter 2 Sets and Functions.
Classical Relations and Fuzzy Relations
Relations and Functions
Introduction to Relations
Set, Combinatorics, Probability & Number Theory
Applied Discrete Mathematics Week 10: Relations
Chapter 1 Logic and Proofs Homework 2 Given the statement “A valid password is necessary for you to log on to the campus server.” Express the statement.
Discrete Structure II: Introduction
INTRODUCTION TO THE THEORY OF COMPUTATION
Mathematics, the Language of Physics
Algebra 1 Section 5.2.
Copyright © Cengage Learning. All rights reserved.
ICOM 5016 – Introduction to Database Systems
Chapter 1: Linear Functions, Equations, and Inequalities
Copyright © Cengage Learning. All rights reserved.
Copyright © Cengage Learning. All rights reserved.
ICOM 5016 – Introduction to Database Systems
Ordered Pair – (11 - 2) CS-708.
Terminology and Symbols
Presentation transcript:

1 April 2009Instructor: Tasneem Darwish1 University of Palestine Faculty of Applied Engineering and Urban Planning Software Engineering Department Formal Methods Relations

1 April 2009Instructor: Tasneem Darwish2 Outlines Binary relations.

1 April 2009Instructor: Tasneem Darwish3 Introduction In a formal specification, it is often necessary to describe relationships between Objects. Example: 1.This object is greater than that. 2.This action takes priority over that one. These relationships can be described using simple mathematical objects called relations.

1 April 2009Instructor: Tasneem Darwish4 Binary Relations We can define relations between a finite number of objects, but its enough to define binary relations. Binary relations are relations that express links between pairs of objects. In our mathematical language a relation is a set of ordered pairs, a subset of a Cartesian product. If X and Y are sets, then X ↔Y denotes the set of all relations between X and Y. The relation symbol can be defined using generic abbreviation:

1 April 2009Instructor: Tasneem Darwish5 Binary Relations Example 7.1 The set of relations {a, b} ↔ {0, 1} is the set of sets of pairs  The relation that associates a with 0, a with 1, and b with 0 is the set The expression is another way of writing (x,y)

1 April 2009Instructor: Tasneem Darwish6 Binary Relations Example 7.2 The relation drives is used to record which makes of car are driven by the members of a small group of people. If the group of people is defined by: and the choice of cars is defined by Then drives is an element of, and the statement `Kate drives a cortina' could be formalised as:

1 April 2009Instructor: Tasneem Darwish7 Binary Relations We may also choose to introduce a relation as an infix symbol: a symbol that sits between its arguments. Many familiar relations are written in this way: the less-than-or-equal-to relation on numbers; the subset relation on sets. If the pair (x, y) is an element of the infix relation R, then we may write x R y. When we define an infix relation, we include underscores to indicate where the arguments should go.

1 April 2009Instructor: Tasneem Darwish8 Binary Relations Example 7.3 The relation drives could be defined by Simple relations can be illustrated using diagrams with arrows, or graphs.

1 April 2009Instructor: Tasneem Darwish9 Binary Relations Example 7.3 The relation drives could be defined by Simple relations can be illustrated using diagrams with arrows, or graphs.