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)
Artikel, Bibliographie

Kurzbeschreibung (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.

Typ des Eintrags: Artikel
Erschienen: 2009
Autor(en): Borgert, Stephan ; Dehmer, Matthias ; Aitenbichler, Erwin
Art des Eintrags: Bibliographie
Titel: On quantitative Network Complexity Measures for Business Process Models
Sprache: Deutsch
Publikationsjahr: Oktober 2009
Titel der Zeitschrift, Zeitung oder Schriftenreihe: Acta Universitates Apulensis
(Heft-)Nummer: 18
Kurzbeschreibung (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.

Freie Schlagworte: - SE - Area Smart Environments;- SE: Service Composition;complexity, entropy, business processes
ID-Nummer: TUD-CS-2009-0286
Fachbereich(e)/-gebiet(e): 20 Fachbereich Informatik > Telekooperation
20 Fachbereich Informatik
Hinterlegungsdatum: 31 Dez 2016 12:59
Letzte Änderung: 15 Mai 2018 12:01
PPN:
Export:
Suche nach Titel in: TUfind oder in Google
Frage zum Eintrag Frage zum Eintrag

Optionen (nur für Redakteure)
Redaktionelle Details anzeigen Redaktionelle Details anzeigen