Authors:
Jin Gyu Shin
and
Doug Won Choi
Affiliation:
Sungkyunkwan University, Korea, Republic of
Keyword(s):
Exception handling, Process repository management, Systematic context description, Situation variable, Decision variable, Search tree generation.
Related
Ontology
Subjects/Areas/Topics:
Adoption of Standards and Protocols for e-Business Applications
;
Applications
;
Business Analytics
;
Business and Social Applications
;
Case Studies
;
Communication and Software Technologies and Architectures
;
Data Engineering
;
Data Warehouses and Data Mining
;
e-Business
;
e-Business Service Matching
;
Enterprise Information Systems
;
Health Engineering and Technology Applications
;
Knowledge Engineering
;
Methodologies, Processes and Platforms
;
Model-Driven Software Development
;
Neural Rehabilitation
;
Neurotechnology, Electronics and Informatics
;
Ontologies and the Semantic Web
;
Simulation and Modeling
;
Simulation Tools and Platforms
;
Society, e-Business and e-Government
;
Software Engineering
;
Web and Mobile Business Systems and Services
;
Web Information Systems and Technologies
;
Web Interfaces and Applications
;
Web Personalization
;
Workflow Management Systems
Abstract:
BPMS (business process management system) offers the facility to define new processes or update the existing processes. However, exceptional or non-routine tasks require the intervention of domain experts or generation of the situation specific resolution process. This paper assumes that sufficient amount of business process exception handling cases are stored in the process repository. Since the retrieval of the best exception handling process requires good understanding about the exceptional situation, context awareness is an important issue. To facilitate the representation of the exceptional situation and to enable the selection of the best exception handling process, we adopted the 'situation variable' and 'decision variable' construct. A case example for exception handling in the e-commerce delivery process is provided to illustrate how the proposed construct works. We applied the C5.0 algorithm to build the optimum search tree.