מפרטים פורמאליים תירגול מספר 10 מפרטים פורמאליים - תירגול שחר דג Lamport - רק התורים מבוסס על המאמר: “specifying concurrent program modules” by Leslie.

Slides:

Advertisements

Similar presentations

Lisp. Versions of LISP Lisp is an old language with many variants Lisp is alive and well today Most modern versions are based on Common Lisp LispWorks.

Advertisements

Distributed Snapshots: Determining Global States of Distributed Systems - K. Mani Chandy and Leslie Lamport.

1 Vol. 01. p Vol. 01. p Vol. 01. p.20.

1 Vol. 03. p Vol. 03. p Vol. 03. p.21.

1 Vol. 02. p Vol. 02. p Vol. 02. p.19.

1 Vol. 03. p Vol. 03. p Vol. 03. p.16.

1 Vol. 02. p Vol. 02. p Vol. 02. p.30.

1 Vol. 03. p Vol. 03. p Vol. 03. p.35.

1 Vol. 02. p Vol. 02. p Vol. 02. p.10.

Synchronization Chapter clock synchronization * 5.2 logical clocks * 5.3 global state * 5.4 election algorithm * 5.5 mutual exclusion * 5.6 distributed.

1 Vol. 01. p Vol. 01. p Vol. 01. p.14.

Distributed systems Module 2 -Distributed algorithms Teaching unit 1 – Basic techniques Ernesto Damiani University of Bozen Lesson 3 – Distributed Systems.

© Katz, Spring 2007 CS Formal SpecificationsLecture-- Lamport 1 Lamport ’s State Machines Formal Specifications of Complex Systems CS Shmuel.

© Katz, Spring 2004 CS Formal SpecificationsLecture-- Lamport 1 Lamport ’s State Machines Formal Specifications of Complex Systems CS Spring.

© Katz, Spring 2004 CS Formal SpecificationsLecture-- Lamport 1 Lamport (cont.): A Lossy Queue Exactly like a regular one, but with one more allowed.

1 Formal Specifications for Complex Systems (236368) Tutorial #1 Course site : T.A. :Emilia Katz.

