Software Engineering, Programming Languages, Programming, Saga.
empty sequence ε. S = s; S | ε To get started, let’s define a Saga P as the sequence of three transactions a, b, and c. P = a; b; c; ε SOS is often presented as inference rules, which consist of an upper part (above the line) and a lower part (below the line): The part above the line is called the