ON THE CHARACTERIZATION OF TASKS MODELED BY INTERVAL DESIGN STRUCTURE MATRIX ON DOMAIN-DRIVEN DESIGN SOFTWARE DEVELOPMENT

Ivan Petković, Petar Rajković, Aleksandar Milenković

DOI Number
10.22190/FUMI1702181P
First page
181
Last page
193

Abstract


Development and design of new products of various kinds often contain a very complex set of relationships among many coupled tasks. Ranking, controlling and redesigning the features of these tasks can be usefully performed by a suitable model based on the design structure matrix in an iteration procedure. The proposed interval approach of design iteration controls and predicts the convergence speed of iteration work on tasks within a project. Interval method is based on Perron-Frobenius theorem and interval linear algebra where intervals and interval matrices are employed instead of real numbers and real matrices. In this way, a more relaxed quantitative estimation of tasks is achieved and the presence of undetermined quantities is allowed to a certain extent. The presented model is demonstrated in the example of simplified domain-driven design process, an approach to software development.


Keywords

Interval method; Perron-Frobenius theorem; Interval linear algebra; Soft- ware development

Full Text:

PDF

References


S. D. Eppinger and T. R. Browning, Design Structure Matrix Methods and Applications. MIT Press, Cambridge, MA, 2012.

S. D. Eppinger, D. E. Witney, R. P. Smith and D. A. Gebala, A model-based method for organizing tasks in product development. Res. Engineering Design 6 (1994), 1–13.

E. Evans, Domain-Driven Design: Tackling Complexity in the Heart of Software. Addison-Wesley, 2004.

J. P. Keener, The Perron-Frobenius theorem and the ranking of football teams. SIAM Review 35 (1993), 80–93.

G. Mayer, On the convergence of power of interval matrices. Linear Algebra with Applications 58 (1984), 201–216.

G. Mayer, On the convergence of the Neumann series in interval analysis. Linear Algebra with Applications 65 (1985), 63–70.

G. Mayer, Interval Analysis and Automatic Result Verification. Walter de Gruyter (to appear).

C. Meyer, Matrix Analysis and Applied Linear Algebra. SIAM, 2000.

I. Petkovic, Analysis of Processor and Computational Iterations by Applying Modern Computer Arithmetics. Ph. D. Thesis, Faculty of Electronic Engineering, University of Nis, Nis, 2011.

J. Rohn, Perron vectors of an irreducible nonnegative interval matrix. Linear and Multilinear Algebra 54 (2006), 399–404.

J. Rohn, Eigenvalues and eigenvectors of interval matrices (private correspondence).

S. M. Rump, INTLAB - INTerval LABoratory. In: Proceedings of a Conference on Developments in Reliable Computing (T. Csendes, ed.), Kluwer Academic Publishers, Dordrecht, 1999, pp. 77–104.

S. M. Rump, Verification methods: Rigorous results using floating-point arithmetic. Acta Numerica 19 (2010), 287–449.

R. P. Smith, Development and verification of engineering design iteration models. Ph. D. Thesis, MIT Sloan School of Management, Cambridge, MA, 1992.

R. P. Smith and S. D. Eppinger, Identifying controlling features of engineering design iteration. Management Science 43 (1997), 276–293.

D. V. Steward, The design structure system: a model for managing the design of complex systems. IEEE Trans. Engineering Management EM-28 (1981), 71–74.

R. S. Varga, Matrix Iterative Analysis. Springer-Verlag, Berlin-Heidelberg, 2009


Refbacks

  • There are currently no refbacks.




© University of Niš | Created on November, 2013
ISSN 0352-9665 (Print)
ISSN 2406-047X (Online)