TU Darmstadt / ULB / TUbiblio

On quantitative Network Complexity Measures for Business Process Models

Borgert, Stephan ; Dehmer, Matthias ; Aitenbichler, Erwin (2009):
On quantitative Network Complexity Measures for Business Process Models.
In: Acta Universitates Apulensis, (18), p. 10. [Article]

Abstract

This work investigates measures to quantify structural com- plexity to be applied to complex business process models. In particular, we mainly focus on applying information-theoretic measures to characterize the underlying process graph structurally. Moreover, we examine the relatedness between these measures by using a set containing business processes represent- ing networks.

Item Type: Article
Erschienen: 2009
Creators: Borgert, Stephan ; Dehmer, Matthias ; Aitenbichler, Erwin
Title: On quantitative Network Complexity Measures for Business Process Models
Language: German
Abstract:

This work investigates measures to quantify structural com- plexity to be applied to complex business process models. In particular, we mainly focus on applying information-theoretic measures to characterize the underlying process graph structurally. Moreover, we examine the relatedness between these measures by using a set containing business processes represent- ing networks.

Journal or Publication Title: Acta Universitates Apulensis
Issue Number: 18
Uncontrolled Keywords: - SE - Area Smart Environments;- SE: Service Composition;complexity, entropy, business processes
Divisions: 20 Department of Computer Science > Telecooperation
20 Department of Computer Science
Date Deposited: 31 Dec 2016 12:59
Identification Number: TUD-CS-2009-0286
PPN:
Export:
Suche nach Titel in: TUfind oder in Google
Send an inquiry Send an inquiry

Options (only for editors)
Show editorial Details Show editorial Details