Dependency graphs that represent specifications of systems such as processors can be easily mapped into asynchronous circuits. It, however, has not been known how to derive pipelined dependency graphs systematically. In this paper, we propose an algorithm that can transform given dependency graphs representing repeated execution of operations into pipelined graphs by (1) searching for all pairs of operations that can be pipelined and (2) applying a graph transformation to paths between operations of each pair.