Resource Allocation Systems (RAS) were intensively studied in the last years for Flexible Manufacturing Systems (FMS). The success of this research stems from the identification of subclasses of Petri Nets that correspond to an RAS abstraction of these systems. In this paper we take a parallel road to that travelled through for FMS, but for the case of software applications. These applications present concurrency, and deadlocks can happen due to the allocation of shared resources. We reveal that the existing subclasses of Petri Nets used to study this kind of deadlock problems are insufficient, even for very simple software systems. We propose a new subclass of Petri Nets that generalizes the previously known RAS subclasses and we present a taxonomy of anomalies that can be found in the context of software systems.
展开▼
