Simulation preorder; Simulation quotient; directed acyclic graphs; rank; Simulation algorithms

We consider the algorithmic problem of computing the maximal simulation preorder (and quotient) on acyclic labelled graphs. The acyclicity allows to exploit an inner structure on the set of nodes, that can be processed in stages according to a …