Relevant bibliographies by topics / Deadlock / Journal articles
To see the other types of publications on this topic, follow the link: Deadlock.

Journal articles on the topic 'Deadlock'

Author: Grafiati
Published: 4 June 2021
Last updated: 25 May 2024

Create a spot-on reference in APA, MLA, Chicago, Harvard, and other styles

Select a source type:

Consult the top 50 journal articles for your research on the topic 'Deadlock.'

Next to every source in the list of references, there is an 'Add to bibliography' button. Press on it, and we will generate automatically the bibliographic reference to the chosen work in the citation style you need: APA, MLA, Harvard, Chicago, Vancouver, etc.

You can also download the full text of the academic publication as pdf and read online its abstract whenever available in the metadata.

Browse journal articles on a wide variety of disciplines and organise your bibliography correctly.

1

FLATEBO, MITCHELL, and AJOY KUMAR DATTA. "DISTRIBUTED DEADLOCK DETECTION ALGORITHMS." Parallel Processing Letters 02, no. 01 (March 1992): 21–30. http://dx.doi.org/10.1142/s0129626492000143.

Full text
Abstract:
A distributed system consists of a set of loosely connected state machines which do not share a global memory. The global state of the system depends on the state of each process in the system. The set of global states can be split up into two categories, legal and illegal. This paper deals with methods of detecting deadlocks in distributed systems. One way that has been used to detect deadlocks is by sending probes around the system. If a process thinks that it may be deadlocked, it initiates a probe. If the probe is received by the initiator, the initiator declares deadlock. This paper uses the idea of states of processes In order to detect the deadlock. The algorithm runs continually and does not have to be initiated. This paper presents deadlock detection algorithms for single and multiple outstanding requests. A method for deadlock resolution is also discussed. The algorithms detect all deadlocks and do not detect false deadlocks.
APA, Harvard, Vancouver, ISO, and other styles
2

Huang, Yi Sheng, and Ter Chan Row. "A Channelized Deadlock Prevention Policy for Flexible Manufacturing Systems Using Petri Net Models." Advanced Materials Research 284-286 (July 2011): 1498–501. http://dx.doi.org/10.4028/www.scientific.net/amr.284-286.1498.

Full text
Abstract:
Deadlock prevention, deadlock detection and deadlock avoidance strategies are used to solve the deadlock problems of flexible manufacturing systems (FMSs). The conventional prevention policies were always attempt to prevent the system entering the deadlocked situation by using a few control places. On can know that one prohibits the deadlocked markings, some dead markings will be sacrificed. Therefore, the reachability states will become less than the initial net. However, our goal is to preserve all the reachability states of the initial net. Under our control policy, the deadlocks or deadlock zone will be channelized to live markings such that all the dead markings in reachability states will be conserved. Finally, an example is performed and can obtain the maximal permissiveness of a Petri net model. The other examples are all getting the same result. To our knowledge, this is the first work that employs the channelized method to prevent the deadlock problem for FMSs.
APA, Harvard, Vancouver, ISO, and other styles
3

Askari, Mohsen, and Rozita Jamili Oskouei. "An Improved Multi-Cycle Deadlock Detection and Resolution Algorithm for Distributed Systems." Computer Engineering and Applications Journal 3, no. 3 (September 30, 2014): 111–20. http://dx.doi.org/10.18495/comengapp.v3i3.89.

Full text
Abstract:
Distributed systems exhibit a high degree of resource and data sharing creating a state in which deadlocks might make their appearance. Since deadlock detection and resolution  is one of the important concerns in distributed systems which lead to minimizing available resources, therefore instigating  the  system  throughput decrease.  Our  proposed algorithm detects and resolves  the  multi-cycle  deadlocks, whether the initiator is involved in the deadlock cycle directly or indirectly. Also the chance  of  phantom  deadlock  detection is minimized. This  algorithm  not  only  can manage the simultaneous execution of it but also detects the multi-cycle deadlocks in  the  distributed  systems. Our  algorithm introduces a modified probe and victim message  structure. Moreover,  no  extra  storage  required  to  store  prob message  in each node which is known as memory overhead in the distributed systems.
APA, Harvard, Vancouver, ISO, and other styles
4

Tunç, Hünkar Can, Umang Mathur, Andreas Pavlogiannis, and Mahesh Viswanathan. "Sound Dynamic Deadlock Prediction in Linear Time." Proceedings of the ACM on Programming Languages 7, PLDI (June 6, 2023): 1733–58. http://dx.doi.org/10.1145/3591291.

Full text
Abstract:
Deadlocks are one of the most notorious concurrency bugs, and significant research has focused on detecting them efficiently. Dynamic predictive analyses work by observing concurrent executions, and reason about alternative interleavings that can witness concurrency bugs. Such techniques offer scalability and sound bug reports, and have emerged as an effective approach for concurrency bug detection, such as data races. Effective dynamic deadlock prediction, however, has proven a challenging task, as no deadlock predictor currently meets the requirements of soundness, high-precision, and efficiency. In this paper, we first formally establish that this tradeoff is unavoidable, by showing that (a) sound and complete deadlock prediction is intractable, in general, and (b) even the seemingly simpler task of determining the presence of potential deadlocks, which often serve as unsound witnesses for actual predictable deadlocks, is intractable. The main contribution of this work is a new class of predictable deadlocks, called sync(hronization)-preserving deadlocks. Informally, these are deadlocks that can be predicted by reordering the observed execution while preserving the relative order of conflicting critical sections. We present two algorithms for sound deadlock prediction based on this notion. Our first algorithm SPDOffline detects all sync-preserving deadlocks, with running time that is linear per abstract deadlock pattern, a novel notion also introduced in this work. Our second algorithm SPDOnline predicts all sync-preserving deadlocks that involve two threads in a strictly online fashion, runs in overall linear time, and is better suited for a runtime monitoring setting. We implemented both our algorithms and evaluated their ability to perform offline and online deadlock-prediction on a large dataset of standard benchmarks. Our results indicate that our new notion of sync-preserving deadlocks is highly effective, as (i) it can characterize the vast majority of deadlocks and (ii) it can be detected using an online, sound, complete and highly efficient algorithm.
APA, Harvard, Vancouver, ISO, and other styles
5

Murdalov, Deni Ruslanovich. "Vertical deadlock in public corporations." Юридические исследования, no. 6 (June 2020): 56–64. http://dx.doi.org/10.25136/2409-7136.2020.6.33454.

