Application of TLRO to dining philosophers problem

Authors:
Anup Kumar Bandyopadhyay;Nibedita Lenka
Affiliations:
Jadavpur University, Kolkata, India;Jadavpur University, Kolkata, India
Venue:
ACM SIGSOFT Software Engineering Notes
Year:
2010

Citing 6
Cited 1

Communicating sequential processes

Communicating sequential processes
Distributed Algorithms

Distributed Algorithms
Hierarchical Compression for Model-Checking CSP or How to Check 1020 Dining Philosophers for Deadlock

TACAS '95 Proceedings of the First International Workshop on Tools and Algorithms for Construction and Analysis of Systems
Fairness and hyperfairness in multi-party interactions

Distributed Computing
Application of Dijkstra's weakest precondition calculus to Dining Philosophers problem

ACM SIGSOFT Software Engineering Notes
Modeling of state transition rules and its application

ACM SIGSOFT Software Engineering Notes

TLRO based modeling of alternative commands and its application to generalized distributed resource allocation problem

ACM SIGSOFT Software Engineering Notes

Quantified Score

Hi-index	0.00

Visualization

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