Let $M_R$ be a non-zero‎ ‎module and ${mathcal F}‎: ‎sigma[M_R]times sigma[M_R]‎ ‎rightarrow$ Mod-$Bbb{Z}$ a bifunctor‎. ‎The‎ ‎$mathcal{F}$-reversibility of $M$ is defined by ${mathcal‎ ‎F}(X,Y)=0 Rightarrow {mathcal F}(Y,X)=0$ for all non-zero $X,Y$‎ ‎in $sigma[M_R]$‎. ‎Hom (resp‎. ‎Rej)-reversibility of $M$ is‎ ‎characterized in different ways‎. ‎Among other things‎, ‎it is shown‎ ‎th...

BACKGROUND Several studies have examined reversibility of tardive syndromes (TS), primarily in psychotic patients who are maintained on dopamine receptor blocking drugs. The results have varied widely. However, few have assessed remission rates after discontinuing the offending agents. This study evaluated reversibility of TS in patients who permanently withdrew the causative agent(s). We also ...

A method has been developed for transforming a program written in the probabilistic guarded-command language ( pGCL) into an equivalent but reversible program. The method extends previous work on logical reversibility to that language and pertains to “demonic” nondeterminism and probability. Use is made of a formal definition of logical reversibility and the expectation-transformer semantics fo...

Causal reversibility blends and causality for concurrent systems. It indicates that an action can be undone provided all of its consequences have been already, thus making it possible to bring the system back a past consistent state. Time is instead considered in field stochastic processes, mostly efficient analysis purposes. A performance model based on continuous-time Markov chain time revers...

The first and the second author introduced reversible ccs (rccs) in order to model concurrent computations where certain actions are allowed to be reversed. Here we show that the core of the construction can be analysed at an abstract level, yielding a theorem of pure category theory which underlies the previous results. This opens the way to several new examples; in particular we demonstrate a...

Reversibility of the Fleming-Viot process with mutation, selection, and recombination is well understood. In this paper, we study the reversibility of a system of Fleming-Viot processes that live on a countable number of colonies interacting with each other through migrations between the colonies. It is shown that reversibility fails when both migration and mutation are non-trivial.

Concurrent reversibility has been studied in different areas, such as biological or dependable distributed systems. However, only “rigid” reversibility has been considered, allowing to go back to a past state and restart the exact same computation, possibly leading to divergence. In this paper, we present croll-π, a concurrent calculus featuring flexible reversibility, allowing the specificatio...