Full text
Abstract:
This work explores the problem of directorial board execution of the competency of voiding a contract with the registrar in public commercial corporate legal entities. The author provides a number of arguments that allow designating the aforementioned authority of the public joint-stock company as a deadlock situation. Based on the latter, classification is carried out on the deadlocks by level of their emergence into horizontal and vertical, describing characteristic traits of the vertical deadlock. The subject of this research is comprised on the norms that regulate the competence of the members of the oversight committee of corporations in civil law, pertinent law enforcement practice, as well as theoretical positions of various experts. The scientific novelty of this research consists in the analysis of the relevant practical issues associated with emergence of deadlock situations due to the activity of the directorial board. Detailed study and analysis is conducted on the case law of the courts dealing the problems of horizontal deadlock situations. The results of this work include proposed classification of deadlocks by the level of their emergence into horizontal and vertical; definitions of the horizontal and vertical deadlocks; examination of the mechanisms of resolution of horizontal deadlocks.
APA, Harvard, Vancouver, ISO, and other styles
6

Pan, Yen-Liang. "One Computational Innovation Transition-Based Recovery Policy for Flexible Manufacturing Systems Using Petri nets." Applied Sciences 10, no. 7 (March 29, 2020): 2332. http://dx.doi.org/10.3390/app10072332.

Full text
Abstract:
In the third and fourth industrial revolutions, smart or artificial intelligence flexible manufacturing systems (FMS) seem to be the key machine equipment for capacity of factory production. However, deadlocks could hence appear due to resources competition between robots. Therefore, how to prevent deadlocks of FMS occurring is a very important and hot issue. Based on Petri nets (PN) theory, in existing literature almost all research adopts control places as their deadlock prevention mean. However, under this strategy the real optimal reachable markings are not achieved even if they claimed that their control policy is maximally permissive. Accordingly, in this paper, the author propose one novel transition-based control policy to solve the deadlock problem of FMS. The proposed control policy could also be viewed as deadlock recovery since it can recover all initial deadlock and quasi-deadlock markings. Furthermore, control transitions can be calculated and obtained once the proposed three-dimension matrix, called generating and comparing aiding matrix (GCAM) in this paper, is built. Finally, an iteration method is used until all deadlock markings become live ones. Experimental results reveal that our control policy seems still the best one among all existing methods in the literature regardless of whether these methods belong to places or transitions based.
APA, Harvard, Vancouver, ISO, and other styles
7

MANI, NARIMAN, VAHID GAROUSI, and BEHROUZ H. FAR. "SEARCH-BASED TESTING OF MULTI-AGENT MANUFACTURING SYSTEMS FOR DEADLOCKS BASED ON MODELS." International Journal on Artificial Intelligence Tools 19, no. 04 (August 2010): 417–37. http://dx.doi.org/10.1142/s0218213010000261.

Full text
Abstract:
Multi-Agent Systems (MAS) have been extensively used in the automation of manufacturing systems. However, similar to other distributed systems, autonomous agents' interaction in the Automated Manufacturing Systems (AMS) can potentially lead to runtime behavioral failures including deadlocks. Deadlocks can cause major financial consequences by negatively affecting the production cost and time. Although the deadlock monitoring techniques can prevent the harmful effects of deadlocks at runtime, but the testing techniques are able to detect design faults during the system design and development stages that can potentially lead to deadlock at runtime. In this paper, we propose a search based testing technique for deadlock detection in multi-agent manufacturing system based on the MAS design models. MAS design artifacts, constructed using Multi-agent Software Engineering (MaSE) methodology, are used for extracting test requirements for deadlock detection. As the case study, the proposed technique is applied to a multi-agent manufacturing system for verifying its effectiveness. A MAS simulator has been developed to simulate multi-agent manufacturing system behavior under test and the proposed testing technique has been implemented in a test requirement generator tool which creates test requirements based on the given design models.
APA, Harvard, Vancouver, ISO, and other styles
8

Marsteintredet, Leiv. "Executive-Legislative Deadlocks in the Dominican Republic." Latin American Politics and Society 50, no. 02 (2008): 131–60. http://dx.doi.org/10.1111/j.1548-2456.2008.00015.x.

Full text
Abstract:
Abstract This study analyzes the causes of executive-legislative deadlocks in the Dominican Republic in the period 1978–2005. Deadlocks are considered a pernicious element in (presidential) democracies. The study applies a combination of simple statistical techniques and process tracing to test four institutional hypotheses, which argue that certain institutional and party system constellations increase the probability of deadlocks. The hypotheses point to necessary causes of deadlocks, but their predictions are imprecise. Presidents' persuasive powers and coalition building have helped alleviate the deadlock problem. Analysis of the deadlock periods shows that the additional triggering or sufficient causes for deadlocks are either exogenous to the political institutions or related to the instability of coalitions in the nation's nonideological party system, which consists of three almost equal-sized parties.
APA, Harvard, Vancouver, ISO, and other styles
9

KHONSARI, A., H. SARBAZI-AZAD, and M. OULD-KHAOUA. "A Performance Model of Software-Based Deadlock Recovery Routing Algorithm in Hypercubes." Parallel Processing Letters 15, no. 01n02 (March 2005): 153–68. http://dx.doi.org/10.1142/s012962640500212x.

Full text
Abstract:
Recent studies have revealed that deadlocks are generally infrequent in the network. Thus the hardware resources, e.g. virtual channels, dedicated for deadlock avoidance are not utilised most of the time. This consideration has motivated the development of novel adaptive routing algorithms with deadlock recovery. This paper describes a new analytical model to predict message latency in hypercubes with a true fully adaptive routing algorithm with progressive deadlock recovery. One of the main features of the proposed model is the use of results from queueing systems with impatient customers to capture the effects of the timeout mechanism used in this routing algorithm for deadlock detection. The validity of the model is demonstrated by comparing analytical results with those obtained through simulation experiments.
APA, Harvard, Vancouver, ISO, and other styles
10

., Elavarasi, and G. Raja. "A Necessary and Sufficient Condition for Deadlock-Free Message Routing in Communication Networks." International Journal of Advance Research and Innovation 3, no. 2 (2015): 23–26. http://dx.doi.org/10.51976/ijari.321506.

