6. Decomposition of Concurrent Control Systems

This chapter deals with decomposition of concurrent control systems. The main aim of such a process is to split the control algorithm into sequential subsystems. Each of decomposed modules can be implemented separately, even with application of various devices. Furthermore, the functionality of the particular sequential subsystem can be reconfigured without touching the rest of the device. Three SM-decomposition methods are shown in the chapter. All of them refer to the concurrent control systems described by an interpreted Petri net. The first one is based on the classical linear algebra and place invariants computation. The second method uses perfect graph theory, while the remaining one applies calculation of exact transversals.