On the bus priority dilemma: A Petri Net model with resource sharing and inhibitor arc

Author(s):  
Hamza Boukhentiche ◽  
Abdeljalil Abbas-Turki ◽  
Abdellah El Moudni
Complexity ◽  
2018 ◽  
Vol 2018 ◽  
pp. 1-14 ◽  
Author(s):  
Soraia Oueida ◽  
Yehia Kotb ◽  
Seifedine Kadry ◽  
Sorin Ionescu

Healthcare systems are growing very fast, especially emergency departments (EDs) which constitute the major bottleneck of these complex concurrent systems. Emergency departments, where patients arrive without any prior notice, are considered real-time complex dynamic systems. Enhancing these systems requires tailored modeling techniques and a process optimization approach. A new mathematical approach is proposed in order to help multiple emergency units cooperate and share none-consumable resources to achieve the required flow. To achieve the cooperation, the process is modeled by a new subclass of Petri nets. The new Petri net model was proposed in a previous work and is used in this study in order to tackle the problem of modeling and managing these emergency units. The proposed Petri net is named Resource Preservation Net (RPN). Few theorems and lemmas are proposed to support the proposed Petri net model and to prove the correctness of cooperation and resource sharing. In this contribution, a model of cooperative healthcare units is proposed to achieve sound resource sharing and collaboration. The objective function of the proposed model is to improve the key performance indicators: patients length of stay (LoS), resource utilization rates, and patients waiting time. The cooperation among multiple EDs is then proposed through the study of merging two or more units. The cooperative and noncooperative behavior are also studied through theorems of soundness, separability and serializability, and a proof of scalability.


1990 ◽  
Vol 51 (2) ◽  
pp. 213-220 ◽  
Author(s):  
Ajoy K. Datta ◽  
Sukumar Ghosh

2008 ◽  
Vol 17 (03) ◽  
pp. 365-387 ◽  
Author(s):  
LI JIAO ◽  
HEJIAO HUANG ◽  
TO-YAT CHEUNG

Resource sharing is a very complex task in system design because it may induce undesirable properties such as deadlocks and overflows. This paper proposes a method for handling this task. Resource sharing is formulated as a place fusion on a Petri net specification that satisfies a designated set of properties and includes some duplicated places representing accesses to the resources. If this fusion satisfies some conditions, the obtained net will preserve the original properties after the incorporation of resource sharing. This paper considers two classes of property-preserving place fusions. Each class specifies the Petri net type to be used, the structural relationship among the resource places and possibly some additional conditions for the place fusion to preserve a designated set of properties. As an illustration, these place fusion approaches are applied to solve a resource sharing problem in the design of manufacturing systems.


2019 ◽  
Vol 11 (3) ◽  
pp. 168781401983386 ◽  
Author(s):  
Rongming Zhu ◽  
Qing Ban ◽  
Xuya Cong

This article addresses expressiveness problems for Petri nets and their useful extension for modeling and control of a system that can be modeled with Petri nets. We construct some Petri net modules, namely, an enabling module, an inhibitor module and a Modulo-N counter, which are useful for system operations. We also present the simplifications for the enabling and inhibitor modules. Then, we propose two new types of arcs, namely, enabling and inhibitor arcs, with a weighted function set. The arcs with the weighted function set from places to transitions are the marked arcs. A function set is employed to denote the weight of an arc according to the system requirements. They are very useful to solve the resource reallocation problem in a resource allocation system, where resource sharing contributes to the occurrences of deadlocks. Finally, two examples are used to show the advantages of the presented new types of arcs.


Sign in / Sign up

Export Citation Format

Share Document