Introduction to algorithms
Free choice Petri nets
Liveness, fairness, and recurrence in Petri nets
Information Processing Letters
Communicating and mobile systems: the &pgr;-calculus
Communicating and mobile systems: the &pgr;-calculus
Component-based software architectures: a framework based on inheritance of behavior
Science of Computer Programming
Sap R/3 Process Oriented Implementation
Sap R/3 Process Oriented Implementation
Inheritance of workflows: an approach to tackling problems related to change
Theoretical Computer Science
Distributed and Parallel Databases
ICATPN '97 Proceedings of the 18th International Conference on Application and Theory of Petri Nets
IEEE Transactions on Software Engineering
Translating unstructured workflow processes to readable BPEL: Theory and implementation
Information and Software Technology
Reactive Petri nets for workflow modeling
ICATPN'03 Proceedings of the 24th international conference on Applications and theory of Petri nets
Soundness and separability of workflow nets in the stepwise refinement approach
ICATPN'03 Proceedings of the 24th international conference on Applications and theory of Petri nets
Query nets: interacting workflow modules that ensure global termination
BPM'03 Proceedings of the 2003 international conference on Business process management
ProM 4.0: comprehensive support for real process analysis
ICATPN'07 Proceedings of the 28th international conference on Applications and theory of Petri nets and other models of concurrency
Understanding the occurrence of errors in process models based on metrics
OTM'07 Proceedings of the 2007 OTM Confederated international conference on On the move to meaningful internet systems: CoopIS, DOA, ODBASE, GADA, and IS - Volume Part I
What makes process models understandable?
BPM'07 Proceedings of the 5th international conference on Business process management
Faulty EPCs in the SAP reference model
BPM'06 Proceedings of the 4th international conference on Business Process Management
A GP Process Mining Approach from a Structural Perspective
AICI '09 Proceedings of the International Conference on Artificial Intelligence and Computational Intelligence
An entropy-based uncertainty measure of process models
Information Processing Letters
Quality assessment of business process models based on thresholds
OTM'10 Proceedings of the 2010 international conference on On the move to meaningful internet systems - Volume Part I
Towards thresholds of control flow complexity measures for BPMN models
Proceedings of the 2011 ACM Symposium on Applied Computing
Investigations on Stochastic Information Control Nets
Information Sciences: an International Journal
Discovering process models from event multiset
Expert Systems with Applications: An International Journal
Data-bound variables for WS-BPEL executable processes
Computer Languages, Systems and Structures
Empirical assessment of business model transformations based on model simulation
ICMT'12 Proceedings of the 5th international conference on Theory and Practice of Model Transformations
A simulation-based decision support system to model complex demand driven healthcare facilities
Proceedings of the Winter Simulation Conference
Assigning Ontological Meaning to Workflow Nets
Journal of Database Management
Hi-index | 0.00 |
Process modeling languages such as EPCs, BPMN, flow charts, UML activity diagrams, Petri nets, etc., are used to model business processes and to configure process-aware information systems. It is known that users have problems understanding these diagrams. In fact, even process engineers and system analysts have difficulties in grasping the dynamics implied by a process model. Recent empirical studies show that people make numerous errors when modeling complex business processes, e.g., about 20% of the EPCs in the SAP reference model have design flaws resulting in potential deadlocks, livelocks, etc. It seems obvious that the complexity of the model contributes to design errors and a lack of understanding. It is not easy to measure complexity, however. This paper presents three complexity metrics that have been implemented in the process analysis tool ProM. The metrics are defined for a subclass of Petri nets named Workflow nets, but the results can easily be applied to other languages. To demonstrate the applicability of these metrics, we have applied our approach and tool to 262 relatively complex Protos models made in the context of various student projects. This allows us to validate and compare the different metrics. It turns out that our new metric focusing on the structuredness outperforms existing metrics.