Timed process algebras with urgent interactions and a unique powerful binary operator

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

“…Another phenomenon that we see in the literature is the use of negative antecedents in rules defining the operational semantics. We mention negative antecedents to operationally describe deadlock detection [18], sequencing [8], priorit.ies [4] probabilist.ic behaviour [19], urgency [10], and various real [17] and discrete time [2] set.t.ings. Now it will not.…”

Foundations of a Compositional Interchange Format for Hybrid Systems

“…This is equivalent to a stopping condition associated to the location that is the disjunction of the guards of all outgoing edges. The second kind of urgency, as for example defined in [6] and [3], is often available with restrictions only. E.g.…”

Structural Operational Semantics

“…For example, predicates are used to express matters like (un)successful termination, convergence, divergence [10], enabledness [41], maximal delay, and side conditions [165]. Negative premises are used to describe, e.g., deadlock detection [137], sequencing [55], priorities [24,65], probabilistic behaviour [139], urgency [58], and various real [136] and discrete time [23,127,223] settings. Since predicates and negative premises are so pervasive, and often lead to cleaner semantic descriptions for many features and constructs of interest, we present the theory of SOS in a setting that deals explicitly with these notions as much as possible.…”