Reversible Computation 4th International Workshop, RC 2012, Copenhagen, Denmark, July 2-3, 2012, Revised Papers

• Main Authors: Glück, Robert, Yokoyama, Tetsuo
• Format: eBook
• Language: English
• Published: Netherlands Springer Nature 2013; Springer Berlin / Heidelberg; Springer
• Edition: 1
• Series: LNCS sublibrary. SL 2, Programming and software engineering
• Subjects: Computer logic; Computer programming, programs, data; Computer science; Data processing; Physics; Software engineering

This book constitutes the refereed proceedings of the 4th International Workshop on Reversible Computation, RC 2012, held in Copenhagen, Denmark, in July 2012. The 19 contributions presented in this volume were carefully reviewed and selected from 46 submissions. The papers cover theoretical conside...

Table of Contents:

• Prior Foundations: Value Search and Route Graphs -- Handling Loops -- Dealing with While Loops -- Dealing with Loops other than While Loops -- Discussion -- Conclusion and Future Work -- References -- Frugal Encoding in Reversible MOQA: A Case Study for Quicksort -- Introduction -- Background -- Efficient Encoding -- Quicksort -- Reversing Quicksort -- Forward Computing -- Reverse Computing -- Conclusion and Future Work -- References -- Towards a General-Purpose,Reversible Language for Controlling Self-reconfigurable Robots -- Introduction -- Background: Modular Robots -- Self-reconfiguration -- The DynaRole Language -- The Role of Reversibility -- General Principles -- Experiments in rRoCE -- Informal Language Description -- Obstacle Avoidance Example -- Reverse Obstacle Avoidance -- Conclusion and Future Work -- References -- Reversible and Quantum Circuits -- Reversible and Quantum Circuit Optimization: A Functional Approach -- Introduction -- Background -- Basic Optimization Approach -- DDMF-Based Optimization Method -- DDMFs for Reversible and Quantum Circuits -- The Functional Optimization Method -- Experimental Results -- Conclusion -- References -- Properties of Quantum Templates -- Introduction -- Preliminaries -- Previous Work on Quantum Templates -- Quantum Templates: Definition and Properties -- Generation of Quantum Templates from Identities -- Impact of Reconfigured Templates -- Completeness of Optimality of Binary Realizations from Templates -- Conclusion and Future Work -- References -- Optimal 4-bit Reversible Mixed-Polarity Toffoli Circuits -- Introduction -- Preliminaries -- Cost Functions and Optimal Reversible Circuits -- Gate Count Optimal Synthesis -- Our Extension to the Synthesis Algorithm -- Experimental Results -- Conclusions and Future Work -- References -- Design of an Online Testable Ternary Circuit from the Truth Table
• Introduction -- Background -- Online Testing -- Fault Models -- Ternary Galois Field Logic -- Reversible Ternary Gates -- Synthesis of Ternary Reversible Circuits -- Our Approach -- Design -- Fault Detection -- Discussion -- Comparison with Related Work -- Conclusion -- References -- Physical Realizations and Design -- Garbageless Reversible Implementation of Integer Linear Transformations -- Introduction -- Approximating the Discrete Cosine Transform -- The H.264 Transform -- Implementing H.264 -- Avoiding Garbage -- Conclusion -- References -- Garbage-Free Reversible Integer Multiplication with Constants of the Form 2k2l1 -- Introduction -- Garbage-Free Reversible Constant Multiplication -- The Idea -- The Implementation -- Extending to Multiplication by 2k-1 -- Cascades and Limitations -- Multioperand Adders and Multiplication -- A Three-Operand V-Shape Adder -- Specializing to Multiplication by 2k + 2l + 1 -- Extending to Multiplication by 2k 2l 1 -- Conclusion and Future Work -- References -- Property Checking of Quantum Circuits Using Quantum Multiple-Valued Decision Diagrams -- Introduction -- Preliminaries -- Quantum Circuits -- Quantum Multiple-Valued Decision Diagrams -- Property Checking of Quantum Circuits -- Problem Formulation -- Quantum Circuit Verification -- General Idea -- Implementation -- Combine the Circuits and Ensure Unitary -- Build a QMDD from the Combined Circuit -- Modify the QMDD -- Determine the Result -- Experimental Results -- Conclusions -- References -- Using πDDs in the Design of Reversible Circuits(Work-In-Progress) -- Introduction -- Preliminaries -- Reversible Functions and Circuits -- The DD Data-Structure -- Applications in the Design of Reversible Circuits -- Determination of the Number of Minimal Circuits -- Synthesis with Minimal Number of Gates -- Heuristic Synthesis -- Debugging
• Conclusions and Future Work -- References -- Distributed Systems -- A Verification Technique for Reversible Process Algebra -- Introduction -- CCS -- Syntax -- Operational Semantics -- Process Equivalence -- Reversible CCS -- Syntax -- Operational Semantics -- The Fundamental Property -- Causal Compression -- Flow Event Structures -- Algorithmic Discussion -- Benchmark -- Conclusion -- References -- A Reversible Process Calculus and the Modelling of the ERK Signalling Pathway -- Introduction -- A Reversible Process Calculus with Execution Control -- CCSK -- Execution Control Operator -- The ERK Signalling Pathway -- Conclusion -- References -- Controlled Reversibility and Compensations -- Motivation -- Reversibility in a Concurrency Setting -- Controlling Reversibility -- Reversibility and Compensations -- Conclusion -- References -- Author Index
• Title -- Preface -- Organization -- Table of Contents -- Theoretical Considerations -- Tutorial: Graphical Calculus for Quantum Circuits -- The Graphical Language: Networks of Wires and Dots -- The Equational Rules -- The T-Rule -- The S-Rules -- The B-Rules -- The K-Rules -- The C-Rule -- The D-Rules -- Interpreting the zx-calculus in Hilbert Space -- Universality of the zx-calculus -- Completeness of the zx-calculus -- The zx-calculus in Use -- References -- One-Way Reversible Multi-head Finite Automata -- Introduction -- Preliminaries and Definitions -- Computational Capacity -- Head Hierarchy -- Decidability Problems -- References -- A Deterministic Two-Way Multi-head Finite Automaton Can Be Converted into a Reversible One with the Same Number of Heads -- Introduction -- A Two-Way Multi-Head Finite Automaton -- Converting a DMFA(k) into an RDMFA(k) -- Applying the Conversion Method to Turing Machines -- Concluding Remarks -- References -- Undecidability of the Surjectivity of the Subshift Associated to a Turing Machine -- Definitions -- Turing Machine -- Dynamical System -- Surjectivity -- Blocking States -- Undecidability of Preliminary Problems -- Undecidability of the Blocking State Problem -- Undecidability of the Blocking State Problem in Complete RTMs -- Undecidability of the Surjectivity of the Subshift Associated to a Turing Machine -- Conclusions -- References -- Reversible Software and Languages -- Isomorphic Interpreters from Logically Reversible Abstract Machines -- Introduction -- Review of the Reversible Language: o -- Universality -- Numeric Operations -- Simple Bounded Number Iteration -- Counting -- Steps of the Construction -- Adder -- Advanced Examples -- Tree Traversal -- Parity Translation -- A Πo Interpreter -- Conclusion -- References -- Synthesizing Loops For Program Inversion -- Introduction