A computational mechanism for parallel problem decomposition during requirements engineering

The earliest phases of requirements engineering capture large amounts of diverse facts about the problem domain. These facts must be structured according to useful decompositions of that problem domain. Existing goal oriented decompositions methods do not address issues specific to such decomposition. The paper outlines a tentative model of parallel problem domain decomposition, and describes a computational mechanism for achieving it. The mechanism accesses a set of problem abstractions produced as part of the ESPRIT III 6353 'NATURE' basic research action.