[go: up one dir, main page]
More Web Proxy on the site http://driver.im/ Skip to main content
Log in

Reusing artifact-centric business process models: a behavioral consistent specialization approach

  • Published:
Computing Aims and scope Submit manuscript

Abstract

Process reuse is one of the important research areas that address efficiency issues in business process modeling. Similar to software reuse, business processes should be able to be componentized and specialized in order to enable flexible process expansion and customization. Current activity/control-flow centric workflow modeling approaches face difficulty in supporting highly flexible process reuse, limited by their procedural nature. In comparison, the emerging artifact-centric workflow modeling approach well fits into these reuse requirements. Beyond the classic class level reuse in existing object-oriented approaches, process reuse faces the challenge of handling synchronization dependencies among artifact lifecycles as parts of a business process. In this article, we propose a theoretical framework for business process specialization that comprises an artifact-centric business process model, a set of methods to design and construct a specialized business process model from a base model, and a set of behavioral consistency criteria to help check the consistency between the two process models.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Subscribe and save

Springer+ Basic
£29.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Price includes VAT (United Kingdom)

Instant access to the full article PDF.

Fig. 1
Fig. 2
Fig. 3
Fig. 4

(Taken from Yongchareon et al. [55])

Fig. 5
Fig. 6
Fig. 7
Fig. 8
Fig. 9
Fig. 10
Fig. 11

Similar content being viewed by others

Explore related subjects

Discover the latest articles, news and stories from top researchers in related subjects.

