Anzeige
Erschienen in:
2011 | OriginalPaper | Buchkapitel
Reducing Multiplicities in Class Diagrams
verfasst von : Ingo Feinerer, Gernot Salzer, Tanja Sisel
Erschienen in: Model Driven Engineering Languages and Systems
Verlag: Springer Berlin Heidelberg
Aktivieren Sie unsere intelligente Suche, um passende Fachinhalte oder Patente zu finden.
Wählen Sie Textabschnitte aus um mit Künstlicher Intelligenz passenden Patente zu finden. powered by
Markieren Sie Textabschnitte, um KI-gestützt weitere passende Inhalte zu finden. powered by
In class diagrams, so-called multiplicities are integer ranges attached to association ends. They constrain the number of instances of the associated class that an instance may be linked to, or in an alternative reading, the number of links to instances of the associated class. In complex diagrams with several chains of associations between two classes (arising e.g. in configuration management) it may happen that the lower or upper bound of a range can never be attained because of restrictions imposed by a parallel chain.
In this paper we investigate how multiplicities behave when chaining associations together, and we characterise situations where intervals can be tightened due to information from other chains. Detecting and eliminating such redundancies provides valuable feedback to the user, as redundancies may hint at some underlying misconception.