harel_machines

https://github.com/seuros/harel_machines

A flat finite state machine answers which state comes next. This answers what happens to the states it was inside of: the least common ancestor of a source and a target, the exit set innermost first, the entry set outermost first, parallel regions and history. Bound to Ruby from the no_std harel-machines crate: the tree algebra only, with events, guards and callbacks left to state_machines.