Correctness issues in two process mutual exclusion algorithms are investigated. A new
theorem is proposed and proved that describes the key concept involved in such algorithms …

Dijkstra's weakest precondition calculus is used to model the well known Dining
Philosophers problem. Process and state definitions are done in such a manner that only the …

A weakest precondition based modelling and verification technique for a class of concurrent
systems is proposed. A system in this class is defined by a set of non-terminating interactive …

Weakest precondition based method for specification and verification of geographically
distributed system is described. For this purpose spatial predicates have been defined. A …

Spatial ordering of messages can be used fruitfully for the design of distributed systems. For
modeling such systems we require a logical framework that includes both spatial …

Weakest precondition based modeling and verification technique for a class of concurrent
systems is proposed. A system in this class is defined by a set of non terminating interactive …

The focus of the paper is to provide a formal logic, for specifying fault-tolerant systems, using
a state and transition based approach. Another goal is to reason, formally, about the …