ScholarLens Back to search
2015•Applied Mechanics and MaterialsRequires access

A New Deadlock Avoidance Policy Based on Petri Nets in Distributed System

B.W. Liu

Open publisher page 1 citations

Abstract

Distributed system has the characteristic of high concurrency, which often leads to deadlock due to the execution of concurrent process. By applying Petri nets model can effectively solve this problem. In this paper, based on Petri nets model, we propose a new efficient deadlock avoidance policy for distributed system by using the Petri reachability graph. At last we analysis the different performance between this algorithm and the traditional method by using Matlab tool.

About this research paper

What this paper is about

Distributed system has the characteristic of high concurrency, which often leads to deadlock due to the execution of concurrent process. By applying Petri nets model can effectively solve this problem. In this paper, based on Petri nets model, we propose a new efficient deadlock avoidance policy for distributed system by using the Petri reachability graph. At last we analysis the different performance between this algorithm and the traditional method by using Matlab tool.

Why it matters

OpenAlex reports 1 citations for this work. Citation counts describe recorded attention and do not establish research quality.

Key contribution

A contribution statement is not available in the OpenAlex record.

Method / approach

Method details are not available in the OpenAlex metadata.

Main findings

Findings are not separately available in the OpenAlex metadata.

Limitations

Limitations are not available in the OpenAlex metadata.

Applications

Application details are not available in the OpenAlex metadata.

Available abstract

Distributed system has the characteristic of high concurrency, which often leads to deadlock due to the execution of concurrent process. By applying Petri nets model can effectively solve this problem. In this paper, based on Petri nets model, we propose a new efficient deadlock avoidance policy for distributed system by using the Petri reachability graph. At last we analysis the different performance between this algorithm and the traditional method by using Matlab tool.

Key concepts: Petri net, Deadlock prevention algorithms, Deadlock, Computer science, Reachability, Concurrency, Distributed computing, Process architecture

Related papers

Related paper 1Related paper 2Related paper 3
Back to paper searchBrowse research topicsOriginal source
A New Deadlock Avoidance Policy Based on Petri Nets in Distributed System — Research Paper | ScholarLens