Overview
A Transition defines how a domain evolves its state.
It is the only mechanism through which state can change.
Structure
lexum
transition increment {
step {
count += 1
}
}
Properties
Transitions are:
-
deterministic
-
bounded (limited execution)
-
side-effect controlled
Execution
A transition:
-
reads current state
-
performs computation
-
updates state
-
optionally emits messages
Bounded Execution
Transitions execute in slices:
-
limited by gas / instruction count
-
may yield and resume
Determinism Constraints
Transitions must not depend on:
-
system time
-
randomness
-
external mutable state
Example
lexum
transition scale_up {
step {
if workers < 5 {
workers += 1
}
}
}