Efficient Semantics-Based Compliance Checking Using LTL Formulae and Unfolding

Business process models are required to be in line with frequently changing regulations, policies, and environments. In the field of intelligent modeling, organisations concern automated business process compliance checking as the manual verification is a time-consuming and inefficient work. There exist two key issues for business process compliance checking. One is the definition of a business process retrieval language that can be employed to capture the compliance rules, the other concerns efficient evaluation of these rules. Traditional syntax-based retrieval approaches cannot deal with various important requirements of compliance checking in practice. Although a retrieval language that is based on semantics can overcome the drawback of syntax-based ones, it suffers from the well-known state space explosion. In this paper, we define a semantics-based process model query language through simplifying a property specification pattern system without affecting its expressiveness. We use this language to capture semantics-based compliance rules and constraints. We also propose a feasible approach in such a way that the compliance checking will not suffer from the state space explosion as much as possible. A tool is implemented to evaluate the efficiency. An experiment conducted on three model collections illustrates that our technology is very efficient.

[1]  Frank Leymann,et al.  Repository for Business Processes and Arbitrary Associated Metadata , 2006, BPM Demos.

[2]  Sherif Sakr,et al.  A Query Language for Analyzing Business Processes Execution , 2011, BPM.

[3]  Tao Jin,et al.  Querying Business Process Models Based on Semantics , 2011, DASFAA.

[4]  Antti Valmari,et al.  The State Explosion Problem , 1996, Petri Nets.

[5]  Yi Chen,et al.  WISE: A Workflow Information Search Engine , 2009, 2009 IEEE 25th International Conference on Data Engineering.

[6]  Tadao Murata,et al.  Petri nets: Properties, analysis and applications , 1989, Proc. IEEE.

[7]  Joost Engelfriet,et al.  Branching processes of Petri nets , 1991, Acta Informatica.

[8]  Ahmed Awad,et al.  BPMN-Q: A Language to Query Business Processes , 2007, EMISA.

[9]  Marc Ehrig,et al.  Measuring Similarity between Semantic Business Process Models , 2007, APCCM.

[10]  Tao Jin,et al.  Efficient and Accurate Retrieval of Business Process Models through Indexing - (Short Paper) , 2010, OTM Conferences.

[11]  Amit P. Sheth,et al.  Petri-net-based workflow management software , 1996 .

[12]  Remco M. Dijkman,et al.  Semantics and analysis of business process models in BPMN , 2008, Inf. Softw. Technol..

[13]  Wil M. P. van der Aalst,et al.  Process Equivalence: Comparing Two Process Models Based on Observed Behavior , 2006, Business Process Management.

[14]  Jianmin Wang,et al.  Querying Process Models Based on the Temporal Relations between Tasks , 2011, 2011 IEEE 15th International Enterprise Distributed Object Computing Conference Workshops.

[15]  Catriel Beeri,et al.  Querying Business Processes with BP-QL , 2005, VLDB.

[16]  Glynn Winskel,et al.  Petri Nets, Event Structures and Domains , 1979, Semantics of Concurrent Computation.

[17]  Wil M. P. van der Aalst,et al.  The Application of Petri Nets to Workflow Management , 1998, J. Circuits Syst. Comput..

[18]  Kenneth L. McMillan,et al.  A technique of state space search based on unfolding , 1995, Formal Methods Syst. Des..

[19]  Cláudio T. Silva,et al.  Querying and re-using workflows with VsTrails , 2008, SIGMOD Conference.

[20]  Wil M. P. van der Aalst,et al.  Formalization and verification of event-driven process chains , 1999, Inf. Softw. Technol..

[21]  George S. Avrunin,et al.  Property specification patterns for finite-state verification , 1998, FMSP '98.

[22]  Ivan Markovic,et al.  A Framework for Querying in Business Process Modelling , 2008, Multikonferenz Wirtschaftsinformatik.

[23]  Akhil Kumar,et al.  On the Move to Meaningful Internet Systems: OTM 2011 , 2011, Lecture Notes in Computer Science.

[24]  Mathias Weske,et al.  Semantic Querying of Business Process Models , 2008, 2008 12th International IEEE Enterprise Distributed Object Computing Conference.

[25]  Remco M. Dijkman,et al.  Measuring Similarity between Business Process Models , 2008, CAiSE.

[26]  江雄英 SAP R/3-人力资源管理系统的应用 , 2009 .

[27]  Reuven Karni,et al.  ProcessGene Query - a Tool for Querying the Content Layer of Business Process Models , 2006, BPM Demos.

[28]  Donald F. Ferguson,et al.  Enterprise Business Process Management - Architecture, Technology and Standards , 2006, Business Process Management.

[29]  Sherif Sakr,et al.  On efficient processing of BPMN-Q queries , 2012, Comput. Ind..

[30]  Mathias Weske,et al.  Efficient Consistency Measurement Based on Behavioral Profiles of Process Models , 2011, IEEE Transactions on Software Engineering.

[31]  Dirk Fahland,et al.  Instantaneous Soundness Checking of Industrial Business Process Models , 2009, BPM.

[32]  Avigdor Gal,et al.  Searching Business Process Repositories Using Operational Similarity , 2011, OTM Conferences.

[33]  Niels Lohmann,et al.  A Feature-Complete Petri Net Semantics for WS-BPEL 2.0 , 2007, WS-FM.

[34]  Wil M. P. van der Aalst,et al.  Formal semantics and analysis of control flow in WS-BPEL , 2007, Sci. Comput. Program..

[35]  Sherif Sakr,et al.  A framework for querying graph-based business process models , 2010, WWW '10.

[36]  Ivan Markovic,et al.  Querying in Business Process Modeling , 2009, ICSOC Workshops.

[37]  Mathias Weske,et al.  Efficient Compliance Checking Using BPMN-Q and Temporal Logic , 2008, BPM.

[38]  Young U. Ryu,et al.  IPM-EPDL: an XML-based executable process definition language , 2005, Comput. Ind..

[39]  Kazimierz Subieta,et al.  Process Query Language: A Way to Make Workflow Processes More Flexible , 2004, ADBIS.

[40]  Shazia Wasim Sadiq,et al.  Managing Process Variants as an Information Resource , 2006, Business Process Management.

[41]  Walter Vogler,et al.  An Improvement of McMillan's Unfolding Algorithm , 2002, Formal Methods Syst. Des..