Among the possible approaches for expressing real-time problems with the B method, two are dominant : the use of the usual B mechanisms to define temporal constraints on the one h...
The Dempster-Shafer (DS) theory of probabilistic reasoning is presented in terms of a semantics whereby every meaningful formal assertion is associated with a triple (p, q, r) whe...
A timed extension of π-calculus with a transaction construct – the calculus webπ – is studied. The underlying model of webπ relies on networks of processes; time proceeds as...
This paper proposes a formalism for reasoning about distributed object-oriented computations. The formalism is an extension of Milner’s CCS with the notion of local time. It allo...
In this paper we present a syntactical approach for deriving real-time programs from a formal specification of the requirements of real-time systems. The main idea of our approach ...