1 / 12

Tom Chothia CWI

Modelling and Analysing of Security Protocol: Lecture 12 Probabilistic Modelling Checking of Anonymous Systems. Tom Chothia CWI. Today. Model Checking for finite systems Specifying properties in CTL Dinning Philosophers BREAK Probabilistic finite systems

kieve
Download Presentation

Tom Chothia CWI

An Image/Link below is provided (as is) to download presentation Download Policy: Content on the Website is provided to you AS IS for your information and personal use and may not be sold / licensed / shared on other websites without getting consent from its author. Content is provided to you AS IS for your information and personal use only. Download presentation by click this link. While downloading, if for some reason you are not able to download a presentation, the publisher may have deleted the file from their server. During download, if you can't get a presentation, the file might be deleted by the publisher.

E N D

Presentation Transcript

  1. Modelling and Analysing of Security Protocol: Lecture 12Probabilistic Modelling Checking of Anonymous Systems Tom Chothia CWI

  2. Today • Model Checking for finite systems • Specifying properties in CTL • Dinning Philosophers BREAK • Probabilistic finite systems • Specifying probabilistic properties in PCTL • Dinning Cryptographers

  3. PCTL

  4. Probabilistic Model Checking

  5. Dinning Cryptographers

  6. r5+r1 r1 r5 r1+r2 r4+r5 r2 r4 r3 r2+r3 r3+r4 Dining Cryptographers • Nodes form a ring • Each adjacent pair picks a random number • Each node broadcasts the sum (xor) of the adjacent numbers • The user who wants to send amessage also adds the message • The total sum (xor) is:r1+r2+r2+r3+r3+r4+r4+r5+r5+r1+m = m +m

  7. Results of the Model Checking

  8. Results of the Model Checking

  9. Result of P(Tails)=0.25

  10. Result of P(Tails)=0.25

  11. Result of P(Tails)=0.21132

  12. Today • Model Checking for finite systems • Specifying properties in CTL • Dinning Philosophers example BREAK • Probabilistic finite systems • Specifying probabilistic properties in PCTL • Dinning Cryptographers

More Related