VIRE: Value Innovation REquirements

VIRE is an article about using Blue Ocean Strategy for the requirements gathering process, published in IEEE Software, Jan/Feb 2008 edition.

The authors propose systematizing the process used between gathering key elements and creating a new strategy canvas (value curve). They describe a hybrid approach where user requirements are iteratively gathered in much the same way they are now, except for an emphasis on requirements gathering from non-customers. Next, a matrix is created that prioritizes and weighs requirements, again much like is done in traditional requirements gathering. Costs are assigned to each element. Finally the key elements are mapped on a 2D axis of importance and cost to decide which elements to eliminate, reduce, raise, and create (ERRC) which is then mapped to a new strategy canvas.

The notion of using a math-based methodology to systematically decide which key elements to ERRC appeals to me as a software engineer: math-based decision support for BOS. However, I think the authors miss the point to some extent by not using the six-path framework to help identify those key elements in the first place. I'm not sure if they intentionally rejected the six-path framework for some reason that isn't articulated, or didn't think it's applicable for requirements gathering. In any event, most traditional BOS practitioner's believe the six-path framework is a cornerstone of BOS: I'll write to the VIRE authors and ask why it's not part of their methodology.

Another element from traditional BOS is the use of the Buyer Utility Map (BUM) as a validation tool that assures the proposed new offering adds adequate value to the buyer. Since the BUM would fit nicely into their proposed new methodology I'm not sure why it's missing and wouldn't be surprised to see it emerge in a future publication.

Here's a link to the VIRE article, published in IEEE Software Journal: VIRE: Sailing a Blue Ocean with Value-Innovation Requirements, IEEE Software, Jan/Feb 2008, written by S. Kim, H. In, J. Baik, R. Kazman, and K. Han.