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 Plus annual

Presents the access of premium content as premium feature

Premium Content

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 Plus monthly

Global: Zendy Tools annual

Global: Zendy Tools monthly

Global: Zendy Free Plan

Reversible computation is an emerging computing paradigm that allows anysequence of operations to be executed in reverse order at any point duringcomputation. Its appeal lies in its potential for lowpower computation and itsrelevance to a wide array of applications such as chemical reactions, quantumcomputation, robotics, and distributed systems. Reversing Petri nets are arecently-proposed extension of Petri nets that implements the three main formsof reversibility, namely, backtracking, causal reversing, andout-of-causal-order reversing. Their distinguishing feature is the use of namedtokens that can be combined together to form bonds. Named tokens along with ahistory function, constitute the means of remembering past behaviour, thus,enabling reversal. In recent work, we have proposed a structural translationfrom a subclass of RPNs to the model of Coloured Petri Nets (CPNs), anextension of traditional Petri nets where tokens carry data values. In thispaper, we extend the translation to handle RPNs with token multiplicity underthe individual-token interpretation, a model which allows multiple tokens ofthe same type to exist in a system. To support the three types ofreversibility, tokens are associated with their causal history and, whiletokens of the same type are equally eligible to fire a transition when goingforward, when going backwards they are able to reverse only the transitionsthey have previously fired. The new translation, in addition to lifting therestriction on token uniqueness, presents a refined approach for transformingRPNs to CPNs through a unifying approach that allows instantiating each of thethree types of reversibility. The paper also reports on a tool that implementsthis translation, paving the way for automated translations and analysis ofreversible systems using CPN Tools.

Formal Translation from Reversing Petri Nets to Coloured Petri Nets