6533b832fe1ef96bd129a25a

RESEARCH PRODUCT

Equivalence Problem of Composite Class Diagrams

ĢIrts Linde

subject

AlgebraUnified Modeling LanguageComputer scienceComposite numberMultiplicity (mathematics)Class diagramComputer-aided software engineeringcomputerEquivalence (measure theory)computer.programming_language

description

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.

yearjournalcountryeditionlanguage
2001-01-01
https://doi.org/10.1007/3-540-44669-9_26