TY  - JOUR
AU  - Polyvyanyy, A
AU  - Garcia-Banuelos, L
AU  - Fahland, D
AU  - Weske, M
Y2  - 2021/02/01
Y1  - 2014/01/01
SN  - 0010-4620
UR  - http://hdl.handle.net/11343/258887
AB  - This article addresses the transformation of a process model with an arbitrary topology into an equivalent structured process model. In particular, this article studies the subclass of process models that have no equivalent well-structured representation but which, nevertheless, can be partially structured into their maximally-structured representation. The transformations are performed under a behavioral equivalence notion that preserves the observed concurrency of tasks in equivalent process models. The article gives a full characterization of the subclass of acyclic process models that have no equivalent well-structured representation, but do have an equivalent maximally-structured one, as well as proposes a complete structuring method. Together with our previous results, this article completes the solution of the process model structuring problem for the class of acyclic process models.
LA  - English
PB  - Oxford University Press
T1  - Maximal Structuring of Acyclic Process Models
DO  - 10.1093/comjnl/bxs126
IS  - The Computer Journal
VL  - 57
IS  - 1
SP  - 12-35
L1  - /bitstream/handle/11343/258887/029%20-%20COMJ%202014%20-%20Maximal%20Structuring%20of%20Acyclic%20Process%20Models%20-%20POSTPRINT.pdf?sequence=2&isAllowed=y
ER  -