Full text
Abstract:
Deadlocks are an important issue in the design and analysis of communication networks. Wormhole switching is a popular switching technique in direct networks. It refers to a simple flow control system in computer network that is primarily based on fixed links. It also reduces the latency and storage requirements on each node. Deadlock analysis of routing function is a manual and complex task. In the absence of contention, latencies are proportional to the sum of the packet length and the distances to travel. We propose an algorithm to analyze the deadlock in communication networks. The deadlock-free routing algorithm is the first to automatically check a necessary and sufficient condition for deadlock-free routing. Our algorithm performs Effective analysis in this network.
APA, Harvard, Vancouver, ISO, and other styles
11

Li, Zhi Wu, and Abdulrahman M. Al-Ahmari. "Open Problems in Deadlock Control for Flexible Manufacturing Systems by Using Petri Nets." Applied Mechanics and Materials 88-89 (August 2011): 134–41. http://dx.doi.org/10.4028/www.scientific.net/amm.88-89.134.

Full text
Abstract:
Deadlocks are a rather undesirable situation in a highly automated flexible manufacturing system. Their occurrences often deteriorate the utilization of resources and may lead to catastrophic results in safety-critical systems. This work surveys the open problems in deadlock control for automated manufacturing systems. The focus is deadlock prevention due to its large and continuing stream of efforts. A control strategy is evaluated in terms of computational complexity, behavioral permissiveness, and structural complexity of its deadlock-free supervisor. This study provides readers with a conglomeration of the open problems in this area and facilitates them in finding a suitable topic for their research.
APA, Harvard, Vancouver, ISO, and other styles
12

Taha, Assem Hatem, Muataz Hazza Faizi Al Hazza, and Erry Y. T. Adesta. "Modelling and Analysing Deadlock in Flexible Manufacturing System using Timed Petri Net." International Journal of Engineering Materials and Manufacture 2, no. 1 (March 31, 2017): 11–15. http://dx.doi.org/10.26776/ijemm.02.01.2017.02.

Full text
Abstract:
Flexible manufacturing system (FMS) has several advantages compared to conventional systems such as higher machine utilization, higher efficiency, less inventory, and less production time. On the other hand, FMS is expensive and complicated. One of the main problems that may happen is the deadlock. Deadlock is a case that happens when one operation or more are unable to complete their tasks because of waiting of resources that are used by other processes. This may occur due to inappropriate sharing of the resources or improper resource allocation logic which may lead to deadlock occurrence due to the complexity of assigning shared resources to different tasks in an efficient way. One of the most effective tools to model and detect the deadlocks is the petri net. In this research the Matlab software has been used to detect the deadlock in two parallel lines with one shared machines. The analysis shows that deadlock exists at transition with high utilization and place with high waiting time
APA, Harvard, Vancouver, ISO, and other styles
13

Kezić, Danko, Stjepan Bogdan, and Josip Kasum. "Design of Deadlock Prevention Supervisor in Waterway with Multiple Locks and Canals." Transactions on Maritime Science 1, no. 1 (April 18, 2012): 22–34. http://dx.doi.org/10.7225/toms.v01.n01.004.

Full text
Abstract:
To avoid conflict and deadlock states in waterway with multiple locks and canals, a computer based traffic management system with proper control policy must be applied. The paper proposes a formal method for design of deadlock prevention supervisor by using discrete event theory, multiple reentrant flowlines class of Petri net and P-invariants control places calculation. By using and/or matrix algebra, authors analyze the structural characteristics of Petri net in order to find first and second level deadlocks. First level deadlocks are prevented by maintaining the number of vessels in the critical subsystems below the number of vessels in the critical circuits. A method for second level deadlock prevention, which is based on P-invariants, ensures that the key resources would not be the last available resources in the system. Functionality of the supervisor is verified by a computer simulation using Matlab software with Petri net toolbox and P-timed Petri net model of waterway.
APA, Harvard, Vancouver, ISO, and other styles
14

Donaldson, Jason Roderick, Nadya Malenko, and Giorgia Piacentino. "Deadlock on the Board." Review of Financial Studies 33, no. 10 (February 5, 2020): 4445–88. http://dx.doi.org/10.1093/rfs/hhaa006.

Full text
Abstract:
Abstract We develop a dynamic model of board decision-making akin to dynamic voting models in the political economy literature. We show a board could retain a policy all directors agree is worse than an available alternative. Thus, directors may retain a CEO they agree is bad—deadlocked boards lead to entrenched CEOs. We explore how to compose boards and appoint directors to mitigate deadlock. We find board diversity and long director tenure can exacerbate deadlock. We rationalize why CEOs and incumbent directors have power to appoint new directors: to avoid deadlock. Our model speaks to short-termism, staggered boards, and proxy access.
APA, Harvard, Vancouver, ISO, and other styles
15

Li, Peng, Jonathan C. Beard, and Jeremy D. Buhler. "Deadlock-free buffer configuration for stream computing." International Journal of High Performance Computing Applications 31, no. 5 (December 20, 2016): 441–50. http://dx.doi.org/10.1177/1094342016675679.

Full text
Abstract:
Stream computing is a popular paradigm for parallel and distributed computing, where compute nodes are connected by first-in first-out data channels. Each channel can be considered as a concatenation of several data buffers, including an output buffer for the sender and an input buffer for the receiver. The configuration of buffer sizes impacts the performance as well as the correctness of the application. In this article, we focus on application deadlocks that are caused by incorrect configuration of buffer sizes. We describe three types of deadlock in streaming applications, categorized by how they can be created. To avoid them, we first prove necessary and sufficient conditions for deadlock-free computations; then based on the theorems, we propose both compile-time and runtime solutions for deadlock avoidance.
APA, Harvard, Vancouver, ISO, and other styles
16

Yoshioka, Takashi, and Hiroshi Noborio. "Sensor-Based Traffic Rules for Multiple Automata Based on a Geometric Deadlock-Free Characteristic." Journal of Robotics and Mechatronics 8, no. 1 (February 20, 1996): 40–48. http://dx.doi.org/10.20965/jrm.1996.p0040.

Full text
Abstract:
In this paper, we propose a sensor-based and decentralized navigation algorithm for multiple automata and discuss its deadlock-free characteristic in an uncertain 2-d world without any static obstacles. We consider multiple, but a limited number of, automata. Each automaton has the same circular shape, finds another automaton in a contact manner by a ring of tactile sensors, and then selects one of three simple behaviors, i.e., stop, straight, and circular behaviors. In our algorithm, an automaton basically moves toward the goal direction, and if and only if the direction is interfered by another automaton, it avoids another automaton based on a common set of sensor-based traffic rules. By common sense, each automaton never enters any local and global deadlocks, which excludes and includes the goal, respectively. Because all kinds of deadlocks are generally classified as local and global deadlocks, we can easily see that our proposed algorithm ensures its deadlock-free characteristic.
APA, Harvard, Vancouver, ISO, and other styles
17

