2004•Unpublished venueRequires access

The study of Petri nets models to describe and approach the dining philosophers problem

Xiangkui Jiang

Abstract

The dining philosophers problem is a classic example of describing Concurrency operation in operating system. The paper studies it in petri nets and builds different petri nets models to solve the deadlock problem and the infinite waiting problem respectively, and finally discusses the models of petri nets in the situation of different dining times when philosophers are dining in turn.

About this research paper

What this paper is about

Why it matters

A significance statement is not available in the OpenAlex record.

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

Key concepts: Petri net, Concurrency, Deadlock, Process architecture, Computer science, Petri dish, Theoretical computer science, Programming language