Talks and Poster Presentations (with Proceedings-Entry):

I. Feinerer, G. Salzer, T. Sisel:
"Reducing multiplicities in class diagrams";
Talk: 14th International Conference on Model Driven Engineering Languages and Systems, Wellington, New Zealand; 2011-10-16 - 2011-10-21; in: "Lecture Notes in Computer Science", 6981 (2011), ISBN: 978-3-642-24484-1; 379 - 393.

English abstract:
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.

"Official" electronic version of the publication (accessed through its Digital Object Identifier - DOI)

Created from the Publication Database of the Vienna University of Technology.