Selmo is based on deterministic rules.
That means: at any time only one valid switch position.
Every transition is uniquely described and verifiable.
This has two decisive consequences:
No parallel logic branches.
There are not two programs that change the same variable at the same time.
This eliminates race conditions and ambiguities.
Safe transition between states.
A state is not left until all active zones have provided their feedback.
As long as this does not happen, the switching mechanism remains halted.
As a result, all processes are not only logically correct but also physically verifiable.