Kaid, Husam, Abdulrahman Al-Ahmari, Zhiwu Li, and Reggie Davidrajuh. "Automatic Supervisory Controller for Deadlock Control in Reconfigurable Manufacturing Systems with Dynamic Changes." Applied Sciences 10, no. 15 (July 30, 2020): 5270. http://dx.doi.org/10.3390/app10155270.

Full text
Abstract:
In reconfigurable manufacturing systems (RMSs), the architecture of a system can be modified during its operation. This reconfiguration can be caused by many motivations: processing rework and failures, adding new products, adding new machines, etc. In RMSs, sharing of resources may lead to deadlocks, and some operations can therefore remain incomplete. The objective of this article is to develop a novel two-step solution for quick and accurate reconfiguration of supervisory controllers for deadlock control in RMSs with dynamic changes. In the first step, the net rewriting system (NRS) is used to design a reconfigurable Petri net model under dynamic configurations. The obtained model guarantees boundedness behavioral property but may lose the other properties of a Petri net model (i.e., liveness and reversibility). The second step develops an automatic deadlock prevention policy for the reconfigurable Petri net using the siphon control method based on a place invariant to solve the deadlock problem with dynamic structure changes in RMSs and achieve liveness and reversibility behavioral properties for the system. The proposed approach is tested using examples in the literature and the results highlight the ability of the automatic deadlock prevention policy to adapt to RMSs configuration changes.
APA, Harvard, Vancouver, ISO, and other styles
18

Shrivastava, Anurag, and Sudhir Kumar Sharma. "Efficient bus based router for NOC architecture." World Journal of Engineering 13, no. 4 (August 1, 2016): 370–75. http://dx.doi.org/10.1108/wje-08-2016-049.

Full text
Abstract:
Purpose Increase in the speed of processors has led to crucial role of communication in the performance of systems. As a result, routing is taken into consideration as one of the most important subjects of the network-on-chip (NOC) architecture. Routing algorithms to deadlock avoidance prevent packets route completely based on network traffic condition by means of restricting the route of packets. This action leads to less performance especially in non-uniform traffic patterns. On the other hand, true fully adaptive routing algorithm provides routing of packets completely based on traffic conditions. However, deadlock detection and recovery mechanisms are needed to handle deadlocks. Use of a global bus beside NOC as a parallel supportive environment provides a platform to offer advantages of both features of bus and NOC. Design/methodology/approach In this research, the authors use this bus as an escaping path for deadlock recovery technique. Findings According to simulation results, this bus is a suitable platform for a deadlock recovery technique. Originality/value This bus is useful for broadcast and multicast operations, sending delay sensitive signals, system management and other services.
APA, Harvard, Vancouver, ISO, and other styles
19

Pan, Yen-Liang, Ching-Yun Tseng, and Ter-Chan Row. "Design of improved optimal and suboptimal deadlock prevention for flexible manufacturing systems based on place invariant and reachability graph analysis methods." Journal of Algorithms & Computational Technology 11, no. 3 (May 30, 2017): 261–70. http://dx.doi.org/10.1177/1748301817710922.

Full text
Abstract:
Flexible manufacturing systems exhibit a high degree of resource sharing. Since the parts advancing through the system compete for a finite number of resources, a deadlock may occur. Accordingly, many pioneers make efforts in the issue. However, how to obtain maximally permissive supervisors in deadlock flexible manufacturing system is an extremely difficult and time-consuming problem. In existing literature, place invariant) and graph analysis method are merged called maximal number of forbidding First Bad Marking (FBM) problem to obtained optimal controllers with a small number of control places. However, this prevention just can be used in some special nets. For general cases, deadlocks could still exist. Therefore, this paper tries to propose one improved iterative deadlock prevention policy to solve above disadvantage. Experimental results show that the proposed improved policy can be used in all kinds of nets. In other words, it does improve the drawback of conventional maximal number of forbidding First Bad Marking (FBM) problem technology.
APA, Harvard, Vancouver, ISO, and other styles
20

AlDhubhani, Raed, Fathy Eassa, and Faisal Saeed. "Exascale Message Passing Interface based Program Deadlock Detection." International Journal of Electrical and Computer Engineering (IJECE) 6, no. 2 (April 1, 2016): 887. http://dx.doi.org/10.11591/ijece.v6i2.9575.

Full text
Abstract:
Deadlock detection is one of the main issues of software testing in High Performance Computing (HPC) and also inexascale computing areas in the near future. Developing and testing programs for machines which have millions of cores is not an easy task. HPC program consists of thousands (or millions) of parallel processes which need to communicate with each other in the runtime. Message Passing Interface (MPI) is a standard library which provides this communication capability and it is frequently used in the HPC. Exascale programs are expected to be developed using MPI standard library. For parallel programs, deadlock is one of the expected problems. In this paper, we discuss the deadlock detection for exascale MPI-based programs where the scalability and efficiency are critical issues. The proposed method detects and flags the processes and communication operations which are potential to cause deadlocks in a scalable and efficient manner. MPI benchmark programs were used to test the proposed method.
APA, Harvard, Vancouver, ISO, and other styles
21

AlDhubhani, Raed, Fathy Eassa, and Faisal Saeed. "Exascale Message Passing Interface based Program Deadlock Detection." International Journal of Electrical and Computer Engineering (IJECE) 6, no. 2 (April 1, 2016): 887. http://dx.doi.org/10.11591/ijece.v6i2.pp887-894.

Full text
Abstract:
Deadlock detection is one of the main issues of software testing in High Performance Computing (HPC) and also inexascale computing areas in the near future. Developing and testing programs for machines which have millions of cores is not an easy task. HPC program consists of thousands (or millions) of parallel processes which need to communicate with each other in the runtime. Message Passing Interface (MPI) is a standard library which provides this communication capability and it is frequently used in the HPC. Exascale programs are expected to be developed using MPI standard library. For parallel programs, deadlock is one of the expected problems. In this paper, we discuss the deadlock detection for exascale MPI-based programs where the scalability and efficiency are critical issues. The proposed method detects and flags the processes and communication operations which are potential to cause deadlocks in a scalable and efficient manner. MPI benchmark programs were used to test the proposed method.
APA, Harvard, Vancouver, ISO, and other styles
22

