Formal Verification of Workflow Patterns with SPIN

More documents

Recommendations

Info

6 CONCLUSIONS 226 ConclusionsIn this paper, it is proposed the use of software model-checking technologyfor the verication of the business processes, namely the SPIN model checker.Since the business processes can be decomposed into patterns, it is proposed atranslation of a well known collection of workow patterns into Promela. Thistranslation is applied to two case studies, namely the Loan Request and theTravel Agency examples. It is also illustrated the verication of some propertiesand it has been seen that, in despite of the simplicity of the Loan Requestexample, it has an error which was discovered by the SPIN model checker.Thus, this simple example demonstrate how Promela models can be useful inbusiness process specication and verication.Future work will concern an automatic translator of BPMN models (or modelsdescribed in other process modeling languages) to Promela models. It isalso interesting to further express required properties of the workow patternsin linear temporal logic in order to verify them with SPIN model checker.References[1] Russell, N., ter Hofstede, A., van der Aalst, W., Mulyar, N.: WorkowControl-Flow Patterns: A Revised View. BPM Center Report BPM-06-22(2006)[2] Holzmann, G.: The SPIN MODEL CHECKER. Primer and ReferenceManual. Addison-Wesley. Pearson Education (2003)[3] Manna, Z., Pnueli, A.: The temporal Logic of Reactive and ConcurrentSystems: Specication. Springer (1991)[4] OMG: Business Process Modeling Notation. Specication (2006)[5] Havey, M.: Essential Business Process Modeling. O'Reilly Media, Inc.(2005)[6] Kovács, M., Gönczy, L.: Simulation and Formal Analysis of WorkowModels. In: Proc. of the Fifth International Workshop on Graph Transformationand Visual Modeling Techniques. Electronic Notes in TheoreticalComputer Science, Vienna, Austria, Elsevier (2006) 215224[7] Leymann, F.: Web Services Flow Language. IBM (2001)[8] Nakajima, S.: Verication of Web Service Flows with Model-CheckingTechniques. IEEE Computer Society 00 (2002) 0378[9] Puhlmann, F., Weske, M.: Using the pi-calculus for formalizing workowpatterns. In: Business Process Management. (2005) 153168[10] Song, H., Compton, K.J.: Verifying pi-calculus processes by Promela translation.Technical report, Univ. of Michigan (2003)[11] Milner, R.: Communication and concurrency. Prentice Hall International(UK) Ltd. (1995)
REFERENCES 23[12] Stefansen, C.: SMAWL: A SMAll Workow Language Based on CCS.CAiSE Forum (2005)[13] Wong, P.Y., Gibbons, J.: A process-algebraic approach to workow specicationand renement. In: Proceedings of the 6th International Symposiumon Software Composition (SC2007). (2007)[14] Roscoe, A.: Theory and Practice of Concurrency. Prentice Hall (1997)[15] Currie, A.J.: A Comparison of Three Model Checkers Applied to a DistributedDatabase Problem. In: IWFM. (2000)[16] van der Aalst, W.M.P., ter Hofstede, A.H.M.: Yawl: yet another workowlanguage. Information Systems 30(4) (2005) 245275
Page 3 and 4: 3 WORKFLOW PATTERNS TRANSLATION 3us
Page 5 and 6: 3 WORKFLOW PATTERNS TRANSLATION 5is
Page 7 and 8: 3 WORKFLOW PATTERNS TRANSLATION 7}:
Page 9 and 10: 3 WORKFLOW PATTERNS TRANSLATION 9}:
Page 11 and 12: 3 WORKFLOW PATTERNS TRANSLATION 11d
Page 13 and 14: 4 CASE STUDIES 13inline cancelCase(
Page 15 and 16: 4 CASE STUDIES 15qs1[0]=qs[8]; /* T
Page 17 and 18: 4 CASE STUDIES 17Figure 2: Message
Page 19 and 20: 4 CASE STUDIES 19Book - This Promel
Page 21: 5 RELATED WORK 21Properties Vericat

Formal Verification of Workflow Patterns with SPIN

You also want an ePaper? Increase the reach of your titles

Delete template?

Save as template?