Adept_flex—Supporting Dynamic Changes of Workflows Without Losing Control
Journal of Intelligent Information Systems - Special issue on workflow management systems
A meta modelng approach to workflow management systems supporting exception handling
Information Systems - Special issue on meta-modelling and methodology engineering
Exception Handling in Workflow Management Systems
IEEE Transactions on Software Engineering - special section on current trends in exception handling—part II
Exception Handling in Workflow Systems
Applied Intelligence
Automatic Control of Workflow Processes Using ECA Rules
IEEE Transactions on Knowledge and Data Engineering
AGENT WORK: a workflow system supporting rule-based workflow adaptation
Data & Knowledge Engineering
Specification and validation of process constraints for flexible workflows
Information Systems
Case handling: a new paradigm for business process support
Data & Knowledge Engineering
Integration and verification of semantic constraints in adaptive process management systems
Data & Knowledge Engineering
Data & Knowledge Engineering
On managing business processes variants
Data & Knowledge Engineering
Rule-Based Event Processing and Reaction Rules
RuleML '09 Proceedings of the 2009 International Symposium on Rule Interchange and Applications
Process Materialization Using Templates and Rules to Design Flexible Process Models
RuleML '09 Proceedings of the 2009 International Symposium on Rule Interchange and Applications
On enabling integrated process compliance with semantic constraints in process management systems
Information Systems Frontiers
Hi-index | 0.00 |
An Adaptive Process Management System (APMS) allows for flexible, dynamic and even ad hoc adaptation of business processes based on case data, context and events. It is also important that APMS technology ensure error-free process execution and compliance with semantic constraints. However, most process design tools tend to be rigid or they handle only syntactic constraints. This restricts their value in real-world applications considerably. This paper presents a new approach to validate process change operations against semantic constraints using an integer programming formulation. The formulation allows us to describe existential as well as coordination (such as before-after ordering sequence) relationships between tasks in a process in a common way. It can then be solved to not only check full or strong compliance, but also determine the minimum set of additional process changes required to ensure weak compliance. Notions of strong and weak compliance are discussed and illustrated with a detailed example. We argue that this approach is more elegant and superior to a pure logic based approach.