The biconnected verification of workflow nets


Autoria(s): Polyvyanyy, Artem; Weidlich, Matthias; Weske, Mathias
Contribuinte(s)

Meersman, Robert

Dillon, Tharam

Herrero, Pilar

Data(s)

2010

Resumo

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

Identificador

http://eprints.qut.edu.au/70728/

Publicador

Springer Berlin Heidelberg

Relação

DOI:10.1007/978-3-642-16934-2_29

Polyvyanyy, Artem, Weidlich, Matthias, & Weske, Mathias (2010) The biconnected verification of workflow nets. In Meersman, Robert, Dillon, Tharam, & Herrero, Pilar (Eds.) Lecture Notes in Computer Science : On the Move to Meaningful Internet Systems : OTM 2010, Springer Berlin Heidelberg, Hersonissos, Crete, Greece, pp. 410-418.

Fonte

Science & Engineering Faculty

Palavras-Chave #080500 DISTRIBUTED COMPUTING #080600 INFORMATION SYSTEMS
Tipo

Conference Paper