Learn More
As the requirements of the systems change, it is desirable to take these changes into account. To do so, the software must be extended to consider the changes. But the problem is that the modifications on software artifacts may cause conflicts and inconsistencies in the structure of the software, which are difficult to find and time-consuming to correct.(More)
—In this paper, we present a new way to simulate Turing machines using a specific form of Petri nets such that the resulting nets are capable of thoroughly describing behavior of the input Turing machines. We model every element of a Turing machine's tuple F) q0, with an equivalent translation in Colored Petri net's set of elements with priority transitions(More)
Multi-objective optimisation problems normally have not one but a set of solutions, which are called Pareto-optimal solutions or non-dominated solutions. Once a Pareto-optimal set has been obtained, the decision-maker faces the challenge of analysing a potentially large set of solutions. Selecting one solution over others can be quite a challenging task(More)
Binary Knapsack Problem (BKP) is to select a subset of an element (item) set with the highest value while keeping the total weight within the capacity of the knapsack. is paper presents an integer programming model for a variation of BKP where the value of each element may depend on selecting or ignoring other elements. Strengths of such Value-Related(More)
The existing software release planning models aim to find a subset of software requirements with the highest value on the assumption that the value of a selected subset of requirements equals to the Accumulated Value (AV) of that subset. This assumption however, does not hold due to the Value-related Dependencies among software requirements. To address(More)
  • 1