Pan, Yen-Liang, Yi-Sheng Huang, Yi-Shun Weng, Weimin Wu, and MuDer Jeng. "Computationally Improved Optimal Control Methodology for Linear Programming Problems of Flexible Manufacturing Systems." Journal of Applied Mathematics 2013 (2013): 1–11. http://dx.doi.org/10.1155/2013/294835.

Full text
Abstract:
Deadlock prevention policies are used to solve the deadlock problems of FMSs. It is well known that the theory of regions is the efficient method for obtaining optimal (i.e., maximally permissive) controllers. All legal and live maximal behaviors of Petri net models can be preserved by using marking/transition-separation instances (MTSIs) or event-state-separation-problem (ESSP) methods. However, they encountered great difficulties in solving all sets of inequalities that is an extremely time consuming problem. Moreover, the number of linear programming problems (LPPs) of legal markings is also exponential with net size when a plant net grows exponentially. This paper proposes a novel methodology to reduce the number of MTSIs/ESSPs and LPPs. In this paper, we used the well-known reduction approach Murata (1989) to simply the construct of system such that the problem of LPPs can then be reduced. Additionally, critical ones of crucial marking/transition-separation instances (COCMTSI) are developed and used in our deadlock prevention policy that allows designers to employ few MTSIs to deal with deadlocks. Experimental results indicate that the computational cost can be reduced. To our knowledge, this deadlock prevention policy is the most efficient policy to obtain maximal permissive behavior of Petri net models than past approaches.
APA, Harvard, Vancouver, ISO, and other styles
23

Kim, Chang Wan, J. M. A. Tanchoco, and Pyung-Hoi Koo. "Deadlock Prevention in Manufacturing Systems With AGV Systems: Banker’s Algorithm Approach." Journal of Manufacturing Science and Engineering 119, no. 4B (November 1, 1997): 849–54. http://dx.doi.org/10.1115/1.2836834.

Full text
Abstract:
An important issue in the operational control of an automated job shop is the prevention and resolution of shop deadlocks. In this paper, we discuss the problems and solutions of deadlocks in manufacturing systems with automated guided vehicle systems, describe a banker’s algorithm for the control of material flow in job shops, and present the results of simulation experiments to compare the performance of several deadlock handling methods.
APA, Harvard, Vancouver, ISO, and other styles
24

Verma, Renu, Mohammad Ayoub Khan, and Amit Zinzuwadiya. "Power and Latency Optimized Deadlock-Free Routing Algorithm on Irregular 2D Mesh NoC using LBDRe." International Journal of Embedded and Real-Time Communication Systems 4, no. 2 (April 2013): 36–49. http://dx.doi.org/10.4018/jertcs.2013040102.

Full text
Abstract:
Efficient routing is challenging and crucial problem in the irregular mesh NoC topologies because of increasing hardware cost and routing tables. In this paper, the authors propose an efficient deadlock-free routing algorithm for irregular mesh NoCs which reduces the latency and power consumption significantly. The problem with degree priority based routing algorithm is that it cannot remove deadlocks in irregular mesh topologies. Therefore, the authors use the extended Logic Based Distributed Routing (LBDRe) to remove deadlock situations without using any virtual channel in the degree priority based routing algorithm. The proposed LBDRe based technique also removes the dependency on routing tables. The authors further apply odd-Even routing algorithm to LBDRe to ensure that some turns are prohibited to remove deadlocks. Experimental results show that the proposed routing algorithm reduces power consumption by 9–22% and overall average latency by 8–12% with the minimum hardware cost for the irregular mesh NoC topologies.
APA, Harvard, Vancouver, ISO, and other styles
25

Romanov, Aleksandr Y., Nikolay M. Myachin, Evgenii V. Lezhnev, Alexander D. Ivannikov, and Ahmed El-Mesady. "Ring-Split: Deadlock-Free Routing Algorithm for Circulant Networks-on-Chip." Micromachines 14, no. 1 (January 5, 2023): 141. http://dx.doi.org/10.3390/mi14010141.

Full text
Abstract:
This article considers the usage of circulant topologies as a promising deadlock-free topology for networks-on-chip (NoCs). A new high-level model, Newxim, for the exploration of NoCs with any topology is presented. Two methods for solving the problem of cyclic dependencies in circulant topologies, which limit their applications for NoCs due to the increased possibility of deadlocks, are proposed. The first method of dealing with deadlocks is universal and applicable to any topology; it is based on the idea of bypassing blocked sections of the network on an acyclic subnetwork. The second method—Ring-Split—takes into account the features of circulant topologies. The results of high-level modeling and comparison of the peak throughput of NoCs for circulant and mesh topologies using deadlock-free routing algorithms are presented. It was shown that a new approach for routing in circulants (compared to mesh topology) shows up to 59% better network throughput with a uniform distribution of network load.
APA, Harvard, Vancouver, ISO, and other styles
26

HALLERSTEDE, STEFAN, and MICHAEL LEUSCHEL. "Constraint-based deadlock checking of high-level specifications." Theory and Practice of Logic Programming 11, no. 4-5 (July 2011): 767–82. http://dx.doi.org/10.1017/s1471068411000299.

Full text
Abstract:
AbstractEstablishing the absence of deadlocks is important in many applications of formal methods. The use of model checking for finding deadlocks in formal models is often limited. In this paper, we propose a constraint-based approach to finding deadlocks employing the ProB constraint solver. We present the general technique, as well as various improvements that had to be performed on ProB's Prolog kernel, such as reification of membership and arithmetic constraints. This work was guided by an industrial case study, where a team from Bosch was modelling a cruise control system. Within this case study, ProB was able to quickly find counterexamples to very large deadlock-freedom constraints. In the paper, we also present other successful applications of this new technique. Experiments using SAT and SMT solvers on these constraints were thus far unsuccessful.
APA, Harvard, Vancouver, ISO, and other styles
27

Zhao, Yu Ming, Xiang Ju Chai, and Li Zhen Zhao. "An Efficient Deadlock Avoidance Policy for FMS Using ROPN." Advanced Materials Research 998-999 (July 2014): 751–54. http://dx.doi.org/10.4028/www.scientific.net/amr.998-999.751.

Full text
Abstract:
This article shows a composed method for modeling the concurrent execution of working processes in flexible manufacturing systems (FMS) by a special class of Petri nets named Resource Oriented Petri nets (ROPN). Essentially, the type of net comes from the availability of system resources. The analysis of ROPN is used to characterize deadlock situations in terms of full markings for certain structure named PPC. For the sake of preventing the system from deadlocks, a policy is proposed based on a series of restrictions for resource allocation, without considering the presence of unmarked siphons in Process Oriented Petri net (POPN). Finally, a control strategy of deadlock avoidance is designed for ROPN, which is better than other control policy.
APA, Harvard, Vancouver, ISO, and other styles
28

