1. Real Time Event Based Communication Team Abhishekh Padmanabhan CIS 798 Final Presentation

2. Introduction A Distributed system is one in which the failure of a computer you didn't even know existed can render your own computer unusable. - Leslie Lamport Problem Statement – “Provide a feature in Distributed System design automation enforcing causality in the primitives executed and simulate real time temporal constraints”

3. Distributed System (DS) Consists of several sites interconnected through a reliable communication medium Environment can interact with the DS at different sites through Service Access Points (SAP) Interactions correspond to executions of service primitives Each site identified by a number i and denoted Site i, correspond a Protocol Entity denoted PE i Intuitively, PE i denotes the local behavior of DS in Site i,

4. Protocol Synthesis In the user’s viewpoint the DS is a black box which provides a service where only execution of primitives are visible The aim of the designer is then to derive specifications of the local protocol entities PE i, for i = 1, 2, …, n How can we derive systematically specifications of the local protocol entities (protocol specifications) which provide a desired service SERVICE SPECIFICATION PE 1 PE 2 PE n Reliable Medium a1a2ana1a2an

5. Finite state machine dissected… Behavior of a Distributes System States: 1.Idle 2.Button pushed 3.Brakes Applied Transitions: 1.T1 on push button 2.T2 on actuate Brake Assembly Transitions occur on the execution of a primitives (example push button). Note that these primitives occur at distributed nodes. 1 2 3 T1 : push button T2: actuate Brake Assembly Behavior of DS Idle Button pushed Brakes Applied

6. Implementation Scope….. Modules to be developed would do the protocol synthesis given system specification. This would suffice for a non real time systems. For real time we need to consider the temporal constraints. Reference : “Protocol Synthesis for Real-Time Applications” A. Khoumsi, Gregor v. Bochmann and Rachida Dssouli. 1 2 3 Behavior of DS 1 2 3 1 2 3 Behavior at individual nodes Protocol Synthesis

7. Example Distributed System for emergency braking mechanism in a vehicle Dashboard with an emergency brake push button which when pushed(T1) communicates to a Braking System which triggers the application of brakes(T2) in the brake assembly of the vehicle and resets the braking system(T3) and sends message to dashboard to reset the dashboard button (T4) 1 2 3 4 T1 T2 T3 T4 FSA SS

8. SS for our Example 1 – Dashboard, 2 – Brake System T1 – [1, A 1, 2], T2 – [2, B 2, 3], T3 – [3, C 2, 4], T4 – [4, D 1, 1] In general Tp – [q, E a, r] reads a transition p from state q to r on execution of entity E at site a A 1 -push button B 2 –apply brakes C 2 –reset brakes D 1 –reset button 1 2 3 4 T1 T2 T3 T4 SS

9. Non Real-time Synthesis Given SS as the input Derivation Procedure 1 Implement causal ordering of primitives executed at various sites from the point of view of the DS to get the GPS (Global Protocol Specification) 2 From GPS, we compute the Protocol Specification (PS) of each PEi that must be implemented in Site i by projecting GPS into events occurring in Site i

10. GPS for our Example (Step 1) Here Tp represents transaction p and S ij means message sent from site i to j and R ij means message received by i from j 8 1 4 5 6 7 2 3 T4 T1 S 12 R 21 T2 T3 S 21 R 12 GPS

11. GPS to PS (Step 2) Here we derive the Protocol Specification for each individual site which is a FSM with primitives on that site and the nodes now representing the states in DS where the primitives can happen from the point of view of each individual site. for e.g. a(1) b(2) c(3-7) d(8) e(1-3, 7-8) f(4) g(5) h(6) a b c d T1 T4 e f g h T2 T3 S 12 R 12 R 21 S 21 PS 1 PS 2

12. Real-time Synthesis Notations Timed transition and Timed automaton Let I = [a; b] be an interval, where b > a >= 0 We define a timed transition Tr – [q, E, r; C, v] where (a)[q, E, r] represents a transition as in the FSA SS (b)C = (I 1, I 2 …, I m ) m > 0 (c)v is a variable with value identifying a transition For a timed transition the definition of v necessitates to know the incoming transitions of r and the definition of C necessitates to know the incoming transitions of q

13. Back to our Example ( with TA) 1 – Dashboard, 2 – Brake System Tr1 – [1, A 1, 2; c1, 1], T2 – [2, B 2, 3; c2, 1] Tr3 – [3, C 2, 4; c3, 1], T4 – [4, D 1, 1; c4, 1] A 1 -push button B 2 –apply brakes C 2 –reset brakes D 1 –reset button Tr4 Tr1 - I1 [0; X] Tr1 Tr2 - I2 [0; 0.25] Tr2 Tr3 - I3 [0; 0.25] Tr3 Tr4 - I4 [0; 0.5] SS described by TA – SST PS i described by TA - PST i 1 2 3 4 Tr1 Tr2 Tr3 Tr4 SST

14. Real Time Protocol Synthesis Given SST as the input Derivation Procedure 1 Implement causal ordering of primitives executed at various sites from the point of view of the DS to get the GPST (Global Protocol Specification in Real Time) 2 Insert into GPST temporal constraints and message delays to obtain GST 3 Compute the Protocol Specification in Real Time (PST) of each PE i that must be implemented in Sitei by projecting GST into events occurring in Sitei omitting medium delay

15. Temporal Constraints From requirements t m ε M a,b = [µ a,b ; ρ a,b ] and t k ε I k = [γ k, δ k ] ( k = 1, 2, …, n) we must compute constraints on t s and tr k (k = 1, 2, …, n) which ensure that requirements tk ε Ik on the service will be respected. These derived constraints are written in the form t s ε S = [θ k ;φ k ], and tr k ε R k = [τ k ;ω k ] for k = 1,2, …, n. This computation must be made for each occurrence of the structure in the GPST. Tr r ba s ab Tr k tsts tmtm tr k tktk

16. Current System… A component assembly framework supporting a variety of visualization and programming tools for developing component connections.

17. Feature Addition… Apply causality constraints to the primitives being executed. Check for temporal constraints required for real time event based communication. Simulate temporal constraints exhibited by the communication medium.

18. System Overview There are two ways of constructing a software design; one way is to make it so simple that there are obviously no deficiencies, and the other way is to make it so complicated that there are no obvious deficiencies. The first method is far more difficult. C. A. R. Hoare SS XML parserProtocol Synthesis Model Checking for Timing Constraints XML Dump Application Specific Code generation Hard wired Code Generation Event Service Based Impl SS in XML

19. Tools and Technologies… XML for input and output specification of the system. Java to develop modules for protocol synthesis. XML is being used at various levels to provide flexibility in the system and to make the module easily pluggable in any environment.