Showing papers by "Brno University of Technology published in 1997"

Extending an Object-Oriented Model: Multiple Class Objects

Abstract: Experiences of both researchers and practitioners with the development of object-oriented database systems help us to evaluate the real contributions of object-oriented modeling principles and show the limits and possibilities of improvements of the object-oriented model. One of the research areas where such a need was recognized concerns the class membership. In most object-oriented data model objects must belong to a single most specific class. However, the real world situations often break this presumption. The aim of this paper is to discuss the issues relating to an extension of modeling concepts to capture the objects that can belong to the multiple most specific classes. Our final objective is to present a framework for the formal object-oriented models that will provide the rigorous theoretical tool to solve issues concerning conflicts that can arise instructural components of objects. Most importantly, we show that the structural conflicts can be solved from the context determined by the static typing.

Extending an object-oriented model : Multiple class objects

Abstract: Experiences of both researchers and practitioners with the development of object-oriented database systems help us to evaluate the real contributions of object-oriented modeling principles and show the limits and possibilities of improvements of the object-oriented model. One of the research areas where such a need was recognized concerns the class membership. In most object-oriented data model objects must belong to a single most specific class. However, the real world situations often break this presumption. The aim of this paper is to discuss the issues relating to an extension of modeling concepts to capture the objects that can belong to the multiple most specific classes. Our final objective is to present a framework for the formal object-oriented models that will provide the rigorous theoretical tool to solve issues concerning conflicts that can arise in structural components of objects. Most importantly, we show that the structural conflicts can be solved from the context determined by the static typing.

Bounds on the Sizes of Decision Diagrams

Abstract: Known upper bounds on the number of required nodes (size) in the ordered binary and multiple-valued decision diagram (DD) for representation of logic functions are reviewed and reduced by a small constant factor. New upper bounds are derived for partial logic functions containing don't cares and also for complete Boolean functions specified by Boolean expressions. The evaluation of upper bounds is based on a bottom-up algorithm for constructing efficient ordered DDs developed by the author. Category: Hardware - Logic Design - Design Aids