论文信息 - The Dining Philosophers Problem

The Dining Philosophers Problem

This chapter illustrates the theories in Chaps. 3– 5, using the well-known dining philosophers problem. It starts with modelling the dining philosophers problem with augmented marked graphs. The system properties, including liveness, boundedness, reversibility and conservativeness, are then analyzed. We also show the composition of augmented marked graphs for modelling and analyzing the dining philosophers problem. The beauty of property-preserving composition is discussed.

King Sing Cheung

[1] King Sing Cheung. A Synthesis Method for Designing Shared-Resource Systems , 2005, Comput. Artif. Intell..

[2] King Sing Cheung,et al. Augmented Marked Graphs , 2014, Springer International Publishing.

[3] King Sing Cheung,et al. Augmented Marked Graphs and the Analysis of Shared Resource Systems , 2008 .

[4] King Sing Cheung. A formal method for synthesising components of shared resource systems , 2007, Comput. Syst. Sci. Eng..

[5] Edsger W. Dijkstra,et al. Cooperating sequential processes , 2002 .