Control-flow Complexity Measurement of Processes and Weyuker's Properties

Process measurement is the task of empirically and objectively assigning numbers to the properties of business processes in such a way as to describe them. Desirable attributes to study and measure include complexity, cost, maintainability, and reliability. In our work we will focus on investigating process complexity. We define process complexity as the degree to which a business process is difficult to analyze, understand or explain. One way to analyze a process’ complexity is to use a process control-flow complexity measure. In this paper, an attempt has been made to evaluate the control-flow complexity measure in terms of Weyuker’s properties. Weyuker’s properties must be satisfied by any complexity measure to qualify as a good and comprehensive one. Keywords—Business process measurement, workflow, complexity.

[1]  Elaine J. Weyuker,et al.  Comments on "Toward a Framework for Software Measurement Validation" , 1997, IEEE Trans. Software Eng..

[2]  Stewart Green,et al.  Business processes and support systems: design for flexibility , 2007, Softw. Process. Improv. Pract..

[3]  Jorge Cardoso,et al.  About the Data-Flow Complexity of Web Processes , 2005 .

[4]  Maurice H. Halstead,et al.  Elements of software science (Operating and programming systems series) , 1977 .

[5]  Sanjay Misra,et al.  Evaluating cognitive complexity measure with Weyuker properties , 2004 .

[6]  Elaine J. Weyuker,et al.  Evaluating Software Complexity Measures , 2010, IEEE Trans. Software Eng..

[7]  Venansius Baryamureeba,et al.  PROCEEDINGS OF WORLD ACADEMY OF SCIENCE, ENGINEERING AND TECHNOLOGY, VOL 8 , 2005 .

[8]  Norman E. Fenton,et al.  Measurement : A Necessary Scientific Basis , 2004 .

[9]  Barry W. Boehm,et al.  Software Engineering Economics , 1993, IEEE Transactions on Software Engineering.

[10]  Horst Zuse,et al.  A Framework of Software Measurement , 1998 .

[11]  Shari Lawrence Pfleeger,et al.  Reply to: Comments on "Toward a Framework for Software Measurement Validation" , 1997, IEEE Trans. Software Eng..

[12]  Anas N. Al-Rabadi,et al.  A comparison of modified reconstructability analysis and Ashenhurst‐Curtis decomposition of Boolean functions , 2004 .

[13]  Wil M. P. van der Aalst,et al.  The Application of Petri Nets to Workflow Management , 1998, J. Circuits Syst. Comput..

[14]  S. Jayaprakash,et al.  Properties of Control-Flow Complexity Measures , 1991, IEEE Trans. Software Eng..

[15]  Maurice H. Halstead,et al.  Elements of software science , 1977 .