Abstract
A conceptual workflow model specifies the control flow of a workflow together with abstract data information. This model is later on refined to be executed on an information system. It is desirable that correctness properties of the conceptual workflow would be transferrable to its refinements. In this paper, we present classical workflow nets extended with data operations as a conceptual workflow model. For these nets we develop a novel technique to verify soundness. This technique allows us to conclude whether at least one or any refinement of a conceptual workflow model is sound.
Chapter PDF
Similar content being viewed by others
Keywords
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
References
van der Aalst, W.M.P.: The Application of Petri Nets to Workflow Management. The Journal of Circuits, Systems and ComputersĀ 8(1), 21ā€“66 (1998)
van der Aalst, W.M.P., van Dongen, B.F., GĆ¼nther, C.W., Mans, R.S., Alves de Medeiros, A.K., Rozinat, A., Rubin, V., Song, M., Verbeek, H.M.W., Weijters, A.J.M.M.: ProM 4.0: Comprehensive Support for Real Process Analysis. In: Kleijn, J., Yakovlev, A. (eds.) ICATPN 2007. LNCS, vol.Ā 4546, pp. 484ā€“494. Springer, Heidelberg (2007)
Clarke, E.M., Grumberg, O., Jha, S., Lu, Y., Veith, H.: Counterexample-guided Abstraction Refinement for Symbolic Model Checking. Journ. of the ACMĀ 50(5), 752ā€“794 (2003)
Clarke, E.M., Grumberg, O., Long, D.E.: Model Checking and Abstraction. ACM Transactions on Programming Languages and SystemsĀ 16(5), 1512ā€“1542 (1994); A preliminary version appeared in the Proc. of the POPL 1992
Cousot, P., Cousot, R.: Abstract Interpretation: A Unified Lattice Model for Static Analysis of Programs by Construction or Approximation of Fixpoints. In: Proc. of the 4th ACM SIGACT-SIGPLAN Symp. on Principles of programming languages (POPL 1977), pp. 238ā€“252. ACM Press, New York (1977)
Dams, D.: Abstract Interpretation and Partition Refinement for Model Checking. PhD dissertation, Eindhoven University of Technology (July 1996)
Dams, D., Gerth, R., Grumberg, O.: Abstract Interpretation of Reactive Systems. ACM Transactions on Programming Languages and Systems (TOPLAS)Ā 19(2), 253ā€“291 (1997)
Dehnert, J., Rittgen, P.: Relaxed soundness of business processes. In: Dittrich, K.R., Geppert, A., Norrie, M.C. (eds.) CAiSE 2001. LNCS, vol.Ā 2068, pp. 157ā€“170. Springer, Heidelberg (2001)
Dumas, M., van der Aalst, W.M.P., ter Hofstede, A.H.M.: Process-Aware Information Systems: Bridging People and Software through Process Technology. Wiley & Sons, Chichester (2005)
Graf, S., SaĆÆdi, H.: Construction of Abstract State Graphs with PVS. In: Grumberg, O. (ed.) CAV 1997. LNCS, vol.Ā 1254, pp. 72ā€“83. Springer, Heidelberg (1997)
Heinze, T.S., Amme, W., Moser, S.: Generic CSSA-based pattern over boolean data for an improved WS-BPEL to petri net mappping. In: Mellouk, A., Bi, J., Ortiz, G., Chiu, D.K.W., Popescu, M. (eds.) Third International Conference on Internet and Web Applications and Services, ICIW 2008, Athens, Greece, June 8-13, pp. 590ā€“595. IEEE Computer Society, Los Alamitos (2008)
Heinze, T.S., Amme, W., Moser, S.: A restructuring method for WS-BPEL business processes based on extended workflow graphs. In: Dayal, U., Eder, J., Koehler, J., Reijers, H.A. (eds.) BPM 2009. LNCS, vol.Ā 5701, pp. 211ā€“228. Springer, Heidelberg (2009)
Lakhnech, Y., Bensalem, S., Berezin, S., Owre, S.: Incremental Verification by Abstraction. In: Margaria, T., Yi, W. (eds.) TACAS 2001. LNCS, vol.Ā 2031, pp. 98ā€“112. Springer, Heidelberg (2001)
Larsen, K.G.: Modal specifications. In: Sifakis, J. (ed.) CAV 1989. LNCS, vol.Ā 407, pp. 232ā€“246. Springer, Heidelberg (1990)
Loiseaux, C., Graf, S., Sifakis, J., Bouajjani, A., Bensalem, S.: Property Preserving Abstractions for the Verification of Concurrent Systems. Formal Methods in System DesignĀ 6(1), 11ā€“44 (1995)
Moser, S., Martens, A., Gƶrlach, K., Amme, W., Godlinski, A.: Advanced verification of distributed WS-BPEL business processes incorporating CSSA-based data flow analysis. In: 2007 IEEE International Conference on Services Computing (SCC 2007), Salt Lake City, Utah, USA, July 9-13, pp. 98ā€“105. IEEE Computer Society, Los Alamitos (2007)
Shoham, S., Grumberg, O.: Monotonic abstraction-refinement for ctl. In: Jensen, K., Podelski, A. (eds.) TACAS 2004. LNCS, vol.Ā 2988, pp. 546ā€“560. Springer, Heidelberg (2004)
TrĨka, N.: Workflow Soundness and Data Abstraction: Some negative results and some open issues. In: Workshop on Abstractions for Petri Nets and Other Models of Concurrency (APNOC), pp. 19ā€“25 (2009)
TrĨka, N., van der Aalst, W.M.P., Sidorova, N.: Data-Flow Anti-Patterns: Discovering Data-Flow Errors in Workflows. In: van Eck, P., Gordijn, J., Wieringa, R. (eds.) CAiSE 2009. LNCS, vol.Ā 5565, pp. 425ā€“439. Springer, Heidelberg (2009)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
Ā© 2010 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Sidorova, N., Stahl, C., TrĨka, N. (2010). Workflow Soundness Revisited: Checking Correctness in the Presence of Data While Staying Conceptual. In: Pernici, B. (eds) Advanced Information Systems Engineering. CAiSE 2010. Lecture Notes in Computer Science, vol 6051. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-13094-6_40
Download citation
DOI: https://doi.org/10.1007/978-3-642-13094-6_40
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-13093-9
Online ISBN: 978-3-642-13094-6
eBook Packages: Computer ScienceComputer Science (R0)