Giebas, Damian, and Rafał Wojszczyk. "Deadlocks Detection in Multithreaded Applications Based on Source Code Analysis." Applied Sciences 10, no. 2 (January 10, 2020): 532. http://dx.doi.org/10.3390/app10020532.

Full text
Abstract:
This paper extends multithreaded application source code model and shows how to using it to detect deadlocks in C language applications. Four known deadlock scenarios from literature can be detected using our model. For every scenario we created theorems and proofs whose fulfillment guarantees the occurrence of deadlocks in multithreaded applications. Paper also contains comparison of multithreaded application source code model and Petri nets and describe advantages and disadvantages both of them.
APA, Harvard, Vancouver, ISO, and other styles
29

Bainbridge, William Sims. "Deadlock." Communications of the ACM 61, no. 8 (July 23, 2018): 96. http://dx.doi.org/10.1145/3232923.

Full text
APA, Harvard, Vancouver, ISO, and other styles
30

DOROSHENKO, A. E. "ON ASYNCHRONOUS AVOIDANCE OF DEADLOCKS IN PARALLEL PROGRAMS." Parallel Processing Letters 02, no. 02n03 (September 1992): 291–97. http://dx.doi.org/10.1142/s012962649200043x.

Full text
Abstract:
A number of approaches to asynchronous communication in parallel programs based on both data dependence analysis and buffering techniques are briefly described. A criterion for automatically resolving some classes of deadlocks by means of asynchronous data exchanges is established and examples showing the comparative power of the approaches for deadlock avoidance are presented.
APA, Harvard, Vancouver, ISO, and other styles
31

Abouel Nasr, Emad, Abdulaziz M. El-Tamimi, Abdulrahman Al-Ahmari, and Husam Kaid. "Comparison and Evaluation of Deadlock Prevention Methods for Different Size Automated Manufacturing Systems." Mathematical Problems in Engineering 2015 (2015): 1–19. http://dx.doi.org/10.1155/2015/537893.

Full text
Abstract:
In automated manufacturing systems (AMSs), deadlocks problems can arise due to limited shared resources. Petri nets are an effective tool to prevent deadlocks in AMSs. In this paper, a simulation based on existing deadlock prevention policies and different Petri net models are considered to explore whether a permissive liveness-enforcing Petri net supervisor can provide better time performance. The work of simulation is implemented as follows. (1) Assign the time to the controlled Petri net models, which leads to timed Petri nets. (2) Build the Petri net model using MATLAB software. (3) Run and simulate the model, and simulation results are analyzed to determine which existing policies are suitable for different systems. Siphons and iterative methods are used for deadlocks prevention. Finally, the computational results show that the selected deadlock policies may not imply high resource utilization and plant productivity, which have been shown theoretically in previous publications. However, for all selected AMSs, the iterative methods always lead to structurally and computationally complex liveness-enforcing net supervisors compared to the siphons methods. Moreover, they can provide better behavioral permissiveness than siphons methods for small systems. For large systems, a strict minimal siphon method leads to better behavioral permissiveness than the other methods.
APA, Harvard, Vancouver, ISO, and other styles
32

Hou, YiFan, Murat Uzam, Mi Zhao, and ZhiWu Li. "On near-optimal deadlock control for a class of generalized Petri nets using reachability graph." Engineering Computations 34, no. 6 (August 7, 2017): 1896–922. http://dx.doi.org/10.1108/ec-03-2016-0091.

Full text
Abstract:
Purpose Deadlock is a rather undesirable phenomenon and must be well solved in flexible manufacturing systems (FMS). This paper aims to propose a general iterative deadlock control method for a class of generalized Petri nets (GPN), namely, G-systems, which can model an FMS with assembly and disassembly operations of multiple resource acquisition. When given an uncontrolled G-system prone to deadlocks, the work focuses on the synthesis of a near-optimal, non-blocking supervisor based on reachability graph (RG) analysis. Design/methodology/approach The concept of a global idle place (GIP) for an original uncontrolled G-system is presented. To simplify the RG computation of an uncontrolled G-system, a GIP is added temporarily to the net model during monitor computation steps. Starting with one token and then by gradually increasing the number of tokens in the GIP at each iteration step, the related net system is obtained. The minimal-covered-set of all bad markings of the related net system suffering from deadlock can be identified and then removed by additional monitors through an established place-invariant control method. Consequently, all related systems are live, and the GIP is finally removed when the non-blockingness of the controlled system is achieved. Meanwhile, the redundancy of monitors is also checked. Findings A typical G-system example is provided to demonstrate the applicability and effectiveness of the proposed method. Experiments show that the proposed method is easy to use and provides very high behavioral permissiveness for G-system. Generally, it can achieve an optimal or a near-optimal solution of the non-blocking supervisor. Originality/value In this work, the concept of GIP for G-systems is presented for synthesis non-blocking supervisors based on RG analysis. By using GIP, an effective deadlock control method is proposed. Generally, the proposed method can achieve an optimal or a near-optimal, non-blocking supervisor for an uncontrolled G-system prone to deadlocks.
APA, Harvard, Vancouver, ISO, and other styles
33

Leung, Joseph Y. T., and Burkhard Monien. "On the Complexity of Deadlock Recovery." Fundamenta Informaticae 9, no. 3 (July 1, 1986): 323–42. http://dx.doi.org/10.3233/fi-1986-9304.

Full text
Abstract:
We consider the computational complexity of finding an optimal deadlock recovery. It is known that for an arbitrary number of resource types the problem is NP-hard even when the total cost of deadlocked jobs and the total number of resource units are “small” relative to the number of deadlocked jobs. It is also known that for one resource type the problem is NP-hard when the total cost of deadlocked jobs and the total number of resource units are “large” relative to the number of deadlocked jobs. In this paper we show that for one resource type the problem is solvable in polynomial time when the total cost of deadlocked jobs or the total number of resource units is “small” relative to the number of deadlocked jobs. For fixed m ⩾ 2 resource types, we show that the problem is solvable in polynomial time when the total number of resource units is “small” relative to the number of deadlocked jobs. On the other hand, when the total number of resource units is “large”, the problem becomes NP-hard even when the total cost of deadlocked jobs is “small” relative to the number of deadlocked jobs. The results in the paper, together with previous known ones, give a complete delineation of the complexity of this problem under various assumptions of the input parameters.
APA, Harvard, Vancouver, ISO, and other styles
34

