Scribd
Upload
179 views12 pages

Principles of Model Checking

This document is the final exam for the course INSE 6250/4/UU-Quality Methodology for Software. The exam is 12 pages long and is out of 80 total points. It contains 12 questions testing knowledge of model checking, temporal logics like PLTL and CTL, state explosion problems, logical language expressiveness, and more. Students are instructed to answer all questions on the exam sheets in the spaces provided and may use calculators. The exam is closed book.

Uploaded by

Emraan Hashmi
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
179 views12 pages

Principles of Model Checking

This document is the final exam for the course INSE 6250/4/UU-Quality Methodology for Software. The exam is 12 pages long and is out of 80 total points. It contains 12 questions testing knowledge of model checking, temporal logics like PLTL and CTL, state explosion problems, logical language expressiveness, and more. Students are instructed to answer all questions on the exam sheets in the spaces provided and may use calculators. The exam is closed book.

Uploaded by

Emraan Hashmi
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 12

INSE 6250/4/UU-Quality Methodology for Software

(Winter 2008)

Final Exam

Professor: J. Bentahar
Date: Tuesday, April 08, 2007
Duration: 120 minutes

NAME: ____________________________________ ID: __________________

INSTRUCTIONS:

• Answer all questions on these sheets in the space provided, and if you run out of
space please use the back of the page.

• The use of calculators is permitted.

• This exam is 12 pages long, including the cover page and the appendix. Check
that your copy is complete.

• This exam is out of 80 points.

• This is a closed book examination.


_________________________________________________________

1
Q1. Compare PLTL and CTL model checking in terms of complexity. Justify your
answer (5P)

Q2. Compare theorem proving with model checking (5P)

2
Q3. a- Explain what is the state explosion problem (3P)

b- Explain if PLTL model checking has this problem (2P)

c- Explain if CTL model checking has this problem (2P)

3
Q4. Explain what we mean by the fact that a logical language, for example L1, is
more expressive than another logical language, for example L2. (2P)

Q5. a- Give the semantics of the following PLTL formula: (5P)

s B Φ B Ψ. Φ B Ψ means that if Ψ holds, Φ does so before.

b- Prove that PLTL is expressive enough to express this formula (4P)

4
Q6. Give 5 formulas in PLTL that are satisfied in this model using p (do not use ¬p)
(5P)

Q7. Discuss the validity and satisfiability of the following PLTL formula: (5P)
F(p∧q) ⇔ F(p)∧F(q)

5
Q8. Discuss the legality, satisfiability, and validity of the following CTL formulas:
(10P)
1- ¬AXp

2- AFEGp

3- E(p U AGq)

6
4- AEFp

5- AF(p∨q) ⇒ AFp ∨ AFq

7
Q9. Consider the following Kripke structure consisting of 4 states that are labeled with
atomic propositions from the set {p, q, r, s} (12P)

1 2 3
p, q q p, r

4
p, q, s

Indicate for any of the following CTL formulas which states satisfy it.

1- A(F(p∧AXq)) (3P)

2- EFAGp (3P)

3- EFEGp (3P)

4- EGAF p (3P)

8
Q10. Consider the following Kripke structure (12P)

S0

S1 S2

a- Give the ROBDD of the states

9
b- Give the ROBDD of the transitions

10
Q11. Give a counter example proving that AFEGp and AFAGp are not equivalent (4P)

Q12. Give a counter example proving that AFGp and AFAGp are not equivalent (4P)

11
Appendix

12

You might also like