SEKE 2012 Proceedings - Knowledge Systems Institute

Repeat this step for every keyword in KY.
• Case 2: Let Gi ∈ G0 be mapped on concept-set gi,and
to achieve Gi set of tasks T i will be performed.i.e. gi
concept is associated with T i by consists-of relationship.
Let Gi have some happened before relationship with other
subgoals of set G0. Let Gj → Gi → Gk i.e. Gj is
predecessor and Gk is successor of Gi. Then requirement
analysis will be considered as correct if same happenedbefore
relationship exists between corresponding task sets
in ontology. i.e. there exists T j → T i → T k. If ∃
Gi for which uppper condition is not satisf ed then it
can be considered as redundant subgoal in goal graph
after requirment analysis and can be discarded from goal
graph. In this case, add the keywords of goal Gi to the
set US.
• Case 3: Let there is a goal Gi ∈ G0 which has no
happened before relationshiop with other goals of G0.
Similarly in ontology, its corresponding task set T i also
has no happened-before relationship with other corresponding
task set of goals of G0 in ontology. Then
subgoal Gi can be added to the suggestion-list of our
proposed system for requirement analysis stating that it
may be incorrect/irrelevant subgoal in goal graph after requirement
analysis. So analyst is recommended to verify
whether this subgoal should be included in requirement
specif cation.
Correctness can be measured by,
n2=total number of keywords in correctly mapped leaf
level subgoals.
m2=total number of keywords in leaf level subgoals in
goal graph.
Mathematically n2=| (Ky(Gi) ∪ Ky(Gj) ∪ ...∪ Ky(Gk))|
- | US |
m2= | (Ky(Gi) ∪ Ky(Gj) ∪ ...∪ Ky(Gk))|
So, Measure of Correctness, MCOR = n2/m2
3) Conflict: Let from user side requirement R come to our
proposed system. After requirement analysis of requirement R,
we get a goal graph with a set of leaf level indivisible subgoals
represented as a set G0= {G1 , G2,..., Gp }The necessary
condition to occur conf ict is,
For any two Gi, Gj ∈ G0 f(Ky(Gi)) ∩ f(Ky(Gj)) ≠ ∅ where
i ≠ j.
If necessary condition is true then evaluate
A = f(Ky(Gi)) - f(Ky(Gj)) B = f(Ky(Gj)) - f(Ky(Gi))
• Case 1: If both sets A and B each contain single numerical
value then both Gi and Gj are conf icting if
both numerical values are different.i.e. these two subgoals
represent one same fact but by different numerical values.
• Case 2: Now check whether for some (ai, aj) ∈ A× B,
conf ict(ai)=aj or conf ict(aj)=ai. Ifyes,goalGi and aj
are in conf ict, i.e. conf ict(Gi, Gj)=true
• Case 3: Let after mapping of subgoals of G0 to the
ontology the set of tasks required to perform to achieve
all subgoals of G0 can be represented by the set T 0 =
{T 1 , T 2,..., T q }. Now if for any pair (T i, T j) ∈
T 0 X T 0, conf ict(T i)=T or conf ict(T )=T i,then those
Leaf level sub goals of
Goal Graph provided as input
(output)
1. Completeness
2. Correctness
3. Conflict
GUI
OWL Application Programming
Interface (OWL API)
OWL Ontology created in
Protege 4.1
Fig. 2: Architecture of the tool for Automated Requirements
System
Fig. 3: Snapshot of the Ontology created in Protege 4.1
two subgoals associated to corrosponding two tasks are
conf icting. Let n3= total number of (Gi, Gj), Gi ≠Gj,
Gi, Gj ∈G0 for which conf ict(Gi,Gj)=true.
Let m3= total number of (Gi, Gj), Gi ≠Gj, Gi, Gj ∈G0
So, Measure of Conf ict, MCON = n3/m3
V. TOOL DEVELOPMENT
We have shown the architecture of the tool that has been
developed in Figure 2.
A. OWL Ontology of Library Management Systemin Protege
4.1
The ontology for Library Management System(LMS) is
built in Protege 4.1. Protege [15] is an open source tool
to build OWL ontologies. An owl ontology consists of individuals,
Properties and classes. Individuals represent objects
in the domain of interest. Properties are binary relations
on individuals i.e. properties link two individuals together.
OWL classes are interpreted as sets that contain individuals.
They are described formally stating the requirements for the
membership of the class. A snapshot of the ontology for LMS
created in Protege 4.1 is shown in Figure 3.
B. OWL Application Programming Interface(OWL API)
The OWL API [16] is a java Interface and implementation
for the W3C Web Ontology Language(OWL), used to repre-
53