Towards a taxonomy for reversible computation approaches

DOI10.1007/978-3-031-38100-3_3MaRDI QIDQ6148104

Robert Glück, Germán Vidal, Irek Ulidowski, Ivan Lanese, Jarosław Adam Miszczak, Claudio Antares Mezzina, Iain Phillips

Publication date: 11 January 2024

Published in: Reversible Computation (Search for Journal in Brave)

zbMATH Keywords

taxonomyreversible computingmodels and languages

Mathematics Subject Classification ID

Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) Quantum computation (81P68) Other nonclassical models of computation (68Q09)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Reversibility in the higher-order \(\pi\)-calculus
• A categorical theory of patches
• On reversible Turing machines and their function universality
• Reversibility and asymmetric conflict in event structures
• Fundamentals of reversible flowchart languages
• Reversible computing and cellular automata -- a survey
• Conservative logic
• Computation-universality of one-dimensional one-way reversible cellular automata
• Reversible computation in term rewriting
• Theory of reversible computing
• Implementing reversible object-oriented language features on reversible machines
• Reversible pushdown automata
• A theory of reversibility for Erlang
• Reversible computation in Petri nets
• \(\mathsf{CoreFun}\): a typed functional reversible core language
• A class of recursive permutations which is primitive recursive complete
• A Petri net view of covalent bonds
• Towards causal-consistent reversibility of imperative concurrent programs
• Modelling of DNA mismatch repair with a reversible process calculus
• The reversible temporal process language
• Models of quantum computation and quantum programming languages
• Reversible sessions with flexible choices
• A structural approach to reversible computation
• Reversing algebraic process calculi
• A collective interpretation semantics for reversing Petri nets
• Reversible computing from a programming language perspective
• Reversibility and Asymmetric Conflict in Event Structures
• Towards a Reversible Functional Language
• A Simple and Efficient Universal Reversible Turing Machine
• Reversible Computing
• Controlling Reversibility in Higher-Order Pi
• Reversible Computation vs. Reversibility in Petri Nets
• A Reversible Process Calculus and the Modelling of the ERK Signalling Pathway
• Controlled Reversibility and Compensations
• Reversible Machine Code and Its Abstract Processor Architecture
• Irreversibility and Heat Generation in the Computing Process
• Quantum theory, the Church–Turing principle and the universal quantum computer
• Synthesis of Quantum Circuits vs. Synthesis of Classical Reversible Circuits
• Causal-Consistent Replay Reversible Semantics for Message Passing Concurrent Programs
• Towards Bridging Time and Causal Reversibility
• Towards a Unified Language Architecture for Reversible Object-Oriented Programming
• Towards a Truly Concurrent Semantics for Reversible CCS
• Reversibility and Predictions
• Bidirectionalization transformation based on automatic derivation of view complement functions
• Characterizing Compatible View Updates in Syntactic Bidirectionalization
• A Compositional Semantics for the Reversible p-Calculus
• Theoretical foundations for compensations in flow composition languages
• CONCUR 2004 - Concurrency Theory
• Concurrent Flexible Reversibility
• Logical Reversibility of Computation
• Event Identifier Logic
• CONCUR 2005 – Concurrency Theory
• Event structure semantics of (controlled) reversible CCS

This page was built for publication: Towards a taxonomy for reversible computation approaches