{[ promptMessage ]}

Bookmark it

{[ promptMessage ]}

CSP-case-study-1

# Thus when β = e l e l = s l we define train t,l =

This preview shows pages 4–8. Sign up to view the full content.

This preview has intentionally blurred sections. Sign up to view the full version.

View Full Document

This preview has intentionally blurred sections. Sign up to view the full version.

View Full Document
This is the end of the preview. Sign up to access the rest of the document.

Unformatted text preview: Thus, when β = E ( l ), E ( l ) = S ( l ), we define TRAIN ( t,l ) = reverse.t → TRAIN ( t, ¯ l ) 2 ( 2 S ( m )= β booked.t.m → req.t.m → ( con.t.m → booked.t.m → TRAIN ( t,l,m ) 2 ref.t.m → refused.t.m → TRAIN ( t,l ))) 4 ’ & \$ % Train (2) TRAIN ( t,l,l ) = reverse.t → rel.t.l → TRAIN ( t, ¯ l ) 2 ( goto.t.β → arrive.t.l → leave.t.l → rel.t.l → TRAIN ( t,l )) Note: Communication with driver has one of the forms ”reverse”, ”book”, ”booked”, ”refused”, goto . All other events are communications with a crossing point. 5 ’ & \$ % Crossing Points (1) Crossing points also have unique names (typicaly α , β ). they have two roles. Firstly they act as intermediaries between TRAINs and LINEs. Secondly they only control the timing of transitions from one line to another—specially they only allow one train to be using them at any time (to avoid crashes). 6 ’ & \$ % Crossing Points (2) CP ( α ) = CP 1( α ) k CP 2( α ), where CP 1( α ) = 2 S ( l )= α,t ∈ T req.t.l → get. ( N ( l )) .α → ( con. ( N ( l )) .α → con.t.l → CP...
View Full Document

{[ snackBarMessage ]}

### Page4 / 10

Thus when β = E l E l = S l we define TRAIN t,l =...

This preview shows document pages 4 - 8. Sign up to view the full document.

View Full Document
Ask a homework question - tutors are online