Non-deterministic Sorting ASM
• Non-deterministic sorting by iterating local
swap
choose i,j in dom(a) s.t.i < j & a(i) > a(j)
a(i) := a(j)
a(j) := a(i)
© Egon Börger: Sorting and Sampling
1
Sampling increasing real-time moments
for firing a rule in a discrete time sequence
Goal: approximate a continuous set of rules rule(t,t’) with
t<t’, which are to be fired in a discrete time sequence, by a
finite number of samples with increasing sequence of real
interval boundaries
choose t > currtime in
rule(currtime,t)
samples := add(t,samples)
currtime := t
Here currtime is a monitored function which is supposed to
evolve continuously
© Egon Börger: Sorting and Sampling
2