Motivated by Murray’s work on the limits of refinement testing for CSP, we propose the use of ProB to check liveness properties under assumptions of strong and weak event fairness, whose refinement-closures cannot generally be expressed as refinement checks for FDR. Such properties are necessary for the analysis of fair exchange protocols in CSP, which assume at least some messages are sent ove...

Objective: Leptin, the product of ob gene, is important in control of appetite in humans. The objective was to determine the pre and post serum leptin levels in patients with ESRD (undergoing hemodialysis), to compare the pre serum leptin levels in patients with ESRD and normal healthy controls and to determine the serum IL-6 levels among patients with ESRD before and after hemodialysis. Method...

Non-repudiation protocols have an important role in many areas where secured transactions with proofs of participation are necessary. Formal methods are clever and without error, therefore using them for verifying such protocols is crucial. In this purpose, we show how to partially represent non-repudiation as a combination of authentications on the Fair Zhou-Gollmann protocol. After discussing...

We prove a robustness of regularity result for the 3D convective Brinkman–Forchheimer equations ∂ t u − μ Δ + ( ⋅ ∇ ) p α β | r 1 = f , range absorption exponent ∈ [ 3 ] (for > there exist global-in-time regular solutions), i.e. we show that strong solutions these remain under small enough changes initial condition and forcing function. provide smallness which is similar to conditions given inc...

Oral rehabilitation of patients with skeletal disorders requires important considerations and precautions. Ankylosing spondylitis (AS) is an inflammatory disease of the axial skeleton which can also affect the peripheral joints including the temporomandibular joint (TMJ). Patients with AS can suffer from skeletal pain during long dental appointments. Local, systemic, and psychological factors i...

In this paper we are interested in computability aspects of subshifts and in particular Turing degrees of 2-dimensional SFTs (i.e. tilings). To be more precise, we prove that given any Π1 class P of {0, 1} there is a SFT X such that P ×Z is recursively homeomorphic to X \U where U is a computable set of points. As a consequence, if P contains a computable member, P and X have the exact same set...