Based on an earlier work, we present an in-depth discussion of the relationsh- ips between synchrony and asynchrony. Simple models of both paradigms are presented, and we state theorems which guarantee correct desynchronization- , meaning that the original synchronous semantics can be reconstructed from the result of this desynchronization. This theory can be used as a basis for correct distributed code generation. The present paper presents a new data structure, the hierarchic normal form for a transition relation, which is instrumental in implementing this theory. We illustrate this on a example. The whole approach is implemented in the Signal compiler.