Managing business processes as an information resource
IBM Systems Journal
Analyzing process models using graph reduction techniques
Information Systems - The 11th international conference on advanced information systems engineering (CAiSE*
Specifying and Enforcing Intertask Dependencies
VLDB '93 Proceedings of the 19th International Conference on Very Large Data Bases
An Alternative Way to Analyze Workflow Graphs
CAiSE '02 Proceedings of the 14th International Conference on Advanced Information Systems Engineering
Conceptual Modelling of WorkFlows
OOER '95 Proceedings of the 14th International Conference on Object-Oriented and Entity-Relationship Modelling
Pockets of Flexibility in Workflow Specification
ER '01 Proceedings of the 20th International Conference on Conceptual Modeling: Conceptual Modeling
Analysis of organizational dependency for urbanism of information systems
International Journal of Computer Integrated Manufacturing
Realizing business processes with ECA rules: benefits, challenges, limits
PPSWR'06 Proceedings of the 4th international conference on Principles and Practice of Semantic Web Reasoning
| Hi-index | 0.00 |
Workflow technology has met with success in a variety of industries, although several limitations have emerged. One such drawback is the inflexibility of specification languages, including a lack of support for inter-task dependencies. Expressiveness of the specification language is believed to be a determining factor of workflows applicability and its industrial value as solution for process support.This paper attempts to address this limited language expressiveness by suggesting an alternative approach to modelling that more accurately captures behavioural information about tasks and enables greater precision when modelling inter-task dependencies.Current workflow technology associates one generic, predefined finite state machine with each activity in a process, and inter-task dependencies of the type 'completion of one activity triggers scheduling of the next activity' are also enforced.The potential improvement relaxes these constraints to enable the specification of user-defined finite state machines to represent each activity and support the modelling of inter-task constraints at the activity state level. In this paper, we present an introduction to this modelling extension and demonstrate the applicability of existing workflow verification algorithms to these more descriptive process models.