English (United Kingdom)

https://curated-unify.zendy.io/wp-json/zendy-region/v1/featured_content/oa?rat=en

https://curated-unify.zendy.io/wp-json/zendy-region/v1/highlighted_journal/

Global: Zendy Tools annual

Presents the keyphrase highlighting as premium feature

Keyphrase Highlighting

Presents the summarisation as premium feature

Summarisation

Insights

Presents the pdf analysis as premium feature

PDF Analysis

Presents the zaia usage as premium feature

ZAIA

Global: Zendy Tools monthly

Global: Zendy Plus monthly

Presents the access of premium content as premium feature

Premium Content

Global: Zendy Plus annual

Global: Zendy Free Plan

Reversible computation opens up the possibility of overcoming some of thehardware's current physical limitations. It also offers theoretical insights,as it enriches multiple paradigms and models of computation, and sometimesretrospectively enlightens them. Concurrent reversible computation, forinstance, offered interesting extensions to the Calculus of CommunicatingSystems, but was still lacking a natural and pertinent bisimulation to studyprocesses equivalences. Our paper formulates an equivalence exploiting the twoaspects of reversibility: backward moves and memory mechanisms. Thisbisimulation captures classical equivalences relations for denotational modelsof concurrency (History-and hereditary history-preserving bisimulation,(H)HPB), that were up to now only partially characterized by process algebras.This result gives an insight on the expressiveness of reversibility, as bothbackward moves and a memory mechanism-providing 'backward determinism'-areneeded to capture HHPB.

How Reversibility Can Solve Traditional Questions: The Example of Hereditary History-Preserving Bisimulation