Given an arbitrary DAG-based event-network, think FRP-networks, it should be possible to create an "optimal" imperative representation that it could be compiled to. This probably involves topological sorting and graph reduction algorithms.
Is there some standard literature that could be recommended on this topic? My Google-fu fails me at this point.