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 …

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 …

Event fairness suitable for non-interleaving concurrency is proposed. Fairness is viewed
with respect to concurrency, rather than non-determinism, in the sense that no concurrent …

In this paper we propose a notion of fairness for transition systems and a logic for proving
properties under the fairness assumption corresponding to this notion. We start from an …

A proof method for establishing the fair termination and total correctness of both
nondeterministic and concurrent programs is presented. The method calls for the extension …

This paper embeds durations in an interval temporal logic proposed by Venema. The
resulting logic, DCL, is a conservative extension of the original Duration Calculus with two …

Process fairness properties are semantically characterized in a non-interleaving model for
concurrency, which allows a causality-based representation of finite and infinite concurrent …

Abstract Chandy and Misra's Unity, Back's Action Systems and Lamport's Temporal Logic of
Actions (TLA) are three prime examples of specification formalisms for concurrent systems …

A theory of fairness which supports the specification and development of a wide variety of
“fair” systems is developed. The definition of fairness presented is much more general than …

Bounded fairness is a stronger notion than ordinary eventuality-based fairness, one that
guarantees occurrence of an event within a fixed number of occurrences of another event …