3 ms·

Finite state machines are an ideal mechanism to with concurrency if you put a concurrent queue in front of them. Such a program is easily coded with Akka's FSM

Finite state machines are an ideal mechanism to with concurrency if you put a concurrent queue in front of them. Such a program is easily coded with Akka's FSM trait. It even adds the possibility to trigger transition based on timer. As soon as you are in the realm of time sensitive programs, i.e. because of network requests, this is a very powerful and easy to understand way to program complicated parts of programs.

dustingetz 4y ago
for others: https://doc.akka.io/docs/akka/current/typed/fsm.html https://doc.akka.io/docs/akka/current/typed/fsm.html https://doc.akka.io/docs/akka/current/typed/persistence-fsm.html#eventsourced-behaviors-as-finite-state-machines https://doc.akka.io/docs/akka/current/typed/persistence-fsm.... Is ^ demonstrating the equivalence between FSMs and event streams? or are they not quite identical just closely related?