Reusing available software components in developing new systems is always a priority, as it usually saves a considerable amount of time, money, and human effort. Since it might not always be possible to find a single component that provides the sought functionality, an ideal scenario for software reuse would be to build a new software system by composing existing components based on their behavioral properties. In this paper we take advantage of logical reasoning to find a solution for automatic composition of stateless components. Stateless components are components with a simple two step behavior: they receive all their inputs at the same time, and then return the corresponding outputs also at the same time. We provide concrete algorithms to find possible component compositions for a requested behavior. We then validate the returned compositions using composition algebraic rules. Composition algebra is a minimal process algebra that is specifically designed for this validation. In order to understand the functionality of the proposed approach in realistic situations, we also study some of the experimental results obtained by implementing the algorithm and running it on some test cases.
JavaScript jest wyłączony w Twojej przeglądarce internetowej. Włącz go, a następnie odśwież stronę, aby móc w pełni z niej korzystać.