Database transaction models for advanced applications
Database transaction models for advanced applications
An overview of workflow management: from process modeling to workflow automation infrastructure
Distributed and Parallel Databases - Special issue on software support for work flow management
Verification of workflow task structures: A petri-net-based approach
Information Systems
Exception Handling in Workflow Management Systems
IEEE Transactions on Software Engineering - special section on current trends in exception handling—part II
Workflow management: models, methods, and systems
Workflow management: models, methods, and systems
Reset Nets Between Decidability and Undecidability
ICALP '98 Proceedings of the 25th International Colloquium on Automata, Languages and Programming
Improving Flexibility of Workflow Management Systems
Business Process Management, Models, Techniques, and Empirical Studies
A Concept of Hierarchical Petri Nets with Building Blocks
Papers from the 12th International Conference on Applications and Theory of Petri Nets: Advances in Petri Nets 1993
A top-down Petri net-based approach for dynamic workflow modeling
BPM'03 Proceedings of the 2003 international conference on Business process management
Modelling with Hierarchical Object Petri Nets
Fundamenta Informaticae - Concurrency Specification and Programming (CS&P'2002), Part 2
On generating *-sound nets with substitution
Information Systems
| Hi-index | 0.00 |
When we model workflows with Petri nets, we call a workflow net sound, if it neither makes any transition dead nor it produces trash tokens in such a way that for every input token exactly one token appears eventually on the output place. We assume that the initial marking consists always of one token on the input place. However, sometimes it is necessary to take into account arbitrary markings, for instance when we make a recovery from an unexpected situation during the workflow execution. An arbitrary marking is sound if it eventually produces exactly one output token without the possibility to leave any trash tokens. The paper addresses the problem of determining the proper control recovery, when unexpected situation arises, and we must detour from the normal execution. When we create an arbitrary control state during the recovery, it is easy to overlook some consequences and create either trash tokens or a deadlock in the future. The problem of determining if a given marking is sound is addressed in the paper in the context of structured nets. The presented linear solution is a necessary and sufficient condition for soundness of markings in structured nets.