A congruence theorem for structured operational semantics with predicates and negative premises

Discrete time process algebra

“…A relation holds on S just when it derivable (as defined in [VER94]) from the following rules. In order to show that these rules give rise to a unique transition relation on closed terms, it helps to use results and terminology of [VER94].…”

“…In order to show that these rules give rise to a unique transition relation on closed terms, it helps to use results and terminology of [VER94]. Bisimulation is defined as usual, so a symmetric binary relation R on process terms is a bisimulation iff the following transfer conditions hold:…”

Process Algebra: An Algebraic Theory of Concurrency

“…That is, if s ↔ s and t ↔ t , then s + t ↔ s + t and s·t ↔ s ·t . This follows from the fact that the transition rules in Table 1 are in the so-called path format [21].…”

Timing the Untimed: Terminating Successfully While Being Conservative

“…x → x y → y x + y → x + y and since bisimilarity is a congruence for both TSS (TSP(A)) and TSS (TSP drt * (A)) (both TSS's are in the PANTH format of [17]), time transitions of p + q that are due to this rule are to bisimilar terms w.r.t. both TSS's.…”