The drinking philosophers problem
ACM Transactions on Programming Languages and Systems (TOPLAS) - Lecture notes in computer science Vol. 174
On concurrent programming
An optimal algorithm for mutual exclusion in computer networks
Communications of the ACM
Time, clocks, and the ordering of events in a distributed system
Communications of the ACM
Guarded commands, nondeterminacy and formal derivation of programs
Communications of the ACM
A Discipline of Programming
Modeling fairness and starvation in concurrent systems
ACM SIGSOFT Software Engineering Notes
Modeling of state transition rules and its application
ACM SIGSOFT Software Engineering Notes
Application of TLRO to dining philosophers problem
ACM SIGSOFT Software Engineering Notes
Application of TLRO to refute an incorrect mutual exclusion algorithm
ACM SIGSOFT Software Engineering Notes
| Hi-index | 0.00 |
There are systems where alternative constructs need to be used for its description. In weakest precondition calculus disjunction of the post conditions of constituent guarded commands is used as the post condition of an alternative construct. Such representation is not suitable because it does not express a one to one correspondence between a guard and the relevant component of the characterized post condition. In this paper Temporal Logic Related to Observation (TLRO) is used to solve this problem. Each guarded command is expressed as a TLRO rule by using its strongest post condition and the corresponding precondition. List of these representations for all the constituent guarded commands is the required model. Technique is illustrated by considering a common sense scenario. The scheme is then applied to a generalized resource allocation algorithm which is a weaker version of Drinking Philosophers problem.