1 מפרטים פורמאליים תירגול מספר 10 Lamport Based on the paper: “specifying concurrent program modules” by Leslie Lamport (ACM Transaction on programming.

Formal Specifications for Complex Systems (236368) Tutorial #6 appendix Statecharts vs. Raphsody 7 (theory vs. practice)

1 מפרטים פורמאליים תירגול מספר 13 מפרטים פורמאליים - תירגול שחר דג LARCH הרמה הראשונה - הרחבת ההגדרה הבסיסית דוגמא – set Initial and Final algebras הרמה.

1 מפרטים פורמאליים תירגול מספר 12 מפרטים פורמאליים - תירגול שחר דג LOTOS שרשור התנהגויות (

S A B D C T = 0 S gets message from above and sends messages to A, C and D S.

1 Formal Specifications for Complex Systems (236368) Tirgul Hazara.

CMSC 104, Version 8/061L18Functions1.ppt Functions, Part 1 of 4 Topics Using Predefined Functions Programmer-Defined Functions Using Input Parameters Function.

Lecture #12 Distributed Algorithms (I) CS492 Special Topics in Computer Science: Distributed Algorithms and Systems.

Low-Level Detailed Design SAD (Soft Arch Design) Mid-level Detailed Design Low-Level Detailed Design Design Finalization Design Document.

Automatic Verification of Finite-State Concurrent Systems Using Temporal Logic Specifications 1.

Dr. John P. Abraham Professor University of Texas Pan American Internet Applications and Network Programming.

1 Modeling interactions and behavior Lecturer Dr. Mai Fadel.

Remote programs and commands In this presentation… –rpc concepts –rpc connections –rpc actions.

IBM MAINFRAMES CICS Training Class-01.

Expressions and Statements. Expressions Literals and identifiers are expressions More complex expressions are built from simple expressions by the application.

Lamport’s Logical Clocks & Totally Ordered Multicasting.

OS2014 PROJECT 2 Supplemental Information. Outline Sequence Diagram of Project 2 Kernel Modules Kernel Sockets Work Queues Synchronization.

Object Oriented Programming Elhanan Borenstein Lecture #3 copyrights © Elhanan Borenstein.

Introduction to Computing Using Python for loop / defining a new function  Execution control structures ( if, for, function call)  def -ining a new.

Hwajung Lee. The State-transition model The set of global states = s 0 x s 1 x … x s m {s k is the set of local states of process k} S0  S1  S2  Each.

D u k e S y s t e m s Asynchronous Replicated State Machines (Causal Multicast and All That) Jeff Chase Duke University.

1 Functions, Part 1 of 2 Topics Using Predefined Functions Programmer-Defined Functions Using Input Parameters Function Header Comments.

UML The Unified Modeling Language A Practical Introduction Al-Ayham Saleh Aleppo University

Logical Clocks. Topics r Logical clocks r Totally-Ordered Multicasting.

Lecture 7- 1 CS 425/ECE 428/CSE424 Distributed Systems (Fall 2009) Lecture 7 Distributed Mutual Exclusion Section 12.2 Klara Nahrstedt.

 A macro represents a commonly used group of statements in the source programming language.  The macro processor replaces each macro instruction with.

(c) University of Washington10-1 CSC 143 Java Errors and Exceptions Reading: Ch. 15.

Logic Programming (Control and Backtracking). Contents Logic Programming –sans Control –with Backtracking Streams.

Functions, Part 1 of 3 Topics  Using Predefined Functions  Programmer-Defined Functions  Using Input Parameters  Function Header Comments Reading 

Mutual Exclusion Algorithms. Topics r Defining mutual exclusion r A centralized approach r A distributed approach r An approach assuming an organization.

11-Jun-16CSE 542: Operating Systems1 Distributed systems Time, clocks, and the ordering of events in a distributed system Leslie Lamport. Communications.

1 An SDL Tutorial Two primary elements: –Structure –Identifies the various components of the system, and the communication paths among them. –Components:

Lecture 5 Page 1 CS 111 Summer 2013 Bounded Buffers A higher level abstraction than shared domains or simple messages But not quite as high level as RPC.

Remote Procedure Calls

Global state and snapshot

Topic Pre-processor cout To output a message.

PROTOCOL CORRECTNESS Tutorial 3 Theoretical

COMP 2710 Software Construction Sequence Diagrams (cont.)

Global state and snapshot

To Logon: URL: Input: Login ID (user address)

Overview of Ordering and Logical Time

Stack Lesson xx This module shows you the basic elements of a type of linked list called a stack.

Object Oriented Analysis and Design

METHODS AND BEHAVIORS AKEEL AHMED.

ITEC452 Distributed Computing Lecture 5 Program Correctness

Hypothesis Tests Regarding a Parameter

Elements of a Python Program

ITEC452 Distributed Computing Lecture 7 Mutual Exclusion

CSC 143 Java Errors and Exceptions.

Terminology and Symbols

Presentation transcript:

מפרטים פורמאליים תירגול מספר 10 מפרטים פורמאליים - תירגול שחר דג Lamport - רק התורים מבוסס על המאמר: “specifying concurrent program modules” by Leslie Lamport (ACM Transaction on programming languages and systems Vol. 5 April 1983, pages )

מפרטים פורמאליים - תירגול שחר דג התור הרגיל (תזכורת)

מפרטים פורמאליים - תירגול שחר דג התור שמאבד הודעות TMT replaces PUT RCV replaces GET In 3(c), ≺ denotes the relation “is a proper sub-sequence of” In 5, if in(RCV) and infinitely often the queue is not empty, then eventually we will exit RCV (reminder: p ⇝ q : ⃞ (p → ⃟ q))

השולח מפרטים פורמאליים - תירגול שחר דג Squeue– the messages that we have to send Snum– the current sequence number Sarg– the input parameter to SEND Stmtarg– the argument for the next call to MTMT or NULL if not known yet Srcvval– the returned value by the last call to ARCV or NULL if the value was already processed

המקבל מפרטים פורמאליים - תירגול שחר דג rqueue- the queue of the received messages rnum- the sequence number of the last message rval- the returned value from RECEIVE rtmtarg- the argument for the next call to MTMT or NULL if not known yet rrcvval- the last received message or NULL if it already been handled The rezoning for the receiver is very similar to the rezoning for the sender and it is left to the reader.

המערכת השלמה מפרטים פורמאליים - תירגול שחר דג ערוץ שידור אמין (בעצם ממש תור רגיל) rval rqueue rnum rtmtarg rrcvval squeue snum sarg stmtarg srcvval