Between each pair of terms in this sequence is the amount the sequence is decreasing by. The 𝒏th term refers to a term's position in the sequence, for example, the first term has 𝒏 = 1, the second ...
Abstract: This paper studies controllable sequences in the max-algebra model of timed event graphs. We present a formula for the supremal controllable sequence when a desirable behavior is specified ...
Some results have been hidden because they may be inaccessible to you
Show inaccessible results
Feedback