10 research outputs found
Controlling Reversibility in Reversing Petri Nets with Application to Wireless Communications
Petri nets are a formalism for modelling and reasoning about the behaviour of
distributed systems. Recently, a reversible approach to Petri nets, Reversing
Petri Nets (RPN), has been proposed, allowing transitions to be reversed
spontaneously in or out of causal order. In this work we propose an approach
for controlling the reversal of actions of an RPN, by associating transitions
with conditions whose satisfaction/violation allows the execution of
transitions in the forward/reversed direction, respectively. We illustrate the
framework with a model of a novel, distributed algorithm for antenna selection
in distributed antenna arrays.Comment: RC 201
Reversing Steps in Petri Nets
In reversible computations one is interested in the development of mechanisms allowing to undo the effects of executed actions. The past research has been concerned mainly with reversing single actions. In this paper, we consider the problem of reversing the effect of the execution of groups of actions (steps). Using Petri nets as a system model, we introduce concepts related to this
new scenario, generalising notions used in the single action case. We then present a number of properties which arise in the context of reversing of steps of executed transitions in place/transition nets. We obtain both positive and negative results, showing that dealing with steps makes reversibility more involved than in the sequential case. In particular, we demonstrate that there is a crucial difference between reversing steps which are sets and those which are true multisets
Synthesis of Weighted Marked Graphs from Constrained Labelled Transition Systems: A Geometric Approach
22 pagesInternational audienceRecent studies investigated the problems of analysing Petri nets and synthesising them from labelled transition systems (LTS) with two labels (transitions) only. In this paper, we extend these works by providing new conditions for the synthesis of Weighted Marked Graphs (WMGs), a well-known and useful class of weighted Petri nets in which each place has at most one input and one output. Some of these new conditions do not restrict the number of labels; the other ones consider up to 3 labels. Additional constraints are investigated: when the LTS is either finite or infinite, and either cyclic or acyclic. We show that one of these conditions, developed for 3 labels, does not extend to 4 nor to 5 labels. Also, we tackle geometrically the WMG-solvability of finite, acyclic LTS with any number of labels
Towards Bridging Time and Causal Reversibility
Causal consistent reversibility blends causality and reversibility. For a concurrent system, it says that an
action can be undone provided this has no consequences, thereby making it possible to bring the system back
to a past consistent state. Time reversibility is considered instead in the performance evaluation field. A continuous-time Markov chain is time reversible if its behavior remains the same when the direction of time is reversed. We try to bridge these two theories by showing the conditions under which both causal consistent reversibility and time reversibility can be achieved in the setting of a stochastic process algebra
Foundations of reversible computation
Reversible computation allows computation to proceed not only in the standard, forward direction, but also backward, recovering past states. While reversible computation has attracted interest for its multiple applications, covering areas as different as low-power computing, simulation, robotics and debugging, such applications need to be supported by a clear understanding of the foundations of reversible computation. We report below on many threads of research in the area of foundations of reversible computing, giving particular emphasis to the results obtained in the framework of the European COST Action IC1405, entitled âReversible Computation - Extending Horizons of Computingâ, which took place in the years 2015â2019