Abstract
Recently, a lot of work has been done on formalization of business process specification, in particular, using Petri nets and process algebra. However, these efforts usually do not explicitly address complex business process development, which necessitates the specification, coordination, and synchronization of a large number of business steps. It is imperative that these atomic tasks are associated correctly and monitored for countless dependencies. Moreover, as these business processes grow, they become critically reliant on a large number of split and merge points, which additionally increases modeling complexity. Therefore, one of the central challenges in complex business process modeling is the composition of dependent business steps. We address this challenge and introduce a formally correct method for automated composition of algebraic expressions in complex business process modeling based on acyclic directed graph reductions. We show that our method generates an equivalent algebraic expression from an appropriate acyclic directed graph if the graph is well-formed and series-parallel. Additionally, we encapsulate the reductions in an algorithm that transforms business step dependencies described by users into digraphs, recognizes structural conflicts, identifies Wheatstone bridges, and finally generates algebraic expressions.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Workflow Management Coalition (2008), http://www.wfmc.org
Murata, T.: Petri nets: Properties, analysis and applications. Proceedings of the IEEE 77(4), 541–580 (1989)
Baeten, J.C.M., Weijland, W.P.: Process algebra. Cambridge University Press, New York (1990)
Bergstra, J., Ponse, A., Smolka, S.: Handbook of Process Algebra. Elsevier, Amsterdam (2001)
Ghomi, S.F., Rabbani, M.: A new structural mechanism for reducibility of stochastic PERT networks. European Journal of Operational Research (2003)
Russell, N., Hofstede, A.H.M.T., Mulyar, N.: Workflow control-flow patterns: A revised view. Technical report (2006)
Smith, H., Fingar, P.: Workflow is just a pi process (2003), http://www.fairdene.com/picalculus/workflow-is-just-a-pi-process.pdf
jBPM (2008), http://www.packtpub.com/article/jboss-jbpm-concepts-jpdl-jbpm-process-definition-language
Puhlmann, F.: Soundness verification of business processes specified in the pi-calculus. On the Move to Meaningful Internet Systems, 6–23 (2007)
Woodley, T., Gagnon, S.: BPM and SOA: Synergies and challenges. In: Ngu, A.H.H., Kitsuregawa, M., Neuhold, E.J., Chung, J.-Y., Sheng, Q.Z. (eds.) WISE 2005. LNCS, vol. 3806, pp. 679–688. Springer, Heidelberg (2005)
Ferreira, J.E., Takai, O.K., Pu, C.: Integration of collaborative information system in internet applications using riverfish architecture. In: CollaborateCom (2005)
Ferreira, J.E., Takai, O.K., Braghetto, K.R., Pu, C.: Large scale order processing through navigation plan concept. In: IEEE SCC, pp. 297–300 (2006)
Braghetto, K.R., Ferreira, J.E., Pu, C.: Using control-flow patterns for specifying business processes in cooperative environments. In: Cho, Y., Wainwright, R.L., Haddad, H., Shin, S.Y., Koo, Y.W. (eds.) SAC, pp. 1234–1241. ACM, New York (2007)
Gualtieri, A., Dell’Armi, T., Leone, N.: Process representation and reasoning using a logic formalism with object-oriented features. In: BPM Workshops, pp. 153–163 (2006)
Milner, R.: Communicating and Mobile Systems: the Pi-Calculus. Cambridge University Press, Cambridge (1999)
van der Aalst, W.M.P.: Pi calculus versus petri nets: let us eat humble pie rather than further inflate the pi hype. BPM Trends 3, 1–11 (2005)
Fokkink, W.: Introduction to Process Algebra. Springer, New York (2000)
van der Aalst, W.M.P., ter Hofstede, A.H.M., Kiepuszewski, B., Barros, A.P.: Workflow patterns. Distributed and Parallel Databases 14, 5–51 (2003)
Gschwind, T., Koehler, J., Wong, J.: In: Applying Patterns during Business Process Modeling, pp. 4–19 (2008)
Müller, D., Reichert, M., Herbst, J.: Data-driven modeling and coordination of large process structures. On the Move to Meaningful Internet Systems (2007)
Müller, D., Reichert, M., Herbst, J.: A new paradigm for the enactment and dynamic adaptation of data-driven process structures. In: Advanced Information Systems Engineering, pp. 48–63 (2008)
Müller, D., Reichert, M., Herbst, J., Köntges, D., Neubert, A.: Corepro sim: A tool for modeling, simulating and adapting data-driven process structures. In: Dumas, M., Reichert, M., Shan, M.-C. (eds.) BPM 2008. LNCS, vol. 5240, pp. 394–397. Springer, Heidelberg (2008)
Nigam, A., Caswell, N.S.: Business artifacts: an approach to operation specificaiton. IBM Journal 42, 428–445 (2003)
Bhattacharya, K., Caswell, N.S., Kumaran, S., Nigam, A., Wu, F.Y.: Artifact-centered operational modeling: Lessons from artifact-centered operational modeling: Lessons from customer engagements. IBM Journal 46, 703–721 (2007)
Zuliane, D., Oikawa, M.K., Malkowski, S., Alcazar, J.P., Ferreira, J.E.: The riverfish approach to business process modeling: Linking business steps to control-flow patterns. In: CollaborateCom (2008)
Wu, Q., Pu, C., Sahai, A., Barga, R.S.: Categorization and optimization of synchronization dependencies in business processes. In: ICDE, pp. 306–315 (2007)
Gadducci, F.: Graph rewriting for the π-calculus. Mathematical. Structures in Comp. Sci. 17, 407–437 (2007)
Bang-Jensen, J., Gutin, G.: Digraphs: Theory, Algorithms and Applications, 2nd edn. Springer, Heidelberg (2002)
Duffin, R.J.: Topology of series-parallel networks. J. Mathematical Analysis and Applications, 303–318 (1965)
Valdes, J.: Parsing flowcharts and series-parallel graphs. Technical report 1978 (1978)
Valdes, J., Tarjan, R., Lawler, E.: The recognition of series parallel digraphs. SIAM J. Comput., 298–313 (1982)
Schoenmakers, B.: A new algorithm for the recognition of series parallel graphs. CWI Report CS-R9504 (1995)
Ohlebusch, E.: Advanced Topics in Term Rewriting. Springer, Heidelberg (2002)
Plump, D.: Confluence of graph transformation revisited. In: Processes, Terms and Cycles, pp. 280–308 (2005)
Corradini, A., Montanari, U., Rossi, F., Ehrig, H., Heckel, R., Loewe, M.: Algebraic approaches to graph transformation, part i: Basic concepts and double pushout approach. Technical Report TR-96-17, Corso Italia 40, 56125 Pisa, Italy (1996)
Andries, M., Engels, G., Habel, A., Hoffman, B., Kreowski, H.-J., Kuske, S., Plump, D., Schürr, A., Taentzer, G.: Graph transformation for specification and programming. Science of Computer Programming 34, 1–54 (1999)
Korenblit, M., Levit, V.E.: On algebraic expressions of series-parallel and Fibonacci graphs. In: Calude, C.S., Dinneen, M.J., Vajnovszki, V. (eds.) DMTCS 2003. LNCS, vol. 2731. Springer, Heidelberg (2003)
Naummann, V.: Measuring the distance to series-parallelity by path expressions. In: Mayr, E.W., Schmidt, G., Tinhofer, G. (eds.) WG 1994. LNCS, vol. 903, pp. 269–281. Springer, Heidelberg (1995)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2009 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Oikawa, M.K., Ferreira, J.E., Malkowski, S., Pu, C. (2009). Towards Algorithmic Generation of Business Processes: From Business Step Dependencies to Process Algebra Expressions. In: Dayal, U., Eder, J., Koehler, J., Reijers, H.A. (eds) Business Process Management. BPM 2009. Lecture Notes in Computer Science, vol 5701. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-03848-8_7
Download citation
DOI: https://doi.org/10.1007/978-3-642-03848-8_7
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-03847-1
Online ISBN: 978-3-642-03848-8
eBook Packages: Computer ScienceComputer Science (R0)