Petri nets: an introduction
Workflow management: models, methods, and systems
Workflow management: models, methods, and systems
ICATPN '97 Proceedings of the 18th International Conference on Application and Theory of Petri Nets
On the Expressiveness of Mobile Synchronizing Petri Nets
Electronic Notes in Theoretical Computer Science (ENTCS)
Name Creation vs. Replication in Petri Net Systems
Fundamenta Informaticae - PETRI NETS 2007
Minimal Cost Reachability/Coverability in Priced Timed Petri Nets
FOSSACS '09 Proceedings of the 12th International Conference on Foundations of Software Science and Computational Structures: Held as Part of the Joint European Conferences on Theory and Practice of Software, ETAPS 2009
Soundness of Workflow Nets with Reset Arcs
Transactions on Petri Nets and Other Models of Concurrency III
Soundness of resource-constrained workflow nets
ICATPN'05 Proceedings of the 26th international conference on Applications and Theory of Petri Nets
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
Safety and Soundness for Priced Resource-Constrained Workflow Nets
Fundamenta Informaticae - Application and Theory of Petri Nets and Concurrency, 2012
| Hi-index | 0.00 |
Workflow Petri nets (wf-nets) are an important formalism for the modeling of business processes. For them we are typically interested in the soundness problem, that intuitively consists in deciding whether several concurrent executions can always terminate properly. Resource-Constrained Workflow Nets (rcfw-nets) are wf-nets enriched with static places, that model global resources. In this paper we prove the undecidability of soundness for rcwf-nets when there may be several static places and in which instances are allowed to terminate having created or consumed resources. In order to have a clearer presentation of the proof, we define an asynchronous version of a class of Petri nets with dynamic name creation. Then, we prove that reachability is undecidable for them, and reduce it to dynamic soundness in rcwf-nets. Finally, we prove that if we restrict our class of rcwf-nets, assuming in particular that a single instance is sound when it is given infinitely many global resources, then dynamic soundness is decidable by reducing it to the home space problem in P/T nets for a linear set of markings.