On Reversibility and Broadcast

The Reversible Temporal Process Language

“…Further investigation on the relation between our work and [2], studying reversibility in Markov chains, is left for future work. The treatment of passage of time shares some similarities with broadcast [24]: time actions affect parallel components in the same way, and idempatience can be seen as unavailability of top-level receivers.…”

From Reversible Semantics to Reversible Debugging

“…Notably, other definitions of reversibility for concurrent systems exist [37], but they do not have (nor want to have) this property. This property has been proved in a number of formalisms [14,36,28,19,35] (mostly in a more general form called the Parabolic Lemma or the Rearranging Lemma). Below, however, we show it to be a very general, language-independent result, depending only on the definition of causal-consistent reversibility and on the Loop Lemma.…”

“…By doing this, one obtains the uncontrolled causal-consistent semantics of the language, specifying how actions can be done and undone according to causal-consistent reversibility. This approach has been applied to many process calculi and programming languages, including CCS [14] and a family of similar calculi [36], CCS with broadcast synchronization [35], π-calculus [12], higher-order π [28], Klaim [19], µOz [33] and Core Erlang [31]. We remark however that the results above does not tell how to efficiently track and store history information, and how to efficiently exploit it for undoing actions.…”

Foundations of Reversible Computation

“…The first approach extended causal-consistent reversibility from CCS to any calculus defined using a specific SOS format (a subset of the path format [146]) [160,161], and to π-calculus [42]. In the second line of research we find extensions of a fragment of CCS with biological relevance [35,36], of the higher-order π-calculus [117,119], of the coordination language Klaim [56], of a π-calculus with sessions [179], and of a CCS with broadcast communications [133]. The instance of the framework in [160] on CCS is called CCSK.…”