Results 1  10
of
18
SOS formats and metatheory: 20 years after
, 2007
"... In 1981 Structural Operational Semantics (SOS) was introduced as a systematic way to define operational semantics of programming languages by a set of rules of a certain shape [G.D. Plotkin, A structural approach to operational semantics, Technical ..."
Abstract

Cited by 14 (5 self)
 Add to MetaCart
In 1981 Structural Operational Semantics (SOS) was introduced as a systematic way to define operational semantics of programming languages by a set of rules of a certain shape [G.D. Plotkin, A structural approach to operational semantics, Technical
General reversibility
 In EXPRESS’06, ENTCS. Elsevier
, 2006
"... The first and the second author introduced reversible ccs (rccs) in order to model concurrent computations where certain actions are allowed to be reversed. Here we show that the core of the construction can be analysed at an abstract level, yielding a theorem of pure category theory which underlies ..."
Abstract

Cited by 11 (3 self)
 Add to MetaCart
(Show Context)
The first and the second author introduced reversible ccs (rccs) in order to model concurrent computations where certain actions are allowed to be reversed. Here we show that the core of the construction can be analysed at an abstract level, yielding a theorem of pure category theory which underlies the previous results. This opens the way to several new examples; in particular we demonstrate an application to Petri nets. 1
Reversible structures
"... Abstract. Reversible structures are computational units that may progress forward and backward and are primarily inspired by dna circuits. We demonstrate a standardization theorem that bears a quadratic algorithm for reachability when units have unique id. We also discuss the encoding of a reversibl ..."
Abstract

Cited by 8 (1 self)
 Add to MetaCart
(Show Context)
Abstract. Reversible structures are computational units that may progress forward and backward and are primarily inspired by dna circuits. We demonstrate a standardization theorem that bears a quadratic algorithm for reachability when units have unique id. We also discuss the encoding of a reversible concurrent calculus into reversible structures. 1
Selfassembling trees
 SOS 2006
, 2006
"... RCCS is a variant of Milner's CCS where processes are allowed a controlled form of backtracking. It turns out that the RCCS reinterpretation of a CCS process is equivalent, in the sense of weak bisimilarity, to its causal transition system in CCS. This can be used to develop an efficient metho ..."
Abstract

Cited by 6 (3 self)
 Add to MetaCart
RCCS is a variant of Milner's CCS where processes are allowed a controlled form of backtracking. It turns out that the RCCS reinterpretation of a CCS process is equivalent, in the sense of weak bisimilarity, to its causal transition system in CCS. This can be used to develop an efficient method for designing distributed algorithms, which we illustrate here by deriving a distributed algorithm for assembling trees. This requires solving a highly distributed consensus, and a comparison with a traditional CCSbased solution shows that the code we obtain is shorter, easier to understand, and easier to prove correct by hand, or even to verify.
Concurrent flexible reversibility
 In Proceedings of the 22nd European conference on Programming Languages and Systems, ESOP’13
, 2013
"... Abstract. Concurrent reversibility has been studied in different areas, such as biological or dependable distributed systems. However, only “rigid ” reversibility has been considered, allowing to go back to a past state and restart the exact same computation, possibly leading to divergence. In this ..."
Abstract

Cited by 4 (0 self)
 Add to MetaCart
(Show Context)
Abstract. Concurrent reversibility has been studied in different areas, such as biological or dependable distributed systems. However, only “rigid ” reversibility has been considered, allowing to go back to a past state and restart the exact same computation, possibly leading to divergence. In this paper, we present crollπ, a concurrent calculus featuring flexible reversibility, allowing the specification of alternatives to a computation to be used upon rollback. Alternatives in crollπ are attached to messages. We show the robustness of this mechanism by encoding more complex idioms for specifying flexible reversibility, and we illustrate the benefits of our approach by encoding a calculus of communicating transactions. 1
A reversible process calculus and the modelling of the ERK signalling pathway
 In RC 2012, volume 7581 of LNCS
, 2012
"... We introduce a reversible process calculus with a new feature of execution control that allows us to change the direction and pattern of computation. This feature allows us to model a variety of modes of reverse computation, ranging from strict backtracking to reversing which respects causal order ..."
Abstract

Cited by 2 (0 self)
 Add to MetaCart
(Show Context)
We introduce a reversible process calculus with a new feature of execution control that allows us to change the direction and pattern of computation. This feature allows us to model a variety of modes of reverse computation, ranging from strict backtracking to reversing which respects causal ordering of events, and even reversing which violates causal ordering. The SOS rules that define the operators of the new calculus employ communication keys to handle communication correctly and key identifiers to control execution. As an application of our calculus, we model the ERK signalling pathway which delivers mitogenic and differentiation signals from the membrane of a cell to its nucleus. The proteins participating in the pathway are represented by reversible processes in such a way that the pathway’s biochemical reactions are simply interactions between the processes. 1
A Hierarchy of Reverse Bisimulations on Stable Configuration Structures
 UNDER CONSIDERATION FOR PUBLICATION IN MATH. STRUCT. IN COMP. SCIENCE
, 2010
"... The relationships between various equivalences on stable configuration structures, including interleaving bisimulation (IB), step bisimulation (SB), pomset bisimulation and hereditary historypreserving (HH) bisimulation, have been investigated by van Glabbeek and Goltz (and later Fecher). Since H ..."
Abstract

Cited by 2 (1 self)
 Add to MetaCart
The relationships between various equivalences on stable configuration structures, including interleaving bisimulation (IB), step bisimulation (SB), pomset bisimulation and hereditary historypreserving (HH) bisimulation, have been investigated by van Glabbeek and Goltz (and later Fecher). Since HH bisimulation may be characterised by the use of reverse as well as forward transitions, it is of interest to investigate these and other forms of bisimulations where both forward and reverse transitions are allowed. Bednarczyk asked whether SB with reverse steps is as strong as HH bisimulation. We answer this question negatively. We give various characterisations of SB with reverse steps, showing that forward steps do not add power. We strengthen Bednarczyk’s result that, in the absence of autoconcurrency, reverse IB is as strong as HH bisimulation, by showing that we need only exclude autoconcurrent events at the same depth in the configuration. We consider several other forms of observations of reversible behaviour. We define a wide range of bisimulations by mixing the forward and reverse observations. We investigate the power of these bisimulations and represent the relationships between them as a hierarchy which has IB at the bottom and HH at the top.
Decompositional reasoning about the history of parallel processes
, 2010
"... Abstract. This paper presents a decomposition technique for HennessyMilner logic with past and its extension with recursively defined formulae. In order to highlight the main ideas and technical tools, processes are described using a subset of CCS with parallel composition, nondeterministic choice, ..."
Abstract

Cited by 1 (1 self)
 Add to MetaCart
(Show Context)
Abstract. This paper presents a decomposition technique for HennessyMilner logic with past and its extension with recursively defined formulae. In order to highlight the main ideas and technical tools, processes are described using a subset of CCS with parallel composition, nondeterministic choice, action prefixing and the inaction constant. The study focuses on developing decompositional reasoning techniques for parallel contexts in that language. 1
devant le jury composé de
"... Sémantique operationelle et dénotationelle du picalcul réversible Operational and denotational semantics for the reversible picalculus soutenue par ..."
Abstract
 Add to MetaCart
(Show Context)
Sémantique operationelle et dénotationelle du picalcul réversible Operational and denotational semantics for the reversible picalculus soutenue par
Quantitative Analysis of Concurrent Reversible Computations
"... Abstract. Reversible computing is a paradigm of computation that extends the standard forwardonly programming to reversible programming, so that programs can be executed both in the standard, forward direction, and backward, going back to past states. In this paper we present novel quantitative s ..."
Abstract
 Add to MetaCart
(Show Context)
Abstract. Reversible computing is a paradigm of computation that extends the standard forwardonly programming to reversible programming, so that programs can be executed both in the standard, forward direction, and backward, going back to past states. In this paper we present novel quantitative stochastic models for concurrent and cooperating reversible computations. More precisely, we introduce the class of ρreversible stochastic automata and define a semantics for the synchronization ensuring that this class of models is closed under composition. For this class of automata we give an efficient way of deriving the equilibrium distribution. Moreover, we prove that the equilibrium distribution of the composition of reversible automata can be derived as the product of the equilibrium distributions of each automaton in isolation. 1