• search hit 8 of 13
Back to Result List

Maximal structuring of acyclic process models

  • 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.

Export metadata

Additional Services

Search Google Scholar Statistics
Metadaten
Author details:Artem Polyvyanyy, Luciano Garcia-Banuelos, Dirk Fahland, Mathias WeskeORCiDGND
DOI:https://doi.org/10.1093/comjnl/bxs126
ISSN:0010-4620
ISSN:1460-2067
Title of parent work (English):The computer journal : a publication of the British Computer Society
Publisher:Oxford Univ. Press
Place of publishing:Oxford
Publication type:Article
Language:English
Year of first publication:2014
Publication year:2014
Release date:2017/03/27
Tag:fully concurrent bisimulation; maximal structuring; model transformation; process modeling; structured process model
Volume:57
Issue:1
Number of pages:24
First page:12
Last Page:35
Funding institution:Estonian Science Foundation; European Regional Development Fund via the Estonian Centre of Excellence in Computer Science
Organizational units:An-Institute / Hasso-Plattner-Institut für Digital Engineering gGmbH
Peer review:Referiert
Accept ✔
This website uses technically necessary session cookies. By continuing to use the website, you agree to this. You can find our privacy policy here.