Abstract
This paper presents an algorithm to derive class diagrams and consistency guaranteeing constraints formulated using the unified modeling language (UML) form a semantically irreducible formulated conceptual schema.
Originally a global sight to the universe of discourse can be modeled. All limiting assumptions arising from a special application view or implementation language could be taken into account as late as desired.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
KERN-BAUSCH, L., WENZEL, B. G. (1980): Informationsanalyse Leibniz-Rechen-zentrum Munich, internal paper.
KERN-BAUSCH, L., WENZEL, B. G. (1986): Database Design for Relational Systems: Why, Who, How? European ORACLE Users Group Newsletter, No. 10.
BOOCH, G., RUMBAUGH, J. and JACOBSON, I. (1997): Unified Modeling Language, Version 1.1. Rational Software Corporation, 2800 San Thomas Expressway, Santa Clara, CA 95051–0951 (USA), URL:http://www.rational.com
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1998 Physica-Verlag Heidelberg
About this paper
Cite this paper
Kern-Bausch, L., Jeckle, M. (1998). From a Semantically Irreducible Formulated Conceptual Schema to an UML Model. In: Schader, M., Korthaus, A. (eds) The Unified Modeling Language. Physica-Verlag HD. https://doi.org/10.1007/978-3-642-48673-9_3
Download citation
DOI: https://doi.org/10.1007/978-3-642-48673-9_3
Publisher Name: Physica-Verlag HD
Print ISBN: 978-3-7908-1105-6
Online ISBN: 978-3-642-48673-9
eBook Packages: Springer Book Archive