AUTOMATA-BASED COMPONENT COMPOSITION ANALYSIS

Formal specification of software components enables automatic composition and checking of component-based systems. The component sys- tem is modeled as a finite automaton. We propose an algorithm that builds all syntactically correct finite automata-based models of a component-based system. The result systems are checked against the properties: lost data and number of provider/inport.