Affiliation:
1. Jadavpur University, Kolkata, India
Abstract
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.
Publisher
Association for Computing Machinery (ACM)
Reference10 articles.
1. Modeling of state transition rules and its application
2. Application of TLRO to dining philosophers problem
3. Myths about the mutual exclusion problem
4. Edsger Wybe Dijkstra. 1997. A Discipline of Programming (1st ed.). Prentice Hall PTR Upper Saddle River NJ USA. Edsger Wybe Dijkstra. 1997. A Discipline of Programming (1st ed.). Prentice Hall PTR Upper Saddle River NJ USA.
5. Guarded commands, nondeterminacy and formal derivation of programs
Cited by
1 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献