Equivalence Problem of Composite Class Diagrams

  • Authors:

  • Girts Linde

  • Affiliations:

  • -

  • Venue:
  • FCT '01 Proceedings of the 13th International Symposium on Fundamentals of Computation Theory
  • Year:
  • 2001

Quantified Score

Hi-index 0.00

Visualization

Abstract

Multiplicity constraints in a UML composite class diagram may be inconsistent. An algorithm is given for eliminating all such inconsistencies. Using this algorithman algorithmis 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.