Decomposition of task specification problems

We consider a synthesis of complex objects by multi-agent system based on rough mereological approach. Any agent can produce complex objects from parts obtained from his sub-agents using some composition rules. Agents are equipped with decision tables describing (partial) specifications of their synthesis tasks. We investigate some problems of searching for optimal task specifications for sub-agents having task specification for a super-agent. We propose a decomposition scheme consistent with given composition rules. The computational complexity of decomposition problems is discussed by showing that these problems are equivalent to some well known graph problems. We also propose some heuristics for considered problems. An illustrative example of decomposition and synthesis scheme for object assembling by multi-agent system is included. We show an upper bound of an error rate in synthesis process of our system. A preliminary results related to the presented approach have been reported in [6, 11].