Sentence examples for a transition labeled from inspiring English sources

\(δ q,a)\) outputs the set of states that can be reached by taking a transition labeled \(a\) from state \ q\).

The formula A will be true in the state x if A is true in every state reachable from x by a transition labeled π.

However, for a transition labeled d ξ  = 1 and L(d ξ ) equal to any large negative number, or for a transition labeled d ξ  = − 1 and L ( d t ~ ) equal to any large positive number, P(d t  = d (m)) will be small.

A transition labeled π from one state x to a state y noted xRy, or (x,y) ∈ R indicates that starting in x, there is a possible execution of the program π that finishes in y.

Thus, for a transition labeled d ξ  = 1 and L ( d t ~ ) equal to any large positive value,c P(d t  = d (m)) will be large, confirming the transition.

Similarly, for a transition labeled d ξ  = − 1 and L ( d t ~ ) equal to any large negative value P(d t =d (m)) will be large, also confirming the transition.

If (t = (m, sigma, m')) is derivable by the rules of Table 9, and either (|sigma | ge 2) or (sigma ne tau ) and there exists a transition label (sigma ') in its proof tree with (|sigma '| ge 2), then (n sigma ) subseteq mathrm{ns(dom}(m))).

Olshansky and Ault (88) noted that a few years prior to Omran's seminal publication (2), the United States and other Western countries began to experience a rapid decline in cardiovascular mortality which occurred around 1970 in many developed countries; they proposed this cardiovascular revolution as a fourth stage of the transition labeled 'age of delayed degenerative diseases'.

The transition from one discrete state to another, is a discrete transition labelled with a guard μ such as h ≥ p, where h is a clock and p a parameter of the hybrid system.

A state-reward item assigns the real value, resulting from the evaluation of r expression, to all states satisfying the predicate g and a transition-reward item assigns the real value to all transitions labelled with a and from states satisfying g.

If a transition is labeled with (sigma = alpha _1 ldots alpha _{n-1} alpha _n), then all the actions (alpha _1 ldots alpha _{n-1}) are due to strong prefixes, while (alpha _n) is due to a normal prefix (or (alpha _n) is a strong prefix followed by a normal prefix (tau )).