Standard temporal logic is augmented and a new temporal quantifier viz., never is defined.
This augmented logic is integrated in Dijkstra's weakest precondition calculus. Definitions for …

Dijkstra's weakest precondition calculus is extended to capture temporal ordering in
concurrent systems. This is done by defining temporal ordering predicates that is used to …

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 …

A temporal operator, namely leads-to, has been incorporated into the Dijkstra's weakest
precondition calculus. It is demonstrated that the augmented calculus provides a basis, not …

A mathematical model for the specification and verification of a data link layer protocol is
proposed. The weakest precondition calculus, developed by Dijkstra, originally for …

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 …

Many different fairness notions are available in literature. One should choose the proper
definition that match with the system under consideration. In this paper we consider two …

Weakest precondition calculus is used to specify a system implemented by a cyclic
interconnection of sequential processes. From this specification a predicate is derived that …