当前位置: X-MOL 学术J. Log. Algebr. Methods Program. › 论文详情
Our official English website, www.x-mol.net, welcomes your feedback! (Note: you will need to create a separate account there.)
Reversible computation in nets with bonds
Journal of Logical and Algebraic Methods in Programming ( IF 0.9 ) Pub Date : 2021-09-14 , DOI: 10.1016/j.jlamp.2021.100718
Anna Philippou 1 , Kyriaki Psara 1
Affiliation  

Reversible computation is a form of computing that allows operations to be executed in both the forward as well as the backward direction. In this paper we propose an approach inspired by Petri nets for the modelling of reversible behaviour. Specifically, we introduce machinery and associated semantics to support the three main forms of reversibility namely, backtracking, causal reversing, and out-of-causal-order reversing in a type of nets where tokens are persistent, distinguished from each other by an identity, and can be connected to each other with the use of bonds. Our formalism is influenced by applications in biochemistry but the methodology can be applied to a wide range of problems that feature reversibility. In particular, we demonstrate the applicability of our approach with a model of the ERK signalling pathway, an example that inherently features reversible behaviour.



中文翻译:

带键网络的可逆计算

可逆计算是一种计算形式,它允许在前向和后向两个方向上执行运算。在本文中,我们提出了一种受 Petri 网启发的方法,用于对可逆行为进行建模。具体来说,我们引入了机制和相关语义来支持三种主要形式的可逆性,即回溯、因果反转和无序反转,其中令牌是持久的,通过身份相互区分,并且可以通过使用债券相互连接。我们的形式主义受到生物化学应用的影响,但该方法可以应用于具有可逆性的广泛问题。特别是,我们用 ERK 信号通路模型证明了我们的方法的适用性,

更新日期:2021-09-21
down
wechat
bug