Comments on a problem in concurrent programming control
Communications of the ACM
Application of Dijkstra's weakest precondition calculus to Dining Philosophers problem
ACM SIGSOFT Software Engineering Notes
On the correctness issues in two-process mutual exclusion algorithms
ACM SIGSOFT Software Engineering Notes
Modeling of state transition rules and its application
ACM SIGSOFT Software Engineering Notes
Weakest precondition based modelling and verification of a class of concurrent systems
International Journal of Artificial Intelligence and Soft Computing
ACM SIGSOFT Software Engineering Notes
| Hi-index | 0.00 |
Modeling of iterative commands in a concurrent process is difficult because the termination depends on the states of different processes. In this paper a Temporal Logic Related to Observation (TLRO)-based modeling of the same is considered. For simplicity we restrict ourselves to 'while do' construct only. Using a commonsense scenario it is shown that the construct may be described by a set of three state transition rules. In a concurrent system the termination condition is determined by the states of different processes. To ensure termination, therefore, temporal ordering of the executions of different state transition rules at different processes needs to be investigated. For this purpose we prove two theorems. The entire derivation is then used to refute a well known incorrect mutual exclusion algorithm. A counter example for the algorithm could be derived during this exercise. This is an improvement over our earlier effort that used the weakest precondition calculus as a modeling tool.