Dynamic change within workflow systems
COCS '95 Proceedings of conference on Organizational computing systems
Inheritance of workflows: an approach to tackling problems related to change
Theoretical Computer Science
Time Constraints in Workflow Systems
CAiSE '99 Proceedings of the 11th International Conference on Advanced Information Systems Engineering
Dynamic Verification of Temporal Constraints on-the-fly for Workflow Systems
APSEC '04 Proceedings of the 11th Asia-Pacific Software Engineering Conference
Analysis of workflow dynamic changes based on Petri net
Information and Software Technology
Dynamic checking of temporal constraints for concurrent workflows
Electronic Commerce Research and Applications
Temporal dependency for dynamic verification of fixed-date constraints in grid workflow systems
APWeb'05 Proceedings of the 7th Asia-Pacific web conference on Web Technologies Research and Development
An Incremental Approach to the Analysis and Transformation of Workflows Using Region Trees
IEEE Transactions on Systems, Man, and Cybernetics, Part C: Applications and Reviews
Temporal knowledge representation and reasoning techniques usingtime Petri nets
IEEE Transactions on Systems, Man, and Cybernetics, Part B: Cybernetics
Dynamic Checking and Solution to Temporal Violations in Concurrent Workflow Processes
IEEE Transactions on Systems, Man, and Cybernetics, Part A: Systems and Humans
| Hi-index | 0.00 |
The current fast-changing business environment requires workflow management systems to provide the ability of incremental analysis when process models are edited or updated. There are few researches on the dynamic verification of temporal constraints in an incremental way. In this paper, we present an approach to incremental analysis of temporal constraints. Firstly, after each operation performed by designers, the old change regions before the operation and the new change regions after the operation are generated by comparing the old and new Time Workflow nets (TWF-nets) of processes. Secondly, the sprouting graph recording time and path information of old TWF-net is maintained efficiently to the new state, instead of re-constructing a new sprouting graph. Finally, temporal violations are checked and the paths with violations are reported to designers. This approach is particularly applicable and efficient in terms of time and space for large-scale and complex processes.