Abstract
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.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
References
E.W. Dijkstra, Cooperating sequential processes, in Programming Languages, ed. by F. Genuys (Academic, London, 1965)
K.S. Cheung, Augmented marked graphs. Informatica 32(1), 85–94 (2008)
K.S. Cheung, Augmented marked graphs and the analysis of shared resource systems, in Petri Net: Theory and Application, ed. by V. Kordic (I-Tech Publishing, Vienna, 2008), pp. 377–400
K.S. Cheung, A synthesis method for designing shared-resource systems. Comput. Inform. 24(6), 629–653 (2005)
K.S. Cheung, A formal method for synthesising components of shared resource systems. Int. J. Comput. Syst. Sci. Eng. 22(6), 349–358 (2007)
Author information
Authors and Affiliations
Rights and permissions
Copyright information
© 2014 Springer International Publishing Switzerland
About this chapter
Cite this chapter
Cheung, K.S. (2014). The Dining Philosophers Problem. In: Augmented Marked Graphs. Springer, Cham. https://doi.org/10.1007/978-3-319-06428-4_6
Download citation
DOI: https://doi.org/10.1007/978-3-319-06428-4_6
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-06427-7
Online ISBN: 978-3-319-06428-4
eBook Packages: Computer ScienceComputer Science (R0)