Sequential operator for filtering cycles in Boolean networks

Given a Boolean network without negative circuits, we propose a polynomial algorithm to build another network such that, when updated in parallel, it has the same fixed points than the original one, but it does not have any dynamical cycle. To achieve that, we apply a network transformation related to the sequential update. As a corollary, we can find a fixed point in polynomial time for this kind of networks.