References

  1. Awad A (2007) BPMN-Q: a language to query business processes. In: Proceedings of the 2nd international workshop on Enterprise modelling and information systems architectures concepts and applications (EMISA) 2007, Gesellschaft für Informatik, Bonn, pp 115–128

  2. Awad A, Sakr S, Kunze M, Weske M (2011) Design by selection: a reuse-based approach for business process modeling. In: Proceedings of the 30th international conference on conceptual modeling (ER) 2011, LNCS 6998, pp 332–345

  3. Bloom B (1995) Fundamental study structural operational semantics for weak bisimulations. Theor Comput Sci 146:25–68

    Article  MATH  Google Scholar 

  4. Calvanese D, De Giacomo G, Hull R, Su J (2009) Artifact-centric workflow dominance. In: Proceedings of ICSOC-ServiceWave 2009. LNCS 5900, pp 130–143

  5. Chao T, Cohn D, Flatgard A, Hahn S, Linehan M, Nandi P, Nigam A, Pinel F, Vergo J, Wu F (2009) Artifact-based transformation of IBM global financing. In: BPM 2009, LNCS 5701, pp 261–277

  6. Chiao CM, Künzle V, Reichert M (2013) Object-aware process support in healthcare information systems: requirements, conceptual framework and examples. Int J Adv Life Sci 5(1 & 2):11–26

    Google Scholar 

  7. Cohn D, Hull R (2009) Business artifacts: a data-centric approach to modeling business operations and processes. IEEE Data Eng Bull 32(3):3–9

    Google Scholar 

  8. Curran T, Keller G (1997) SAP R/3 business blueprint: understanding the business process reference model. Prentice Hall, Upper Saddle River

    Google Scholar 

  9. Decker G, Overdick H, Weske M (2008) Oryx—sharing conceptual models on the web. In: Proceedings of ER 2008, LNCS 5231, pp 536–537

  10. Dijkman R, Dumasm M, van Dongen B, Kaarik R, Mendling J (2011) Similarity of business process models: metrics and evaluation. Inf Syst 36:498–516

    Article  Google Scholar 

  11. Fahland D, Leoni MD, van Dongen BF, van der Aalst WMP (2011) Conformance checking of interacting processes with overlapping instances. In: Proceedings of BPM 2011, LNCS 6896, pp 345–361

  12. Fahland D, Leoni MD, van Dongen BF, van der Aalst WMP (2011) Behavioral conformance of artifact-centric process models. In: Proceedings of BIS 2011, LNBIP 87, pp 37–49

  13. Gottschalk F, van der Aalst WMP, Jansen-Vullers M, Rosa ML (2008) Configurable workflow models. Int J Cooperative Inf Syst 17(2):177–221

    Article  Google Scholar 

  14. Harel D, Kupferman O (2002) On object systems and behavioral inheritance. IEEE Trans Softw Eng 28(9):889–903

    Article  Google Scholar 

  15. Hull R (2008) Artifact-centric business process models: brief survey of research results and challenges. In: Proceedings of on the move to meaningful internet systems: OTM 2008, LNCS 5332, pp 1152–1163

  16. Johnson R, Pearson D, Pingali K (1994) The program structure tree: computing control regions in linear time. In: PLDI, Proceedings of the ACM SIGPLAN’94 conference on programming language design and implementation, 1994, ACM Press, New York, pp 171–185

  17. Kumaran S, Liu R, Wu FY (2008) On the duality of information-centric and activity-centric models of business processes. In: CAiSE 2008, LNCS 5074, pp 32–47

  18. Künzle V, Reichert M (2011) PHILharmonicFlows: towards a framework for object aware process management. J Softw Maint Evolut Res Pract 13(4):205–244

    Article  Google Scholar 

  19. Küster JM, Ryndina K, Gall H (2007) Generation of business process models for object life cycle compliance. In: Proceedings of the international conference on business process management (BPM) 2007, LNCS 4714, pp 165–181

  20. Lee J, Wyner GM (2003) Defining specialization for dataflow diagram. Inf Syst 28:651–671

    Article  MATH  Google Scholar 

  21. Lohmann N (2011) Compliance by design for artifact-centric business processes. In: Proceedings of BPM 2011, LNCS 696, pp 99–115

  22. Lohmann N (2013) Compliance by design for artifact-centric business processes. Inf Syst 38:606–618

    Article  Google Scholar 

  23. Lohmann N, Weinberg D (2010) Wendy: a tool to synthesize partners for services. In: Proceedings of the international conference on applications and theory of petri nets and other models of concurrency, 2010, LNCS 6128, pp 297–307

  24. Lohmann N, Massuthe P, Wolf K (2007) Operating guidelines for finite-state services. In: Proceedings of ICATPN 2007, LNCS 4546, pp 321–341

  25. Massuthe P, Schmidt K (2005) Operating guidelines—an automata-theoretic foundation for the service-oriented architecture. In: Proceedings of the fifth international conference on quality software (QSIC’05), pp 452–457

  26. Muller D, Reichert M, Herbst J (2008) A new paradigm for the enactment and dynamic adaptation of data-driven process structures. In: Proceedings of CAiSE 2008, LNCS 5074, pp 48–63

  27. Nigam A, Caswell NS (2003) Business artifacts: an approach to operational specification. IBM Syst J 42(3):428–445

    Article  Google Scholar 

  28. Object Management Group (OMG) (2003) UML 2.0 OCL final adopted specification. Technical report ptc/03-10-14,

  29. Object Management Group (OMG) (2004) UML 2.0 superstructure final adopted specification. Technical report ptc/04-10-02

  30. Process Mining Group (2012) ProM Framework, http://www.processmining.org/prom/start

  31. Reisig W (1985) Petri Nets, EATCS monographs on theoretical computer science. Springer, Berlin

    Google Scholar 

  32. Rosa ML, Reijers HA, Van Der Aalst WMP, Dijkman RM, Mendling J (2011) APROMORE: an advanced process model repository. Expert Syst Appl 38:7029–7040

    Article  Google Scholar 

  33. Rosemann M, van der Aalst WMP (2007) A configurable reference modelling language. Inf Syst 32(1):1–23

    Article  Google Scholar 

  34. Ryndina K, Küster JM, Gall H (2007) Consistency of business process models and object life cycles. In: Proceedings of MoDELS 2006 workshops, 2007, LNCS 4364, pp 80–90

  35. Sakr S, Awad A (2010) A framework for querying graph-based business process models. In: Proceedings of WWW 2010, ACM, pp 26–30

  36. Salton G, Wong A, Yang CS (1975) A vector space model for automatic indexing. Commun ACM 18(11):613–620

    Article  MATH  Google Scholar 

  37. Schrefl M, Stumptner M (2002) Behavior-consistent specialization of object life cycles. ACM TOSEM 11(1):92–148

    Article  Google Scholar 

  38. Stephens S (2001) The supply chain council and the SCOR reference model. Supply Chain Manag Int J 1(1):9–13

    Google Scholar 

  39. Taylor C, Probst C (2003) Business process reference model languages: experiences from BPI projects. In: Proceedings of INFORMATIK 2003, Jahrestagung der Gesellschaft f¨ur Informatik e. V (GI), pp 259–263

  40. Uchitel S, Kramer J, Magee J (2003) Synthesis of behavioral models from scenarios. IEEE Trans Softw Eng 29(2):99–115

    Article  Google Scholar 

  41. van der Aalst WMP (2003) Inheritance of business processes: a journey visiting four notorious problems. Petri Net technology for communication-based systems, pp 383–408

  42. van der Aalst WMP, Basten T (1997) Life-cycle inheritance: a petri-net-based approach, application and theory of petri nets 1997, LNCS 1248, pp 62–81

  43. van der Aalst WMP, Basten T (2001) Identifying commonalities and differences in object life cycles using behavioral inheritance, application and theory of petri nets 2001, LNCS 2075, pp 32–52

  44. van der Aalst WMP, Basten T (2002) Inheritance of workflows: an approach to tackling problems related to change. Theoret Comput Sci 270:125–203

    Article  MathSciNet  MATH  Google Scholar 

  45. van der Aalst WMP, Dumas M, Gottschalk F, Ter Hofstede AHM, Rosa ML, Mendling J (2008) Correctness-preserving configuration of business process models. In: Proceedings of fundamental approaches to software engineering (FASE 2008), LNCS 4961, pp 46–61

  46. van der Aalst WMP, Dumas M, Gottschalk F, ter Hofstede AHM, Rosa ML, Mendling J (2010) Preserving correctness during business process model configuration. Formal Aspects Comput 22(3):459–482

    Article  MATH  Google Scholar 

  47. van der Aalst WMP, Lohmann N, La Rosa M (2012) Ensuring correctness during process configuration via partner synthesis. Inf Syst 37:574–592

    Article  Google Scholar 

  48. van Dongen B, Dijkman R, Mendling J (2008) Measuring similarity between business process models. In: Proceedings of CAiSE 2008, LNCS 5074, pp 450–464

  49. van Glabbeek RJ, Weijland WP (1996) Branching time and abstraction in bisimulation semantics. J ACM 43(3):555–600

    Article  MathSciNet  MATH  Google Scholar 

  50. Vanhatalo J, Volzer H, Leymann F (2007) Faster and more focused control-flow analysis for business process models through SESE decomposition. In: Proceedings of ICSOC 2007, LNCS 4749, pp 43–55

  51. Weidlich M, Dijkman R, Weske M (2010) Deciding behaviour compatibility of complex correspondences between process models. In: Proceedings of BPM 2010, LNCS 6336, pp 78–94

  52. Weidlich M, Mendling J, Weske M (2011) Efficient consistency measurement based on behavioral profiles of process models. IEEE Trans Softw Eng 37(3):410–429

    Article  Google Scholar 

  53. Wyner GM, Lee J (2002) Process specialization: defining specialization for state diagrams. Comput Math Organ Theory 8:133–155

    Article  Google Scholar 

  54. YAWL Foundation (2012) http://ww.yawlfoundation.org/

  55. Yongchareon S, Liu C, Zhao X (2012) A framework for behavior-consistent specialization of artifact-centric business processes. In: BPM 2012, LNCS 7481, pp 285–301

  56. Yongchareon S, Liu C, Yu J, Zhao X (2015) A view framework for modeling and change validation of artifact-centric inter-organizational business processes. Inf Syst 47:51–81

    Article  Google Scholar 

  57. Zdun U, Hentrich C, Dustdar S (2007) Modeling process-driven and service-oriented architectures using patterns and pattern primitives. ACM Trans Web 1(3):14

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Sira Yongchareon.

