Design-time Compliance of Service Compositions in Dynamic Service Environments

被引:17
作者
Groefsema, Heerko [1 ]
van Beest, Nick [2 ]
机构
[1] Univ Groningen, Fac Math & Nat Sci, Johann Bernoulli Inst, NL-9700 AB Groningen, Netherlands
[2] NICTA Queensland, Software Syst Res Grp, Spring Hill, Qld, Australia
来源
2015 IEEE 8TH INTERNATIONAL CONFERENCE ON SERVICE-ORIENTED COMPUTING AND APPLICATIONS (SOCA) | 2015年
关键词
COMPLIANCE-CHECKING; BUSINESS; VERIFICATION; SPECIFICATION;
D O I
10.1109/SOCA.2015.14
中图分类号
TP301 [理论、方法];
学科分类号
081202 ;
摘要
In order to improve the flexibility of information systems, an increasing amount of business processes is being automated by implementing tasks as modular services in service compositions. As organizations are required to adhere to laws and regulations, with this increased flexibility there is a demand for automated compliance checking of business processes. Model checking is a technique which exhaustively and automatically verifies system models against specifications of interest, e.g. a finite state machine against a set of logic formulas. When model checking business processes, existing approaches either cause large amounts of overhead, linearize models to such an extent that activity parallelization is lost, offer only checking of runtime execution traces, or introduce new and unknown logics. In order to fully benefit from existing model checking techniques, we propose a mapping from workflow patterns to a class of labeled transition systems known as Kripke structures. With this mapping, we provide pre-runtime compliance checking using well-known branching time temporal logics. The approach is validated on a complex abstract process which includes a deferred choice, parallel branching, and a loop. The process is modeled using the Business Process Model and Notation (BPMN) standard, converted into a colored Petri net using the workflow patterns, and subsequently translated into a Kripke structure, which is then used for verification.
引用
收藏
页码:108 / 115
页数:8
相关论文
共 39 条
[31]  
Pesic M, 2006, LECT NOTES COMPUT SC, V4103, P169
[32]   Developer-friendly verification of process-based systems [J].
Pulvermueller, Elke ;
Feja, Sven ;
Speck, Andreas .
KNOWLEDGE-BASED SYSTEMS, 2010, 23 (07) :667-676
[33]   Specification and validation of process constraints for flexible workflows [J].
Sadiq, SW ;
Orlowska, ME ;
Sadiq, W .
INFORMATION SYSTEMS, 2005, 30 (05) :349-378
[34]  
van der Aalst WMP, 2006, LECT NOTES COMPUT SC, V4184, P1
[35]  
van der Aalst WMP, 2000, LECT NOTES COMPUT SC, V1806, P161
[36]   Workflow patterns [J].
Van der Aalst, WMP ;
Ter Hofstede, AHM ;
Kiepuszewski, B ;
Barros, AP .
DISTRIBUTED AND PARALLEL DATABASES, 2003, 14 (01) :5-51
[37]   Change patterns and change support features - Enhancing flexibility in process-aware information systems [J].
Weber, Barbara ;
Reichert, Manfred ;
Rinderle-Ma, Stefanie .
DATA & KNOWLEDGE ENGINEERING, 2008, 66 (03) :438-466
[38]  
White S.A., 2004, Business Process Modeling Notation (BPMN) Version 1.0
[39]   Business process verification - finally a reality! [J].
Wynn, M. T. ;
Verbeek, H. M. W. ;
van der Aalst, W. M. P. ;
ter Hofstede, A. H. M. ;
Edmond, D. .
BUSINESS PROCESS MANAGEMENT JOURNAL, 2009, 15 (01) :74-92