KHONSARI, A., A. SHAHRABI, and M. OULD-KHAOUA. "A PERFORMANCE MODEL OF DISHA ROUTING IN K-ARY N-CUBE NETWORKS." Parallel Processing Letters 17, no. 02 (June 2007): 213–28. http://dx.doi.org/10.1142/s0129626407002971.

Full text
Abstract:
A number of analytical models for predicting message latency in k-ary n-cubes have recently been reported in the literature. Most of these models, however, have been discussed for adaptive routing algorithms based on deadlock avoidance, e.g. Duato's routing. Several research studies have empirically demonstrated that routing algorithms based on deadlock recovery offer maximal adaptivity that can result in considerable improvement in network performance. Disha is an example of a true fully adaptive routing algorithm that uses minimal hardware to implement a simple and efficient progressive method to recover from potential deadlocks. This paper proposes a new analytical model of Disha in wormhole-routed k-ary n-cubes. Simulation experiments confirm that the proposed model exhibits a good degree of accuracy for various networks sizes and under different traffic conditions.
APA, Harvard, Vancouver, ISO, and other styles
35

Huang, Yi Sheng, and Ter Chan Row. "Petri Net Channelized-Based Deadlock Prevention Policy for Flexible Manufacturing Systems." Advanced Materials Research 317-319 (August 2011): 552–55. http://dx.doi.org/10.4028/www.scientific.net/amr.317-319.552.

Full text
Abstract:
Petri nets are employed to model flexible manufacturing systems (FMSs). However, the system deadlocked are possible happened. The conventional deadlock prevention policies are always to forbid the system entering the deadlock by using the control places. To obtain a live system, some dead markings must be sacrificed in the traditional policies. Therefore, the original reachability states of the original model can not be conserved. However, this paper is able to maintain all the reachability states of the original net and guaranty the control system live. Under our control policy, all number of reachability states of the original net will be preserved. Finally, two examples are performed that can reach the maximal permissiveness for FMSs using Petri net models (PNMs).
APA, Harvard, Vancouver, ISO, and other styles
36

SLIVA, VLADIMIR P., TADAO MURATA, and SOL M. SHATZ. "PROTOCOL SPECIFICATION DESIGN USING AN OBJECT-BASED PETRI NET FORMALISM." International Journal of Software Engineering and Knowledge Engineering 09, no. 01 (February 1999): 97–125. http://dx.doi.org/10.1142/s0218194099000073.

Full text
Abstract:
This paper presents a method for modeling of communication protocols using G-Nets — an object-based Petri net formalism. Our approach focuses on specification of one entity in one node at one time, with the analysis that allows consideration of other layers and nodes in addition to module analysis. We extend G-Nets by the notion of timers, which aids the construction of protocol software models. Our method prevents some types of potential deadlocks and livelocks from being introduced into the produced net models. We present certain net synthesis rules to prevent some potential design errors by including error cases in the model. Thus, our node (site) interplay modeling includes cases in which a message may arrive corrupted or can be lost entirely before it would get to its destination node. Also, since our models have deadlock-preserving skeletons, the verification of global deadlock non-existence can be performed on the less complex skeleton rather than on the full G-Net model. Our analysis method discovers some deadlocks plus other unacceptable markings, which do not allow restoration of the initial state. Finding potential livelocks or overspecification is also a part of the analysis.
APA, Harvard, Vancouver, ISO, and other styles
37

DI IANNI, MIRIAM. "WORMHOLE DEADLOCK PREDICTION." Parallel Processing Letters 10, no. 04 (December 2000): 295–303. http://dx.doi.org/10.1142/s0129626400000287.

Full text
Abstract:
Deadlock prevention is usually realized by forbidding transmissions that could eventually cause a deadlock to occur. However, an optimal routing algorithm with respect to channel utilization forbids transmissions only when they would bring the network into a configuration that will necessarily evolve into a deadlock. Hence, optimal deadlock prevention is closely related to deadlock prediction. In this paper it is shown that wormhole deadlock and livelock prediction is a hard problem for both oblivious and adaptive routing.
APA, Harvard, Vancouver, ISO, and other styles
38

Islam, Mohammad Ariful, Md Serajul Islam, and Shifat Jahan. "Multi-cycle Deadlock Detection Algorithm for Distributed Systems." Asian Journal of Applied Science and Engineering 5, no. 1 (December 22, 2016): 125–32. http://dx.doi.org/10.18034/ajase.v5i1.72.

Full text
Abstract:
Deadlock handling is an important component of transaction management in a database system. Though a lot of works have already done for deadlock detection on distributed system. This paper proposes a multi-cycle deadlock detection and recovery mechanism. Our proposed algorithm has modified the probe based distributed algorithm for deadlock detection such as CMH algorithm. But CMH algorithm had some limitation. It can only detect single cycle. But some situation a node is responsible for multi-cycle deadlock detection. In this situation, it can’t detect Multi-cycle deadlock. Besides it can only detect deadlock when the initiator node involved in the cycle. Another algorithm named MC2DR has worked on CMH algorithm. But their probe message contains four fields for deadlock detection which takes more space, but our algorithm has reduced the MC2DR algorithm probe message field and increased the efficiency of this algorithm. It can detect multi-cycle and also detect which node is responsible for multi-cycle deadlock and kills it.
APA, Harvard, Vancouver, ISO, and other styles
39

Morozov, I. S. "Dayton Deadlock." MGIMO Review of International Relations, no. 1(16) (February 28, 2011): 62–63. http://dx.doi.org/10.24833/2071-8160-2011-1-16-62-63.

Full text
APA, Harvard, Vancouver, ISO, and other styles
40

Pyotr Skorobogaty. "PASHINYAN’S DEADLOCK." Current Digest of the Russian Press, The 70, no. 020 (May 20, 2018): 13–14. http://dx.doi.org/10.21557/dsp.51316628.

Full text
APA, Harvard, Vancouver, ISO, and other styles
41

ROZÈS, ANTOINE. "ANGOLAN DEADLOCK." African Security Review 10, no. 3 (January 2001): 17–31. http://dx.doi.org/10.1080/10246029.2001.9628111.

Full text
APA, Harvard, Vancouver, ISO, and other styles
42

