Abstract
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.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
