Synthesis of asynchronous controllers using integer linear programming
The paper presents a new method for checking Uniqueand Complete State Coding, the crucial conditions in thesynthesis of asynchronous control circuits from Signal TransitionGraphs (STGs). The method detects state coding conflictsin an STG using its partial order semantics (unfoldingprefix) and an integer programming technique. This leads tohuge memory savings compared to methods based on reachabilitygraphs, and also to significant speedups in manycases. In addition, the method produces execution pathsleading to an encoding conflict. Finally, the approach is extendedto checking the normalcy property of STGs, which isa necessary condition for their implementability using gateswhose characteristic functions are monotonic.