An axiomatic approach to reversible computation
From MaRDI portal
Publication:2200840
DOI10.1007/978-3-030-45231-5_23OpenAlexW3016916883MaRDI QIDQ2200840FDOQ2200840
Authors: Ivan Lanese, Iain Phillips, Irek Ulidowski
Publication date: 23 September 2020
Full work available at URL: https://doi.org/10.1007/978-3-030-45231-5_23
Recommendations
Cites Work
- Reversing algebraic process calculi
- Reversibility in the higher-order \(\pi\)-calculus
- General reversibility
- Controlling Reversibility in Higher-Order Pi
- A Reversible Process Calculus and the Modelling of the ERK Signalling Pathway
- Irreversibility and Heat Generation in the Computing Process
- A compositional semantics for the reversible \(\pi\)-calculus
- CONCUR 2004 - Concurrency Theory
- Logical Reversibility of Computation
- CONCUR 2005 – Concurrency Theory
- The difference between splitting in \(n\) and \(n+1\)
- Reversibility and models for concurrency
- An axiomatic approach to reversible computation
- Causal-consistent reversibility
- Causal-consistent rollback in a tuple-based language
- Models for concurrency: Towards a classification
- Title not available (Why is that?)
- Foundations of Software Science and Computation Structures
- Reversibility and asymmetric conflict in event structures
- A theory of reversibility for Erlang
- On reversibility and broadcast
- Reversible computation vs. reversibility in Petri nets
- Title not available (Why is that?)
- A modular formalization of reversibility for concurrent models and languages
Cited In (31)
- Bridging Causal Reversibility and Time Reversibility: A Stochastic Process Algebraic Approach
- Concurrencies in reversible concurrent calculi
- Event structures for the reversible early internal \(\pi\)-calculus
- An axiomatic approach to reversible computation
- Replications in reversible concurrent calculi
- revTPL: The Reversible Temporal Process Language
- The correctness of concurrencies in (reversible) concurrent calculi
- Periodicity and Immortality in Reversible Computing
- Controlled reversibility in communicating reaction systems
- Title not available (Why is that?)
- Explicit Identifiers and Contexts in Reversible Concurrent Calculus
- Modelling of DNA mismatch repair with a reversible process calculus
- Quantitative Analysis of Concurrent Reversible Computations
- A theory of reversibility for Erlang
- Title not available (Why is that?)
- Logical Approaches to Computational Barriers
- Reversible debugging of concurrent Erlang programs: supporting imperative primitives
- Reversibility in Erlang: imperative constructs
- A structural approach to reversible computation
- Concurrent RSSA for CRIL: flow analysis for a concurrent reversible programming language
- A collective interpretation semantics for reversing Petri nets
- A Design-Based Model of Reversible Computation
- Token multiplicity in reversing Petri nets under the individual token interpretation
- Transactions on Computational Science XXIV. Special issue on reversible computing.
- An axiomatic theory for reversible computation
- A unification of probabilistic choice within a design-based model of reversible computation
- Reversibility in space-bounded computation
- The reversible temporal process language
- Causal reversibility for timed process calculi with lazy/eager durationless actions and time additivity
- Causal reversibility implies time reversibility
- Towards causal-consistent reversibility of imperative concurrent programs
This page was built for publication: An axiomatic approach to reversible computation
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2200840)