...
Each machine tracks its own clock. This clock does not ticks tick continuously like a usual clock, but rather its depended it is dependent on the latest timestamp of the received messages. Or timeTime-dependent computation states like state time rules or short performance are applied instantly for the whole period between the last , and the current clock.
(e.g. when there are two messages 10:00:00 → 10:00:10, the rules are evaluated instantly 10 times for all timestamps in-between: 10:00:00, 10:00:01 …. 10:00:10)
...