Reversibility and asymmetric conflict in event structures
Reversibility and asymmetric conflict in event structures
复制标题
DOI：
10.1016/j.jlamp.2015.07.004
复制
发表时间：
2015-11-01
影响因子：
0.9
通讯作者：
Ulidowski, Irek
中科院分区：
文献类型：
--
作者：
Phillips, Iain;Ulidowski, Irek
可逆计算近年来在硬件、软件和生物化学领域的应用越来越广泛。我们介绍了可逆形式的素数事件结构和非对称事件结构。为了控制事件反转的方式，我们对事件使用非对称冲突。我们证明了一些关于可达构型的结果；例如，我们证明了在什么条件下，有限的可达构型可以用纯有限的方法到达。我们用例子来讨论因果顺序的反转，其中一个事件只有在它引起的所有事件都被反转后才会反转，以及非因果反转的形式。(C) 2015爱思唯尔公司版权所有。
Reversible computation has attracted increasing interest in recent years, with applications in hardware, software and biochemistry. We introduce reversible forms of prime event structures and asymmetric event structures. In order to control the manner in which events are reversed, we use asymmetric conflict on events. We prove a number of results about reachable configurations; for instance, we show under what conditions reachable configurations which are finite are reachable by purely finite means. We discuss, with examples, reversing in causal order, where an event is only reversed once all events it caused have been reversed, as well as forms of non-causal reversing. (C) 2015 Elsevier Inc. All rights reserved.