Exercises on requirements modeling and model checking.

Slides:

Advertisements

Similar presentations

The Important Thing About By. The Important Thing About ******** The important thing about ***** is *****. It is true s/he can *****, *****, and *****.

Advertisements

Warm Up Example 1 Check whether the ordered pair is a solution of 2x – 3y > -2 a.(0,0) 2(0)-3(0)> -2 0> -2 True b.(0,1) 2(0)-3(1)> -2 -3> -2 False.

ADMINISTRATION Information Technology for Administrators SPREADSHEETS Click To Continue.

Metodi formali dello sviluppo software a.a.2013/2014 Prof.Anna Labella.

Algorithmic Software Verification VII. Computation tree logic and bisimulations.

Model Checking I What are LTL and CTL?. and or dreq q0 dack q0bar.

CS6133 Software Specification and Verification

CS 267: Automated Verification Lectures 4:  -calculus Instructor: Tevfik Bultan.

Model Checking I What are LTL and CTL?. and or dreq q0 dack q0bar D D.

1 Temporal Logic u Classical logic:  Good for describing static conditions u Temporal logic:  Adds temporal operators  Describe how static conditions.

Design patterns exercise Nick Lopez Duplication of course material for any commercial purpose without the explicit written permission of the professor.

Exercise Exercise3.1 8 Exercise3.1 9 Exercise

Exercise Exercise Exercise Exercise

Exercise Exercise Exercise Exercise

Exercise Exercise6.1 7 Exercise6.1 8 Exercise6.1 9.

1 Temporal Logic-Overview FM Temporal Logic u Classical logic: Good for describing static conditions u Temporal logic: Adds temporal operators Describe.

Graphing Lines Topic

12-1 Arithmetic Sequences and Series. Sequence- A function whose domain is a set of natural numbers Arithmetic sequences: a sequences in which the terms.

An Update:. Project Timeline We are here Athena Update: What’s been done  Registration: More than 35,000 students registered for fall 2014 classes in.

Patterns and Inductive Reasoning

Object-Oriented Analysis and Design An Introduction.

Copyright 2001, Matt Dwyer, John Hatcliff, and Radu Iosif. The syllabus and all lectures for this course are copyrighted materials and may not be used.

Formula? Unit?.  Formula ?  Unit?  Formula?  Unit?

On Reducing the Global State Graph for Verification of Distributed Computations Vijay K. Garg, Arindam Chakraborty Parallel and Distributed Systems Laboratory.

Piecewise Defined Functions Lesson 2.3. How to Write a Weird Function What if we had to write a single function to describe this graph … We must learn.

Graduate Studies at UOIT Dr. Brian Campbell Dean of Graduate Studies.

Chapter 5 Models and UML Notation for The Object-Oriented Approach.

Finding  and/or  if one/two probabilities are known 50 marks is the pass mark20% of students fail 85 marks is a grade A5% of students get A‘s P(Z

Whole Number Arithmetic Highest common factor Lowest common multiple.

CS 267: Automated Verification Lecture 3: Fixpoints and Temporal Properties Instructor: Tevfik Bultan.

1 Parallel Model Checking Game for CTL Lecture 6 – Lecturer: Orna Grumberg.

程建群博士 (Dr. Jason Cheng) 年 03 月 Software Engineering Part 08.

A Student Guide to Object-Oriented Development

Computer Skills Self Assessment 1. I have never used a computer True False.

CIS 842: Specification and Verification of Reactive Systems

Unit 1 Day 3: Solving Equations with variables on both sides

Sequences Write down the next 3 terms in each sequence:

What do these fractions mean? Do they hold the same value?

A computer program is a sequence of computer commands.

CHAPTER 4 Test Design Techniques

Enrollment. Faculty Senate Meeting October 14, 2008 Kevin Kucera Associate Vice President Enrollment Services.

استراتژی های مدیریت تغییر

UML Exercise #1 Create use cases for a simple restaurant. Only include the customer, waiter, and cook. Create a class diagram Create a sequence diagram.

ريكاوري (بازگشت به حالت اوليه)

Numeric and geometric patterns

Piecewise Defined Functions

Monday 15th March 2010 Mind Mapping Flow Diagrams Proofreading.

Formal Methods in software development

Section 9.2 Sampling Proportions

Formal Methods in software development

Domain Modeling.

Which sets are equal? Which sets are equivalent?

Software Analysis.

Patterns and Inductive Reasoning

Formal Methods in software development

Program correctness Branching-time temporal logics

Patterns and Inductive Reasoning

Chapter 3: Selection Structures: Making Decisions

Composition & Inverses Review

Admissions Conversion Rates Summary

Inequalities TRUE FALSE.

Finding the nth term, Un Example

Extra ER LAB #2.

On-Campus Employment & CPT

Presentation transcript:

Exercises on requirements modeling and model checking

Model checking exercise: 1 Draw a CTL model with a single initial state S0 such that the formula AF(p  q)  EG(  q) is true in S0 and the formula EF(  p  q) is false in S0. Does such a model exist?

Model checking exercise: 2 Draw a CTL model with a single initial state S0 such that the formula EF(p  q)  AG(  q) is true in S0 and the formula EF(  p  q) is false in S0. Does such a model exist?

Model checking exercise: 3 Draw a CTL model with a single initial state S0 such that the formula AG (p)  EF(  p) is true in S0. Does such a model exist?

Conceptual Modeling Exercise Draw an i*model of a university student information system. It must handle admissions, academic records, enrolments, fees, graduations and alumni management. Provide examples of requirements that you cannot model in i* but can in UML and vice versa, with reference to UML use case diagrams, state diagrams and sequence diagrams.

i* Notation

A Strategic Dependency model for computer based training system

Strategic Rationale model for computer based training system