Skip to content

Latest commit

 

History

History
24 lines (14 loc) · 802 Bytes

README.md

File metadata and controls

24 lines (14 loc) · 802 Bytes

Modelling, simulating and verifying processes:

Purpose: To learn something new. CSP in FDR4 is not that difficult. :)

1. The Dining Philosophers’ Problem (Dijkstra 1971)

Problem Statement

Objectives

- Modelling and analyzing the dining philosopher.
- Avoiding deadlock with the help of butler.
- Monitoring the number of eating philosophers.

2. Breaking and fixing Needham-Schroeder authentication protocol

NSP theory

Objectives

- Modelling and analyzing NSP with honest users.
- Modelling Intruder and initiating man-in-the-middle attack.
- Fixing the protocol with Lowe's amendment: Needham-Schroeder-Lowe protocol.