Artificial Intelligence - Special issue on knowledge representation
Verification of workflow task structures: A petri-net-based approach
Information Systems
Analyzing process models using graph reduction techniques
Information Systems - The 11th international conference on advanced information systems engineering (CAiSE*
Constraint-directed techniques for scheduling alternative activities
Artificial Intelligence
Constraint Processing
Applying Propositional Logic to Workflow Verification
Information Technology and Management
Automatic Control of Workflow Processes Using ECA Rules
IEEE Transactions on Knowledge and Data Engineering
YAWL: yet another workflow language
Information Systems
Nested Precedence Networks with Alternatives: Recognition, Tractability, and Models
AIMSA '08 Proceedings of the 13th international conference on Artificial Intelligence: Methodology, Systems, and Applications
Handling alternative activities in resource-constrained project scheduling problems
IJCAI'07 Proceedings of the 20th international joint conference on Artifical intelligence
Executing reactive, model-based programs through graph-based temporal planning
IJCAI'01 Proceedings of the 17th international joint conference on Artificial intelligence - Volume 1
TAAI '11 Proceedings of the 2011 International Conference on Technologies and Applications of Artificial Intelligence
| Hi-index | 0.00 |
Nested workflows are used to formally describe processes with a hierarchical structure similar to hierarchical task networks in planning. The nested structure guarantees that the workflow is sound in terms of possibility to select for each involved activity a process that contains the activity. However, if extra synchronization, precedence, or causal constraints are added to the nested structure, the problem of selecting a process containing a given activity becomes NP-complete. This paper presents techniques for verifying such workflows; in particular, they verify that a process exists for each activity.