Additional information

Publisher's Note

Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.

Appendix

Appendix

In this appendix, we provide detailed proofs of our Lemmas and Theorems.

Proof of Lemma 4.1

We can prove the lemma by construction using the conditions of an AL-fragment (in Definition 4.5), the three inference rules for lifecycle composition (in Definition 3.9), and the soundness condition (in Definition 3.11) to show that if all the conditions of the lemma hold, the composition of all SL-fragments is atomic and sound. We prove the necessity of each of the four conditions as follows.

  • For the first condition We have if \( \ell^{{\varvec{C}_{\varvec{i}} }} \in \varGamma \) is not an AL-fragment, then the resulted fragment from the composition of \( \ell^{{\varvec{C}_{\varvec{i}} }} \) and any other fragment is not an AL-fragment. This is because, based on the three inference rules for the lifecycle composition defined in Definition 3.9, if \( \ell^{{\varvec{C}_{\varvec{i}} }} \) has either multiple entry or exit transitions or both, the composition yields multiple transitions for the synchronized product as well. The first condition holds the soundness condition since the AL-fragment is always sound and no synchronization is stated in this condition.

The second, third, and fourth conditions of Lemma 4.1 are used to restrict two SL-fragments (to be composed for S-region) to have all sync rules and transitions that are necessary for synchronizing L-fragments in \( \varvec{\varGamma} \). We can prove that the three conditions are necessary as follows.

  • For the second condition Consider a transition with a sync rule. Based on the inference rule 3.3 for the synchronization composition defined in Definition 3.9, every sync rule that is used to synchronize between two lifecycles, those transitions, and states related to the sync rule will be included in the synchronized product. So, if a sync rule is used to synchronize \( \ell^{{\varvec{C}_{\varvec{i}} }} \) with any L-fragment that is not in \( \varGamma \), then a transition and its related states of such L-fragment will be included in the composition result. This clearly means that there will exist a transition from/to a state that does not belong to any L-fragment in \( \varGamma \); therefore, the result fragment does not satisfy the condition of AL-fragment.

  • For the third and fourth conditions The third condition is used to restrict all the entry transitions of one fragment to be synchronized with all the entry transitions of another fragment to be composed. Similarly, the third condition is for the exit transitions. Consider an entry or exit transition with a sync rule. Assume two synchronized L-fragments with multiple entry transitions and there exists an entry transition in one fragment that does not synchronize with any entry transition of another fragment. Based on the inference rule (3.3) in Definition 3.9, the composed entry transition in the synchronized product derived from that transition will never fire since no sync rule is induced on it; therefore, the goal-reachability of the composed fragment is violated. The same problem also occurs in the case of having an exit transition of one fragment without a sync rule on the exit transition of another fragment to be composed. Therefore, the soundness cannot be guaranteed without these two conditions.

