From Kahn networks to Dataflow networks
Each process becomes an actor: set of pairs of
- firing rule
(number of required tokens on inputs)
- function
(including number of consumed and produced tokens)
Formally shown to be equivalent, but actors with firing are more intuitive
Mutually exclusive firing rules imply monotonicity
Generally simplified to blocking read