Coloured Petri nets: basic concepts, analysis methods and practical use, volume 3
Coloured Petri nets: basic concepts, analysis methods and practical use, volume 3
Workflow management: models, methods, and systems
Workflow management: models, methods, and systems
Unifying Petri Nets, Advances in Petri Nets
Soundness of resource-constrained workflow nets
ICATPN'05 Proceedings of the 26th international conference on Applications and Theory of Petri Nets
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
Modeling and mining of learnflows
Transactions on Petri Nets and Other Models of Concurrency V
Light Region-based Techniques for Process Discovery
Fundamenta Informaticae - Applications and Theory of Petri Nets and Other Models of Concurrency, 2010
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 |
In the paper we discuss the event-driven reactive programs and systems, which does not deadlock for one instance, but because of shared resources, can deadlock for several instances. We focus on event-driven programs, where instances have a correct finish, and resources can be used by single instances, but can neither be destroyed nor created by instances. Typical examples include workflow processes, where each case creates an instance of the process and instances share resources used to execute single activities. Formally, we model such event-driven programs and systems by workflow nets, enriched by so called static places, introduced in [3] as resource constrained workflow nets (rcwf-nets). We investigate, whether an rcwf-net, which is sound for a single instance is sound for multiple instances (dynamically sound) or whether it contains an instance deadlock for a number of instances. We show that the detection of instance deadlock and the dynamic soundness of rcwf-nets is decidable by transforming the problem to bounded place/transition Petri nets.