Mixed Process algebra and Petri Nets (MPPN) combine Petri net constructs and Process algebra. The modeling language implies a compact representation of complex systems. For general resource booking problems MPPN is used for routing specifications and modeling of resources. These models are formally converted into ordinary Petri nets. The Petri net representations are easily converted into efficient Binary Decision Diagram (BDD). The BDDs are then used used for controller synthesis. It is shown that in specific cases very few boolean variables are required in the BDD representation based on MPPN. This is crucial in order to calculate a controller efficiently.