This completes the proof of Lemma 4.1.\( \hfill\square \)

Proof of Lemma 4.2

We can prove it by construction using the ex-lifecycle condition (in Definition 4.11), the B-consistency condition (in Definition 4.2), the condition for atomic composition of SL-fragments (in Lemma 4.1), and the condition of B-consistent refined L-fragment (in Theorem 4.1) to show that if the conditions of Lemma 4.2 hold, \( \ell \) is B-consistent with \( {\mathcal{L}}_{Y}^{{\prime }} \otimes \ell \). Revisiting the four conditions in Lemma 4.1, the composition of two SL-fragments is considered as a composite AL-fragment in the synchronized product if the SL-fragments are AL-fragment and the sync rules of entry/exit transitions of one fragment completely synchronize the entry/exit transitions of another fragment. Here in Lemma 4.2, the AL-fragment condition conforms to the first condition of Lemma 4.1 and the ex-lifecycle condition (in Definition 4.11) conforms to the second, third, and fourth conditions of the Lemma 4.1. Followed from Theorem 4.1, the composed lifecycle can be considered as a refined, composite AL-fragment (composed of \( {\mathcal{L}^{\prime}}_{{C_{y} }} \) and \( \ell \)) in \( \ell \); therefore, the composed lifecycle is B-consistent with \( \ell \).\( \hfill \square \)

Proof of Lemma 4.3

Similar to the proof of Lemma 4.2, we can prove it by construction using Definition 4.12, the B-consistency condition (in Definition 4.2), the condition for the atomic composition of SL-fragments (in Lemma 4.1), and the condition of B-consistent refined L-fragment (in Theorem 4.1). This proof can be achieved based on the proof of Lemma 4.1. If the composition of two synchronized fragments in the refined S-region is atomic, then based on Theorem 4.1 (by considering refined S-region as a refined L-fragment), the B-consistency is preserved. \(\hfill \square \)

Proof of Lemma 4.4

The proof can be derived from Lemmas 4.2 and 4.3 as the refinement of an existing artifact satisfies the condition of Lemma 4.3 and the artifact extension satisfies the condition of Lemma 4.2.\( \hfill\square \)

Proof of Lemma 4.5

The proof can be derived from Lemma 4.4 and Definition 4.13 by taking into account the transitivity property of sync rules and the lifecycle composition (in Definition 3.9).\( \hfill\square \)

Proof of Lemma 4.6

