Abstract
Workflow management is concerned with automated support for business processes. Workflow management systems are driven by process models specifying the tasks that need to be executed, the order in which they can be executed, which resources are authorised to perform which tasks, and data that is required for, and produced by, these tasks. As workflow instances may run over a sustained period of time, it is important that workflow specifications be checked before they are deployed. Workflow verification is usually concerned with control-flow dependencies only; however, transition conditions based on data may further restrict possible choices between tasks. In this paper we extend workflow nets where transitions have concrete conditions associated with them, called WTC-nets. We then demonstrate that we can determine which execution paths of a WTC-net that are possible according to the control-flow dependencies, are actually possible when considering the conditions based on data. Thus, we are able to more accurately determine at design time whether a workflow net with transition conditions is sound.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Clarke, L.A., 1976. A system to generate test data and symbolically execute programs. IEEE Trans. Software Eng., 2(3):215–222. [doi:10.1109/TSE.1976.233817]
Curran, T., Keller, G., 1998. SAP R/3 Business Blueprint: Understanding the Business Process Reference Model. Prentice Hall PTR, Upper Saddle River, NJ, USA.
Cytron, R., Ferrante, J., Rosen, B.K., Wegman, M.N., Zadeck, F.K., 1991. Efficiently computing static single assignment form and the control dependence graph. ACM Trans. Program. Lang. Syst., 13(4):451–490. [doi:10.1145/115372.115320]
Dehnert, J., van der Aalst, W.M.P., 2004. Bridging the gap between business models and workflow specifications. Int. J. Cooper. Inf. Syst., 13(3):289–332. [doi:10.1142/S0218843004000973]
Dutertre, B., de Moura, L.M., 2006a. A Fast Linear-Arithmetic Solver for DPLL(T). 18th Int. Conf. on Computer Aided Verification, p.81–94. [doi:10.1007/11817963_11]
Dutertre, B., de Moura, L., 2006b. The Yices SMT Solver. Available from http://yices.csl.sri.com/tool-paper.pdf
Fan, S., Dou, W., Chen, J., 2007. Dual Workflow Nets: Mixed Control/Data-Flow Representation for Workflow Modeling and Verification. Advances in Web and Network Technologies and Information Management, p.433–444. [doi:10.1007/978-3-540-72909-9_46]
Franco, J.V., 2005. Typical case complexity of satisfiability algorithms and the threshold phenomenon. Discr. Appl. Math., 153(1–3):89–123. [doi:10.1016/j.dam.2005.05.008]
Ganzinger, H., Hagen, G., Nieuwenhuis, R., Oliveras, A., Tinelli, C., 2004. DPLL(T): Fast Decision Procedures. 16th Int. Conf. on Computer Aided Verification, p.175–188. [doi:10.1007/978-3-540-27813-9_14]
Graf, S., Saïdi, H., 1997. Construction of Abstract State Graphs with PVS. 9th Int. Conf. on Computer Aided Verification, p.72–83. [doi:10.1007/3-540-63166-6_10]
Heinze, T.S., Amme, W., Moser, S., 2009. A Restructuring Method for WS-BPEL Business Processes Based on Extended Workflow Graphs. 7th Int. Conf. on Business Process Management, p.211–228.
Heinze, T.S., Amme, W., Moser, S., 2011. Process Restructuring in the Presence of Message-Dependent Variables. Service-Oriented Computing — ICSOC 2010 Int. Workshops, PAASC, WESOA, SEE, and SOC-LOG, p.121–132.
Karp, R.M., Miller, R.E., 1969. Parallel program schemata. J. Comput. Syst. Sci., 3(2):147–195. [doi:10.1016/S0022-0000(69)80011-5]
Khurshid, S., Pasareanu, C.S., Visser, W., 2003. Generalized Symbolic Execution for Model Checking and Testing. 9th Int. Conf. on Tools and Algorithms for the Construction and Analysis of Systems, p.553–568. [doi:10.1007/3-540-36577-X_40]
King, J.C., 1976. Symbolic execution and program testing. Commun. ACM, 19(7):385–394. [doi:10.1145/360248.360252]
Knuplesch, D., Ly, L.T., Rinderle-Ma, S., Pfeifer, H., Dadam, P., 2010. On Enabling Data-Aware Compliance Checking of Business Process Models. 29th Int. Conf. on Conceptual Modeling, p.332–346.
Kumar, V., 1992. Algorithms for constraint-satisfaction problems: a survey. AI Mag., 13(1):32–44.
Lee, J., Midkiff, S.P., Padua, D.A., 1998. Concurrent Static Single Assignment Form and Constant Propagation for Explicitly Parallel Programs. 10th Int. Workshop on Languages and Compilers for Parallel Computing, p.114–130. [doi:10.1007/BFb0032687]
Martens, A., 2003. On compatibility of Web services. Petri Net Newslett., 65:12–20.
Martens, A., 2005. Analyzing Web Service Based Business Processes. 8th Int. Conf. on Fundamental Approaches to Software Engineering, p.19–33. [doi:10.1007/978-3-540-31984-9_3]
Meda, H.S., Sen, A.K., Bagchi, A., 2007. Detecting Data Flow Errors in Workflows: a Systematic Graph Traversal Approach. Proc. 17th Workshop on Information Technologies and Systems, p.133–138.
Meda, H.S., Sen, A.K., Bagchi, A., 2010. On detecting data flow errors in workflows. J. Data Inf. Qual., 2(1):1–31. [doi:10.1145/1805286.1805290]
Meyer, B., 1990. Introduction to the Theory of Programming Languages. Prentice-Hall, Upper Saddle River, NJ, USA.
Moser, S., Martens, A., Görlach, K., Amme, W., Godlinski, A., 2007. Advanced Verification of Distributed WSBPEL Business Processes Incorporating CSSA-Based Data Flow Analysis. IEEE Int. Conf. on Services Computing, p.98–105. [doi:10.1109/SCC.2007.22]
Murata, T., 1989. Petri nets: properties, analysis and applications. Proc. IEEE, 77(4):541–580. [doi:10.1109/5.24143]
Puhlmann, F., Weske, M., 2006. Interaction Soundness for Service Orchestrations. 4th Int. Conf. on Service-Oriented Computing, p.302–313.
Rushby, J., 2006. Threatened by a Great Opportunity: Disruptive Innovation in Formal Verification. Federated Logic Conf.
Schmidt, K., 2003. Using Petri Net Invariants in State Space Construction. 9th Int. Conf. on Tools and Algorithms for the Construction and Analysis of Systems, p.473–488. [doi:10.1007/3-540-36577-X_35]
Sidorova, N., Stahl, C., Trčka, N., 2010. Workflow Soundness Revisited: Checking Correctness in the Presence of Data while Staying Conceptual. 22nd Int. Conf. on Advanced Information Systems Engineering, p.530–544.
Sidorova, N., Stahl, C., Trčka, N., 2011. Soundness verification for conceptual workflow nets with data: early detection of errors with the most precision possible. Inf. Syst., 36(7):1026–1043. [doi:10.1016/j.is.2011.04.004]
Sun, S.X., Zhao, J.L., Nunamaker, J.F., 2006. Formulating the data-flow perspective for business process management. Inf. Syst. Res., 17(4):374–391. [doi:10.1287/isre.1060.0105]
Trčka, N., 2009. Workflow Soundness and Data Abstraction: Some Negative Results and Some Open Issues. Int. Workshop on Abstractions for Petri Nets and Other Models of Concurrency, p.19–25.
Trčka, N., van der Aalst, W.M.P., Sidorova, N., 2009. Data-Flow Anti-patterns: Discovering Data-Flow Errors in Workflows. 21st Int. Conf. on Advanced Information Systems Engineering, p.425–439.
Tsang, E.P.K., 1993. Foundations of Constraint Satisfaction. Academic Press, London, UK.
van der Aalst, W.M.P., 1997. Verification of Workflow Nets. 18th Int. Conf. on Application and Theory of Petri Nets, p.407–426.
van der Aalst, W.M.P., 1998a. The application of Petri nets to workflow management. J. Circ. Syst. Comput., 8(1):21–66. [doi:10.1142/S0218126698000043]
van der Aalst, W.M.P., 1998b. Information and Process Integration in Enterprises: Rethinking Documents. Kluwer Academic Publishers, Norwell, p.161–182. [doi:10.1007/978-1-4615-5499-8_10]
van der Aalst, W.M.P., van Dongen, B.F., Günther, C.W., Rozinat, A., Verbeek, H.M.W., Weijters, A.J.M.M., 2009. ProM: the Process Mining Toolkit. Proc. Business Process Management Demonstration Track, p.9–12.
van der Aalst, W.M.P., van Hee, K.M., 2002. Workflow Management: Models, Methods, and Systems. MIT Press, London, UK.
van Hee, K.M., Sidorova, N., Voorhoeve, M., 2003. Soundness and Separability of Workflow Nets in the Stepwise Refinement Approach. 24th Int. Conf. on Applications and Theory of Petri Nets, p.337–356.
van Hee, K.M., Sidorova, N., Voorhoeve, M., 2004. Generalised Soundness of Workflow Nets is Decidable. 2nd Int. Conf. on Business Process Management, p.197–215.
Verbeek, H.M.W., 2004. Verification of WF-Nets. PhD Thesis, Eindhoven University of Technology, Eindhoven, the Netherlands.
Verbeek, H.M.W., Basten, T., van der Aalst, W.M.P., 2001. Diagnosing workflow processes using Woflan. Comput. J., 44(4):246–279. [doi:10.1093/comjnl/44.4.246]
Wang, Z., Wang, J., Wen, L., Liu, Y., 2009. Deriving Canonical Business Object Operation Nets from Process Models. Proc. 11th Int. Conf. on Enterprise Information Systems, p.182–187.
Wynn, M.T., van der Aalst, W.M.P., ter Hofstede, A.H.M., Edmond, D., 2006. Verifying Workflows with Cancellation Regions and OR-Joins: an Approach Based on Reset Nets and Reachability Analysis. 4th Int. Conf. on Business Process Management, p.389–394.
Zha, H., van der Aalst, W.M.P., Wang, J., Wen, L., Sun, J., 2011. Verifying workflow processes: a transformationbased approach. Software Syst. Model., 10(2):253–264. [doi:10.1007/s10270-010-0149-9]
Author information
Authors and Affiliations
Corresponding author
Additional information
Project supported by the National Science and Technology Major Project of China (No. 2010ZX01042-002-002-01), the National Basic Research Program (973) of China (No. 2009CB320700), and the National Natural Science Foundation of China (Nos. 61073005 and 61003099)
Rights and permissions
About this article
Cite this article
Wang, Zx., Wang, Jm., Zhu, Xc. et al. Verification of workflow nets with transition conditions. J. Zhejiang Univ. - Sci. C 13, 483–509 (2012). https://doi.org/10.1631/jzus.C1100364
Received:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1631/jzus.C1100364