Abstract
Formal representations of business processes are used for analysis of the process behavior. Workflow nets are a widely used formalism for describing the behavior of business processes. Structure theory of processes investigates the relation between the structure of a model and its behavior. In this paper, we propose to employ the connectivity property of workflow nets as an angle to their structural analysis. In particular, we show how soundness verification can be organized using biconnected components of a workflow net. This allows for efficient identification and localization of flaws in the behavior of workflow nets and for supporting process analysts with diagnostic information. © Springer-Verlag 2010.
Cite
CITATION STYLE
Polyvyanyy, A., Weidlich, M., & Weske, M. (2010). The biconnected verification of workflow nets. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 6426 LNCS, pp. 410–418). https://doi.org/10.1007/978-3-642-16934-2_29
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