We can prove it by construction using Definitions 4.14, 4.15, 4.16, the B-consistency condition (in Definition 4.2), and the condition for the atomic composition of SL-fragments (in Lemma 4.1) to show that if the conditions of Lemma 4.6 holds, the lifecycle composition of every transition in \( T^{re} \) is B-consistent with the lifecycle composition of every L-fragment in \( L^{re} \) and \( {\mathcal{L}}_{Y} \). For every reducible L-fragments in \( L^{re} \), it is reduced into a transition. Based on Definitions 4.14, 4.15, and Lemma 4.1, the composition of reducible L-fragments (with corresponding reduced sync rules) can be considered as a composite AL-fragment; therefore, can be reduced without violating the B-consistency condition.\( \hfill\square \)

Proof of Theorem 4.1

The theorem can be proved by checking: for each statement of the theorem, a refined L-fragment (in Definition 4.5) does not violate the B-consistency condition (in Definition 4.2).

  • Consider the first statement of the theorem. An AL-fragment that refines a base lifecycle always preserves the B-consistency condition as the AL-fragment is atomic and it has a single-entry state and a single exit state. An entire lifecycle of the L-fragment can be completely reduced (or abstracted) in a single transition if such L-fragment is atomic, i.e., being an AL-fragment. We can see that the condition of AL-fragment (in Definition 4.5) naturally conforms to Conditions 4.1 and 4.2 of the B-consistency (Definition 4.2)

  • Consider the second statement of the theorem. We can see that the condition of this statement restricts a refined L-fragment to be completely encapsulated within a single state. For every L-occurrence of the L-fragment, it must be originated from a transition fired from an outside state (not in the L-fragment) and must reach to a transition fired to another outside state. We can see that the condition for substituting a state with a refined L-fragment conforms to Condition 4.3 of the B-consistency (Definition 4.2).

This completes the proof of Theorem 4.1.\( \hfill\square \)

Proof of Theorem 4.2

The theorem can be proved by construction using the three inference rules for lifecycle composition (in Definition 3.9), the soundness condition (in Definition 3.11), and the B-consistency condition (in Definition 4.2). As refined L-fragments do no introduce any synchronization dependencies to specialized artifacts, then the proof follows that the composed lifecycle is always sound. As the conditions of Theorem 4.1 restrict a specialized artifact preserves the B-consistency when applying refined L-fragments, the lifecycle composition of every specialized artifact is B-consistent.\( \hfill \square \)

Proof of Theorem 4.3

We can prove the theorem as follows.

  • For the if condition, we must prove that if the two statements are satisfied, then \( \Pi^{{\prime }} \) is B-consistent with \( \Pi \). For the first condition, we prove that each specialized artifact needs to be B-consistent with its base artifact. Based on Definition 4.4, this statement follows from Theorem 4.2. For the second condition, we prove that why each sync specialization needs to be S-consistent. Based on Definition 4.18, this statement follows from Lemmas 4.2, 4.3, 4.5, and 4.6. As each of Lemmas has the condition to preserve the B-consistency for each method of sync specialization (extension, refinement, and reduction), therefore, the second statement holds.

This completes the proof of the if direction.

  • For the only if condition we must prove that the two statements satisfy if \( \Pi^{{\prime }} \) is a behavior-consistent specialization of \( \Pi \). This can be proved based on the definition of ACP Specialization (in Definition 4.1) and the definition of lifecycle specialization B-consistency (in Definition 4.4), and S-consistency (Definition 4.18). In ACP Specialization, we define the three specialization methods: artifact extension, refinement, and reduction. First, the lifecycle B-consistency of each specialized artifact must hold as it follows from Theorem 4.2. Then, consider the three S-consistency conditions based on artifact all these specialization methods.

  • For artifact extension A newly added artifact is not needed to be B-consistent. Either Lemma 4.2 (sync extension) or Lemma 4.5 (sync refinement of existing and extended artifacts), or the combination of them is required.

  • For artifact refinement If there is no synchronization considered, the B-consistency for artifact refinement follows from Theorem 4.2. With synchronization, Theorem 4.2 and Lemma 4.3 (sync refinement) are required.

  • For artifact reduction A removed artifact is not needed to be B-consistent. But the existing artifact with reduced lifecycle must be B-consistent and it follows from Theorem 4.2 and Lemma 4.6 (sync reduction).

This completes the proof of the only if direction.

Therefore, the proof of Theorem 4.3 is complete.\( \hfill\square \)

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Yongchareon, S., Liu, C. & Zhao, X. Reusing artifact-centric business process models: a behavioral consistent specialization approach. Computing 102, 1843–1879 (2020). https://doi.org/10.1007/s00607-020-00798-6

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s00607-020-00798-6

Keywords

Mathematics Subject Classification

Navigation