Milo, Ronald D. "Moral Deadlock." Philosophy 61, no. 238 (October 1986): 453–71. http://dx.doi.org/10.1017/s0031819100061234.

Full text
Abstract:
Very often moral disagreements can be resolved by appealing to (nonmoral) factual considerations because in these cases the parties to the dispute agree as to which factual considerations are relevant. They agree, that is, with respect to their basic moral standards. Hence, when their disagreement about the non-moral facts is resolved, so is their moral disagreement. But sometimes moral disagreement persists in spite of agreement on factual considerations. When this happens, and when neither party is guilty of illogical thinking, we have a case of moral deadlock
APA, Harvard, Vancouver, ISO, and other styles
43

MORRISSEY, SUSAN. "DATABASE DEADLOCK." Chemical & Engineering News 83, no. 38 (September 19, 2005): 31. http://dx.doi.org/10.1021/cen-v083n038.p031.

Full text
APA, Harvard, Vancouver, ISO, and other styles
44

Levine, Gertrude Neuman. "Defining deadlock." ACM SIGOPS Operating Systems Review 37, no. 1 (January 2003): 54–64. http://dx.doi.org/10.1145/881775.881781.

Full text
APA, Harvard, Vancouver, ISO, and other styles
45

Zajac, Maciej. "Beyond Deadlock." Journal of Ethics and Emerging Technologies 32, no. 2 (December 13, 2022): 1–14. http://dx.doi.org/10.55613/jeet.v32i2.116.

Full text
Abstract:
Efforts to ban Autonomous Weapon Systems were both unsuccessful and controversial. Simultaneously the need to address the detrimental aspects of AWS development and proliferation continues to grow in scope and urgency. The article presents several regulatory solutions capable of addressing the issue while simultaneously respecting the requirements of military necessity and so attracting a broad consensus. Two much stricter solutions – regional AWS bans and adoption of a no first use policy – are also presented as fallback strategies in case achieving AWS’ compliance with the Laws of Armed Conflict proved elusive. Together, the solutions presented form an outline of a flexible regulatory strategy able to adjust to different technological outcomes and providing a sensible compromise to solve the current deadlock on the AWS issue.
APA, Harvard, Vancouver, ISO, and other styles
46

Randall, David A. "Beyond deadlock." Geophysical Research Letters 40, no. 22 (November 20, 2013): 5970–76. http://dx.doi.org/10.1002/2013gl057998.

Full text
APA, Harvard, Vancouver, ISO, and other styles
47

Shang, Kun, and Kai Zhang. "The Analysis and Avoidance of Concurrent Processes Deadlock." Advanced Materials Research 219-220 (March 2011): 45–48. http://dx.doi.org/10.4028/www.scientific.net/amr.219-220.45.

Full text
Abstract:
Deadlock is a common problem in concurrent processing where two or more processes compete for resources in mutually exclusive way to access critical resources. The in-depth analysis and discussion about deadlock would be conducive to the improvement of reliability of the operating system. In this paper, problems about deadlock is analyzed and overviewed, including concept, cause of the deadlock, and prevention, avoidance , detection, and recovery from deadlock, etc .
APA, Harvard, Vancouver, ISO, and other styles
48

Paul, Gerald, and Malte Helmert. "Optimal Solitaire Game Solutions Using A* Search and Deadlock Analysis." Proceedings of the International Symposium on Combinatorial Search 7, no. 1 (September 1, 2021): 135–36. http://dx.doi.org/10.1609/socs.v7i1.18405.

Full text
Abstract:
We propose an efficient method for determining optimal solutions to such skill-based solitaire card games as Freecell. We use A* search with an admissible heuristic function based on analyzing a directed graph whose cycles represent deadlock situations in the game state. To the best of our knowledge, ours is the first algorithm that efficiently determines optimal solutions for Freecell games. We believe that the underlying ideas should be applicable not only to games but also to other classical planning problems which manifest deadlocks.
APA, Harvard, Vancouver, ISO, and other styles
49

k, k. "A Study on Judicial Intervention in China’s Corporate Impasse: Focusing on the Application of Judicial Dissolution of a Company." Northeast Asian Business and Economics Association 4, no. 2 (November 30, 2023): 17–29. http://dx.doi.org/10.51156/jnabe.2023.4.2.17.

Full text
Abstract:
Purpose - As one of the great inventions of modern society, the company system is an important driving force for social progress. As a malpractice in the operation of the company, the deadlock of the company is harmful to the company itself, its shareholders, creditors and even the public. Design/Methodology/Approach - The judicial dissolution system in Article 183 of China’s current Company Law provides a legal basis for judicial intervention in the deadlock of the company and fills the legislative gap. Yet the corporate stalemate is not simply linked to judicial dissolution (Bao Weimin, 2005). Corporate deadlock is only one of the reasons why shareholders have the right to request judicial dissolution; judicial dissolution should not be the only solution to the deadlock. Findings - Forcing the dissolution of the company to resolve the deadlock is clearly wrong for shareholders who want to resolve the deadlock but do not want to destroy the company.However, China’s current Company Law provides too single judicial remedy, too general regulations and weak operability. Research Implications - This paper discusses the extension and connotation of corporate deadlock and analyses the rationality of judicial intervention (Wang Jianjian, 2013). This paper also analyzes the concept and characteristics of the company deadlock, and provides a standard for the determination of the company deadlock, limits the environment of the company deadlock to limited liability company and further limits the scope of the discussion.
APA, Harvard, Vancouver, ISO, and other styles
50

Zhao, Dan, Shao Gang Liu, and Hai Sheng Shu. "Research on Tool Flow Deadlock Based on Petri Net and Graph Theory." Key Engineering Materials 450 (November 2010): 59–62. http://dx.doi.org/10.4028/www.scientific.net/kem.450.59.

Full text
Abstract:
Part flow and tool flow were the two mainly aspects of the workflow in flexible manufacturing system. During the past decades part flow deadlock was much more considered than that of tool flow. Tool flow deadlock problem in the condition that the production procedure can be interrupted was studied in this paper. The model of machine process based on the Petri net was set up and the definition of tool flow deadlock was proposed. Necessary and sufficient conditions for deadlock and potential deadlock were discussed according to graph theory method. A case was illustrated and showed that this method was to be correct and effective.
APA, Harvard, Vancouver, ISO, and other styles
You might also be interested in the bibliographies on the topic 'Deadlock' for other source types:
Dissertations / Theses Books
We offer discounts on all premium plans for authors whose works are included in thematic literature selections. Contact us to get a unique promo code!

To the bibliography