skip to main content
research-article

Application of TLRO to dining philosophers problem

Published: 27 November 2010 Publication History

Abstract

Recently modeling of a state transition rule has been proposed using a temporal logic based on observation (TLRO). Theadvantage of such representation lies in the fact that the model is derived from the related cause and effect relation and is expressed as an implication. This structure makes manipulationeasy. Unlike weakest precondition calculus that can only reason backward in time, present model can include both backward and forward temporal reasoning. This is therefore more expressive. In this paper TLRO based modeling is used to derive three different deadlock free solutions for Dining Philosophers problem. All this solutions are proved using this model

References

[1]
Dijkstra. E.W. 1971. Hierarchical ordering of sequential processes. Acta Informatica vol. 1, No.2 1971, pp 115--138. DOI=10.1007/BF00289519
[2]
Roscoe, A. W., Gardiner, P. H., Goldsmith, M. H., Hulance, J. R., Jackson, D. M., and Scattergood, J. B. 1995. Hierarchical Compression for Model-Checking CSP or How toCheck 1020 Dining Philosophers for Deadlock. In Proceedingsof the First international Workshop on Tools and AlgorithmsFor Construction and Analysis of Systems (May 19 - 20, 1995). E. Brinksma, R. Cleaveland, K. G. Larsen, T. Margaria, and B. Steffen, Eds. Lecture Notes In Computer Science, vol. 1019. Springer-Verlag, London, 133--152.
[3]
Banerjee, J., Bandyopadhyay, A. K., and Mandal, A. K. 2007. Application of Dijkstra's weakest precondition calculus to Dining Philosophers problem. SIGSOFT Softw. Eng. Notes 32, 4 (Jul. 2007), 1--7. DOI= http://doi.acm.org/10.1145/1281421.1281424
[4]
Bandyopadhyay, A. K. 2010. Modeling of state transition rules and its application. SIGSOFT Softw. Eng. Notes 35, 2 (Mar. 2010), 1--7. DOI= http://doi.acm.org/10.1145/1734103.1734109
[5]
Roscoe, A. W. and Dathi, N. 1986. The pursuit of deadlock freedom. Oxford University Computing Laboratory Technical Monograph, PRG - 57, 1986.
[6]
Hoare, C. A. R. 1985. Communicating Sequential Processes. Prentice Hall International, pp 57--61.
[7]
Lynch, N. A. 1996 Distributed Algorithms. Morgan Kaufmann Publishers Inc.
[8]
Attie, P. C, Francez, N. and Grumberg, O. 1993. Fairness and hyperfairness in multi-party interactions. Distributed Computing vol.6 no.4 (July, 1993), 245--254. DOI. 10.1007/BF02242712

Cited By

View all
  • (2011)TLRO based modeling of alternative commands and its application to generalized distributed resource allocation problemACM SIGSOFT Software Engineering Notes10.1145/2047414.204742136:6(1-5)Online publication date: 14-Nov-2011

Recommendations

Comments

Information & Contributors

Information

Published In

cover image ACM SIGSOFT Software Engineering Notes
ACM SIGSOFT Software Engineering Notes  Volume 35, Issue 6
November 2010
132 pages
ISSN:0163-5948
DOI:10.1145/1874391
Issue’s Table of Contents

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 27 November 2010
Published in SIGSOFT Volume 35, Issue 6

Check for updates

Author Tags

  1. TLRO
  2. deadlock
  3. dining philosophers problem
  4. state transition rule
  5. temporal logic

Qualifiers

  • Research-article

Contributors

Other Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

  • Downloads (Last 12 months)3
  • Downloads (Last 6 weeks)0
Reflects downloads up to 15 Feb 2025

Other Metrics

Citations

Cited By

View all
  • (2011)TLRO based modeling of alternative commands and its application to generalized distributed resource allocation problemACM SIGSOFT Software Engineering Notes10.1145/2047414.204742136:6(1-5)Online publication date: 14-Nov-2011

View Options

Login options

View options

PDF

View or Download as a PDF file.

PDF

eReader

View online with eReader.

eReader

Figures

Tables

Media

Share

Share

Share this Publication link

Share on social media