
 
transformation between elements is specified by its 
appropriate transition. 
Element Transformation Log – is a layer of the 
model which depicts all transformations performed 
in the model. This log records the “pedigree” of all 
elements in the model (i.e., relations of predecessor-
successor type in the model). 
3 SUCCESSIVE CONSTRUCTION 
OF INFORMATION SYSTEM 
Successive modeling of information system in small 
steps (for context and relevance assurance) can be 
seen as successive adding of new elements to the 
existing model. For correctness assurance we 
propose to abide the following rules: 
•  Every new element added to the model of 
the information system must have sense. 
•  Every new element must be created by a 
relevant (for given moment and given 
elements) transformation from the elements 
already present in the model (predecessor-
successor relation). 
•  So-called entry elements exist in the model. 
They have no predecessor in the model and 
were created directly from the specification.  
If those rules are followed, a new layer of model is 
constructed along with the model. The layer will 
show which elements originated from which 
elements and will record transformations among 
them (the pedigree of all elements in the model will 
be available). If the origins of all elements are 
recorded, a powerful tool for relevance checking is 
obtained. More about the construction of the element 
transformation log is in Picka 2004. 
4 CONCEPT TRANSITION 
MODEL 
During the IS design, the construction of the element 
transition log helps us to just a limited extent.  The 
above mentioned rules just tell us that we cannot add 
new elements arbitrarily – every newly added 
element shall have its predecessor. This forces the 
designer to think about the context of every newly 
added element and it decreases the probability of 
errors in design. However, the designer is not 
advised as to by which transformation a new 
element is created. So, during the design of IS it 
would be worth knowing, which elements can occur 
in a given context. To this end, we need to specify 
admissible transformations. 
 
The creation of new elements is driven by the 
method of analysis and design of the information 
system. The method specifies which transformations 
can be in used in a given context and which new 
elements can be created. So we need to depict the 
terms used in the method and the possible transitions 
between them. We need to create a “data-flow” 
model of the method. We named this model the 
Concept Transition Model. 
 
Unfortunately, in the methods used for analysis and 
design of ISs those transitions are not explicitly 
specified. For their depicting we need a new 
apparatus. It is described in following paragraphs. 
4.1  An Example of Transition Model 
For illustrative reasons we will first show an 
example of model of transitions between the 
concepts of the model. For simplicity, we choose the 
transformation between the Chen entity-relationship 
diagram and the physical model of a relational 
database. This transformation is well-known and is 
often used. Almost every CASE tool used for 
relational database modelling does it automatically. 
Let us remind how it is done: 
1  Transform all entities to tables. 
2  If a relationship between entities is binary 
and of 1:N type without attributes, then 
transform the relationship to a new 
attribute (foreign key) and add it to the 
attributes of the table on the N-side. If the 
relationship is of 1:1 type, add foreign key 
to one of the tables. 
3  Otherwise transform the relationship to a 
table. Add foreign keys pointing to the 
related tables to the attributes. 
4  Transform remaining attributes of entities 
and relationships to attributes in the tables. 
This word-description is depicted using the diagram 
of concept transition in Figure 1. It can be seen, that 
(one) entity transforms into (one) table. A 
relationship can transform either into an attribute 
(foreign key) or into a table with two or more 
(according to the relationship’s level) foreign keys 
(attributes). Attributes of entities and relationships 
transform to attributes of tables. 
 
The above described word-description is better 
expressed by an algorithm, but a diagram better 
depicts relationships and possibilities in the 
GRADUAL MODELING OF INFORMATION SYSTEM - Model of Method Expressed as Transitions Between Concepts
539