AbstractReversible computation has a growing number of promising application areas such as the modelling of biochemical systems, program debugging and testing, and even programming languages for quantum computing. We formulate a procedure for converting operators of standard algebraic process calculi such as CCS into reversible operators, while preserving their operational semantics. We define forward–reverse bisimulation and show that it is preserved by all reversible operators
Reversible computing is a paradigm where programs can execute backward as well as in the usual forwa...
AbstractThe first and the second author introduced reversible CCS (RCCS) in order to model concurren...
International audienceOne obtains in this paper a process algebra RCCS, in the style of CCS, where p...
AbstractReversible computation has a growing number of promising application areas such as the model...
AbstractReversible computation has a growing number of promising application areas such as the model...
AbstractThere is a growing interest in models of reversible computation driven by exciting applicati...
There is a growing interest in models of reversible computation driven by exciting application areas...
Existing formalisms for the algebraic specification and representation of networks of reversible age...
Reversibility is the capability of a system of undoing its own actions starting from the last perfor...
In reversible computing a program can undo a set of past actions. This is useful in many areas inclu...
AbstractThe λ-calculus is destructive: its main computational mechanism – beta reduction – destroys ...
We introduce reversible structures, an algebra for massive concurrent systems, where terms retain bi...
International audienceExisting formalisms for the algebraic specification and representation of netw...
The Concurrency Column of EATCS Bulletin, No 129A number of formalisms have been proposed to model v...
In the context of CCSK, a reversible extension of CCS, we study observational equivalences that dist...
Reversible computing is a paradigm where programs can execute backward as well as in the usual forwa...
AbstractThe first and the second author introduced reversible CCS (RCCS) in order to model concurren...
International audienceOne obtains in this paper a process algebra RCCS, in the style of CCS, where p...
AbstractReversible computation has a growing number of promising application areas such as the model...
AbstractReversible computation has a growing number of promising application areas such as the model...
AbstractThere is a growing interest in models of reversible computation driven by exciting applicati...
There is a growing interest in models of reversible computation driven by exciting application areas...
Existing formalisms for the algebraic specification and representation of networks of reversible age...
Reversibility is the capability of a system of undoing its own actions starting from the last perfor...
In reversible computing a program can undo a set of past actions. This is useful in many areas inclu...
AbstractThe λ-calculus is destructive: its main computational mechanism – beta reduction – destroys ...
We introduce reversible structures, an algebra for massive concurrent systems, where terms retain bi...
International audienceExisting formalisms for the algebraic specification and representation of netw...
The Concurrency Column of EATCS Bulletin, No 129A number of formalisms have been proposed to model v...
In the context of CCSK, a reversible extension of CCS, we study observational equivalences that dist...
Reversible computing is a paradigm where programs can execute backward as well as in the usual forwa...
AbstractThe first and the second author introduced reversible CCS (RCCS) in order to model concurren...
International audienceOne obtains in this paper a process algebra RCCS, in the style of CCS, where p...
DOI
Add to ORKG