The Biconnected Verification of Workflow Nets

被引：0

作者：

Polyvyanyy, Artem ^{[1
]}

Weidlich, Matthias ^{[1
]}

Weske, Mathias ^{[1
]}

机构：

[1] Univ Potsdam, Hasso Plattner Inst, Business Proc Technol Grp, D-14482 Potsdam, Germany

来源：

ON THE MOVE TO MEANINGFUL INTERNET SYSTEMS: OTM 2010, PT I | 2010年 / 6426卷

关键词：

PETRI NETS;

D O I：

暂无

中图分类号：

TP [自动化技术、计算机技术];

学科分类号：

0812 ;

摘要：

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.

引用

页码：410 / 418

页数：9

共 17 条

[1]

BERTHELOT G, 1987, LECT NOTES COMPUT SC, V254, P359

[2]

DESEL J, 1995, FREE CHOICE PETRI NE

[3] Tool support for verifying UML activity diagrams [J].

Eshuis, R ;

Wieringa, R .

IEEE TRANSACTIONS ON SOFTWARE ENGINEERING, 2004, 30 (07) :437-447

[4]

Fahland D, 2009, LECT NOTES COMPUT SC, V5701, P278, DOI 10.1007/978-3-642-03848-8_19

[5]

Gutwenger C., 2001, LNCS, V1984, P77, DOI DOI 10.1007/3-540-44541-2_8

[6] EFFICIENT ALGORITHMS FOR GRAPH MANIPULATION [J].

HOPCROFT, J ;

TARJAN, R .

COMMUNICATIONS OF THE ACM, 1973, 16 (06) :372-378

[7]

Hopcroft J. E., 1973, SIAM Journal on Computing, V2, P135, DOI 10.1137/0202012

[8]

Lohmann N, 2008, LECT NOTES COMPUT SC, V4937, P77

[9] PETRI NETS - PROPERTIES, ANALYSIS AND APPLICATIONS [J].

MURATA, T .

PROCEEDINGS OF THE IEEE, 1989, 77 (04) :541-580

[10]

POLYVYANYY A, 2010, WS FM IN PRESS

← 1 2 →