Equivalence Problem of Composite Class Diagrams

2001

Multiplicity constraints in a UML composite class diagram may be inconsistent. An algorithm is given for eliminating all such inconsistencies. Using this algorithm an algorithm is constructed which for two given composite class diagrams solves the equivalence problem. These algorithms can be embedded in CASE tools for automated detection of multiplicity inconsistencies.