Soundness verification for conceptual workflow nets with data: Early detection of errors with the most precision possible

Information Systems

Volumn 36, Issue 7, 2011, Pages 1026-1043

  Sidorova, Natalia ^a   Stahl, Christian ^a   Trčka, Nikola ^a  

^a EINDHOVEN UNIVERSITY OF TECHNOLOGY   (Netherlands)

Author keywords

Conceptual workflow models; Correctness; May must semantics; Refinement; Soundness; Verification

Indexed keywords

CORRECTNESS; MAY/MUST SEMANTICS; REFINEMENT; SOUNDNESS; WORKFLOW MODELS;

SEMANTICS;

EID: 79958111378     PISSN: 03064379     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.is.2011.04.004     Document Type: Article

References (44)

1. M. Dumas, W.M.P. van der Aalst, and A.H.M. ter Hofstede Process-Aware Information Systems: Bridging People and Software through Process Technology 2005 Wiley
2. W.M.P. van der Aalst, and K.M. van Hee Workflow Management: Models Methods, and Systems 2002 MIT Press Cambridge, MA
3. W.M.P. van der Aalst The application of petri nets to workflow management The J. Circuits, Syst. Comput. 8 1 1998 21 66 (Pubitemid 128540249)
4. N. Trčka, W.M.P. van der Aalst, and N. Sidorova Data-flow anti-patterns discovering data-flow errors in workflows P. van Eck, J. Gordijn, R. Wieringa, International Conference on Advanced Information Systems (CAiSE 2009), Lecture Notes in Computer Science, vol. 5565 2009 Springer-Verlag 425 439
5. N. Trčka, W.M.P. van der Aalst, and N. Sidorova Workflow completion patterns IEEE International Conference on Automation Science and Engineering (CASE 2009) 2009 IEEE Press pp. 712
6. K.G. Larsen, and B. Thomsen A modal process logic Annual Symposium on Logic in Computer Science (LICS 1988) 1988 IEEE Computer Society pp. 203210
7. K.G. Larsen, and L. Xinxin Equation solving using modal transition systems Annual IEEE Symposium on Logic in Computer Science (LICS 1990) 1990 IEEE Computer Society pp. 108117
8. S. Shoham, and O. Grumberg Monotonic abstraction-refinement for CTL K. Jensen, A. Podelski, International Conference on Tools and Algorithms for the Construction and Analysis of Systems (TACAS 2004), Lecture Notes in Computer Science, vol. 2988 2004 Springer-Verlag 546 560
9. N. Sidorova, C. Stahl, and N. Trčka Workflow soundness revisited: checking correctness in the presence of data while staying conceptual B. Pernici, International Conference on Advanced Information Systems Engineering (CAiSE 2010), Lecture Notes in Computer Science, vol. 6051 2010 Springer-Verlag 530 544
10. W.M.P. van der Aalst, K.M. van Hee, A.H.M. ter Hofstede, N. Sidorova, H.M.W. Verbeek, M. Voorhoeve, and M. Wynn Soundness of workflow nets: classification, decidability, and analysis Formal Aspects Comput. 23 3 2011 333 363. doi:10.1007/s00165-010-0161-4
11. K.M. van Hee, N. Sidorova, and M. Voorhoeve Generalized soundness of workflow nets is decidable W.M.P. van der Aalst, E. Best, International Conference on Applications and Theory of Petri Nets and other Models of Concurrency (ICATPN 2004), Lecture Notes in Computer Science, vol. 3099 2004 Springer-Verlag 197 216
12. C. Stahl, and K. Wolf Deciding service composition and substitutability using extended operating guidelines Data Knowl. Eng. 68 9 2009 819 833
13. J. Dehnert, and P. Rittgen Relaxed soundness of business processes K.R. Dittrich, A. Geppert, M.C. Norrie, International Conference on Advanced Information Systems Engineering (CAiSE 2001), Lecture Notes in Computer Science, vol. 2068 2001 Springer-Verlag 157 170 (Pubitemid 33285689)
14. S.W. Sadiq, M.E. Orlowska, W. Sadiq, and C. Foulger Data flow and validation in workflow modelling Australasian Database Conference (ADC 2004), CRPIT, vol. 27 2004 Australian Computer Society pp. 207214
15. S.X. Sun, J.L. Zhao, J.F. Nunamaker, and O.R. Liu Sheng Formulating the data flow perspective for business process management Inform. Syst. Res. 17 4 2006 374 391
16. M.H. Sundari, A.K. Sen, A. Bagchi, Detecting data flow errors in workflows: a systematic graph traversal approach, in: Workshop on Information Technology & Systems (WITS-2007), 2007.
17. R. Eshuis Symbolic model checking of UML activity diagrams ACM Trans. Softw. Eng. Methodol. 15 1 2006 1 38 (Pubitemid 43943431)
18. A. Alves et al., Web Services Business Process Execution Language Version 2.0, OASIS Standard, OASIS 2007, 11 April 2007.
19. R. Mietzner, Z. Ma, and F. Leymann An Algorithm for the Validation of Executable Completions of an Abstract BPEL Process Multikonferenz Wirtschaftsinformatik 2008 2008 GITO-Verlag Berlin pp. 437438
20. D. König, N. Lohmann, S. Moser, C. Stahl, and K. Wolf Extending the compatibility notion for abstract WS-BPEL processes W.-Y. Ma, A. Tomkins, X. Zhang, International World Wide Web Conference (WWW 2008) 2008 ACM 785 794
21. C. Loiseaux, S. Graf, J. Sifakis, A. Bouajjani, and S. Bensalem Property preserving abstractions for the verification of concurrent systems Formal Meth. Syst. Des. 6 1 1995 11 44
22. S. Graf, and H. Saïdi Construction of abstract state graphs with PVS International Conference on Computer Aided Verification (CAV 1997), Lecture Notes in Computer Science, vol. 1254 1997 Springer pp. 7283
23. P. Cousot, and R. Cousot Abstract interpretation: a unified lattice model for static analysis of programs by construction or approximation of fixpoints ACM SIGACT-SIGPLAN Symposium on Principles of Programming Languages (POPL 1977) 1977 ACM Press pp. 238252
24. E.M. Clarke, O. Grumberg, and D.E. Long Model checking and abstraction ACM Trans. Program. Lang. Syst. 16 5 1994 1512 1542
25. D. Dams, Abstract interpretation and partition refinement for model checking, Ph.D. Dissertation, Eindhoven University of Technology, 1996.
26. D. Dams, R. Gerth, and O. Grumberg Abstract interpretation of reactive systems ACM Trans. Program. Lang. Syst. (TOPLAS) 19 2 1997 253 291 (Pubitemid 127447776)
27. E.M. Clarke, O. Grumberg, S. Jha, Y. Lu, and H. Veith Counterexample-guided abstraction refinement for symbolic model checking J. ACM 50 5 2003 752 794
28. Y. Lakhnech, S. Bensalem, S. Berezin, and S. Owre Incremental verification by abstraction T. Margaria, W. Yi, International Conference on Tools and Algorithms for the Construction and Analysis of Systems (TACAS 2001), Lecture Notes in Computer Science, vol. 2031 2001 Springer-Verlag 98 112 (Pubitemid 33254653)
29. G. Bruns, and P. Godefroid Generalized model checking: reasoning about partial state spaces C. Palamidessi, International Conference on Concurrency Theory (CONCUR 2000), Lecture Notes in Computer Science, vol. 1877 2000 Springer-Verlag 168 182
30. M. Huth, R. Jagadeesan, and D.A. Schmidt Modal transition systems: a foundation for three-valued program analysis D. Sands, European Symposium on Programming (ESOP 2001), Lecture Notes in Computer Science, vol. 2028 2001 Springer-Verlag 155 169 (Pubitemid 33256357)
31. M. Chechik, B. Devereux, S.M. Easterbrook, and A. Gurfinkel Multi-valued symbolic model-checking ACM Trans. Softw. Eng. Methodol. 12 4 2003 371 408
32. K.G. Larsen, U. Nyman, and A. Wasowski On modal refinement and consistency L. Caires, V.T. Vasconcelos, International Conference on Concurrency Theory (CONCUR 2007), Lecture Notes in Computer Science, vol. 4703 2007 Springer-Verlag 105 119
33. L. de Alfaro, P. Godefroid, and R. Jagadeesan Three-valued abstractions of games: uncertainty, but with precision IEEE Symposium on Logic in Computer Science (LICS 2004) 2004 IEEE Computer Society pp. 170179
34. S. Shoham, and O. Grumberg 3-valued abstraction: more precision at less cost Inf. Comput. 206 11 2008 1313 1333
35. G. Bruns, and P. Godefroid Model checking partial state spaces with 3-valued temporal logics N. Halbwachs, D. Peled, International Conference on Computer Aided Verification (CAV 1999), Lecture Notes in Computer Science, vol. 1633 1999 Springer-Verlag 274 287
36. P. Godefroid, and R. Jagadeesan Automatic abstraction using generalized model checking E. Brinksma, K.G. Larsen, International Conference on Computer Aided Verification (CAV 2002), Lecture Notes in Computer Science, vol. 2404 2002 Springer-Verlag 137 150
37. S. Shoham, O. Grumberg, A game-based framework for CTL counterexamples and 3-valued abstraction-refinement, ACM Trans. Comput. Log. 9 (1) (2007).
38. O. Grumberg, M. Lange, M. Leucker, and S. Shoham When not losing is better than winning: abstraction and refinement for the full mu-calculus Inf. Comput. 205 8 2007 1130 1148 (Pubitemid 46977152)
39. L. de Alfaro, and P. Roy Solving games via three-valued abstraction refinement Inf. Comput. 208 6 2010 666 676
40. Z. Manna, and A. Pnueli The Temporal Logic of Reactive and Concurrent Systems: Specification 1992 Springer-Verlag
41. E.M. Clarke, and E.A. Emerson Design and synthesis of synchronization skeletons using branching-time temporal logic Workshop on Logics of Programs 1981, Lecture Notes in Computer Science, vol. 131 1982 Springer pp. 5271
42. D. Kozen Results on the propositional mu-calculus Theor. Comput. Sci. 27 1983 333 354
43. E.M. Clarke, O. Grumberg, and D.A. Peled Model Checking 2000 MIT Cambridge, Massachusetts
44. W.M.P. van der Aalst, B.F. van Dongen, C.W. Günther, R.S. Mans, A.K. Alves de Medeiros, A. Rozinat, V. Rubin, M. Song, H.M.W. Verbeek, and A.J.M.M. Weijters ProM4.0: comprehensive support for real process analysis J. Kleijn, A. Yakovlev, International Conference on Applications and Theory of Petri Nets and other Models of Concurrency (ICATPN 2007), Lecture Notes in Computer Science, vol. 4546 2007 Springer-Verlag 484 494