23.02.2015 Views

D.3.3 ALGORITHMS FOR INCREMENTAL ... - SecureChange

D.3.3 ALGORITHMS FOR INCREMENTAL ... - SecureChange

D.3.3 ALGORITHMS FOR INCREMENTAL ... - SecureChange

SHOW MORE
SHOW LESS

Create successful ePaper yourself

Turn your PDF publications into a flip-book with our unique Google optimized e-Paper software.

Dealing with Known Unknowns: A Goal-based Approach 3<br />

Therefore, it is possible to model the evolution of mission-critical requirements<br />

at enterprise level when such evolution is known to be possible, but it is<br />

unknown whether it would happen: the known unknown. We target at capturing<br />

what Loucopoulous and Kavakli [21] identified as the knowledge shared by multiple<br />

stakeholders about “where the enterprise is currently”, “where the enterprise<br />

wished to be in the future”, and “alternative designs” for the desired future state.<br />

Unfortunately, an ATM organization cannot wait that the unknowns becomes<br />

known. The process of tendering and organizational restructuring requires a significant<br />

amount of time and planning. Therefore decision makers at high-level must<br />

essentially bet on the final organizational solution and possibly minimize the risks<br />

that the solutions turns out to be wrong.<br />

In this respect it is important to provide a sound quantitative analysis which<br />

was identified by Dalal et al. in [8] as one of the current weaknesses of enterprise<br />

modelling systems.<br />

1.1 The Contribution of This Paper<br />

Our ultimate goal is to support the decision maker in answering such a question<br />

“Given these anticipated evolutions, what is a the solution to implement an<br />

evolution-resilient system?”. By a solution we mean here either a software or an<br />

organizational solution such as assigning a task to an actor instead of another.<br />

To address this objective we set up a global framework for modeling and reasoning<br />

on evolution in socio-technical systems as follows:<br />

– we introduce the idea of modelling evolutions in terms of two kinds of evolution<br />

rules: controllable and observable rules that are applicable to arbitrary<br />

enterprise and high-level requirements models (from problem frames to goal<br />

models);<br />

– we identify a game-theoretic based explanation for probabilities of an observable<br />

evolution in terms of a game between reality (that finally decides what is<br />

happening), stakeholders (who provide likelihood information on outcomes)<br />

and designers (who bet against the odds);<br />

– we provide two quantitative metrics to help the designer in deciding optimal<br />

things to implement for the system-to-be;<br />

– for the particular case of goal models we provide an optimal algorithm for calculating<br />

such metrics in case of complex scenarios with multiple alternatives;<br />

– also briefly describe a graphical notation for representing such evolution rules<br />

that has been validated in a number of sessions with ATM experts.<br />

The rest of this paper is organized as follows. In the subsequent section (§2) we<br />

describe a case study in the field of Air Traffic Management, by which examples<br />

are extracted to illustrate our approach. Next, we discuss the basic idea of our<br />

generic approach (§3) to deal with known unknown. Then we instantiate it to a<br />

concrete syntax based on goal models that we have used for validation with ATM<br />

experts (§4). We additionally describe a game-theoretic semantics to account for<br />

the evolution probability (§5). The paper is then continue by a discussion of two

Hooray! Your file is uploaded and ready to be published.

Saved successfully!

Ooh no, something went wrong!