Soundness of resource-constrained workflow nets

Authors:
Kees van Hee;Alexander Serebrenik;Natalia Sidorova;Marc Voorhoeve
Affiliations:
Department of Mathematics and Computer Science, Eindhoven University of Technology, Eindhoven, The Netherlands;Department of Mathematics and Computer Science, Eindhoven University of Technology, Eindhoven, The Netherlands;Department of Mathematics and Computer Science, Eindhoven University of Technology, Eindhoven, The Netherlands;Department of Mathematics and Computer Science, Eindhoven University of Technology, Eindhoven, The Netherlands
Venue:
ICATPN'05 Proceedings of the 26th international conference on Applications and Theory of Petri Nets
Year:
2005

Citing 9
Cited 17

Introduction to algorithms

Introduction to algorithms
Petri nets and flexible manufacturing

Advances in Petri nets 1989
Workflow management: models, methods, and systems

Workflow management: models, methods, and systems
Selected writings on computing: a personal perspective

Selected writings on computing: a personal perspective
Verification of Workflow Nets

ICATPN '97 Proceedings of the 18th International Conference on Application and Theory of Petri Nets
Workflow Verification: Finding Control-Flow Errors Using Petri-Net-Based Techniques

Business Process Management, Models, Techniques, and Empirical Studies
Exact and Approximate Distances in Graphs - A Survey

ESA '01 Proceedings of the 9th Annual European Symposium on Algorithms
The resource allocation problem in flexible manufacturing systems

ICATPN'03 Proceedings of the 24th international conference on Applications and theory of Petri nets
Soundness and separability of workflow nets in the stepwise refinement approach

ICATPN'03 Proceedings of the 24th international conference on Applications and theory of Petri nets

Scheduling-free resource management

Data & Knowledge Engineering
History-based joins: Semantics, soundness and implementation

Data & Knowledge Engineering
Conflict detection and resolution for workflows constrained by resources and non-determined durations

Journal of Systems and Software
Analyzing Data Dependence Based on Workflow Net

ICCS '07 Proceedings of the 7th international conference on Computational Science, Part III: ICCS 2007
On the Synthesis of Zero-Safe Nets

Concurrency, Graphs and Models
Optimization of workflow resources allocation with cost constraint

CSCWD'06 Proceedings of the 10th international conference on Computer supported cooperative work in design III
An adaptive work distribution mechanism based on reinforcement learning

Expert Systems with Applications: An International Journal
A method of workflow scheduling based on colored Petri nets

Data & Knowledge Engineering
Dynamic soundness in resource-constrained workflow nets

FMOODS'11/FORTE'11 Proceedings of the joint 13th IFIP WG 6.1 and 30th IFIP WG 6.1 international conference on Formal techniques for distributed systems
Workflow model compositions preserving relaxed soundness

BPM'06 Proceedings of the 4th international conference on Business Process Management
An extended meta-model for workflow resource model

KSEM'06 Proceedings of the First international conference on Knowledge Science, Engineering and Management
The price of coordination in resource management

BPM'05 Proceedings of the 3rd international conference on Business Process Management
Instance deadlock: a mystery behind frozen programs

PETRI NETS'10 Proceedings of the 31st international conference on Applications and Theory of Petri Nets
Cost soundness for priced resource-constrained workflow nets

PETRI NETS'12 Proceedings of the 33rd international conference on Application and Theory of Petri Nets
On the coverability and reachability languages of monotonic extensions of Petri nets

Theoretical Computer Science
Analyzing Compatibility of Services via Resource Conformance

Fundamenta Informaticae - Concurrency, Specification and Programming
Safety and Soundness for Priced Resource-Constrained Workflow Nets

Fundamenta Informaticae - Application and Theory of Petri Nets and Concurrency, 2012

Quantified Score

Hi-index	0.00

Visualization

Abstract

We study concurrent processes modelled as workflow Petri nets extended with resource constraints. We define a behavioural correctness criterion called soundness: given a sufficient initial number of resources, all cases in the net are guaranteed to terminate successfully, no matter which schedule is used. We give a necessary and sufficient condition for soundness and an algorithm that checks it.