Intent-based System Design with Efficient Search Using Partial-Order Reduction

Intent-based design (IBD) methods are used for automatically designing system configurations from service requirements. IBD methods based on graph rewriting can receive flexible requirement definitions as input, which are not confined to a specific format, and flexibly respond to the environment and user demands.However, current graph-rewriting-based methods require a large amount of time to discover a concrete system configuration. Therefore, we propose a graph-rewriting-based IBD method that can discover system configurations more efficiently while maintaining the advantages of current graph-rewriting-based methods by introducing a pruning method that focuses on a single unit in the requirements to be resolved.This paper includes a description of a specific procedure of the proposed method, proof that pruning does not reduce the number of variations of generated system configurations, and experimental results of comparing the proposed method with a graph-rewriting-based method without pruning. The results indicate that the proposed method can reduce computation time by 4-10 times compared with the method without pruning.