Communicating sequential processes
Communicating sequential processes
Process algebra
Flow models of distributed computations: three equivalent semantics for CCS
Information and Computation
Refinement of actions and equivalence notions for concurrent systems
Acta Informatica
Communication and Concurrency
Time and Space Bounds for Reversible Simulation
ICALP '01 Proceedings of the 28th International Colloquium on Automata, Languages and Programming,
CONCUR '90 Proceedings of the Theories of Concurrency: Unification and Extension
Propositional Temporal Logics and Equivalences
CONCUR '92 Proceedings of the Third International Conference on Concurrency Theory
A Congruence Theorem for Structured Operational Semantics with Predicates
CONCUR '93 Proceedings of the 4th International Conference on Concurrency Theory
A Functional Quantum Programming Language
LICS '05 Proceedings of the 20th Annual IEEE Symposium on Logic in Computer Science
CONCUR 2005 - Concurrency Theory
A structural approach to reversible computation
Theoretical Computer Science
Irreversibility and heat generation in the computing process
IBM Journal of Research and Development
ESOP'03 Proceedings of the 12th European conference on Programming
Congruence for structural congruences
FOSSACS'05 Proceedings of the 8th international conference on Foundations of Software Science and Computation Structures
SOS formats and meta-theory: 20 years after
Theoretical Computer Science
Electronic Notes in Theoretical Computer Science (ENTCS)
Electronic Notes in Theoretical Computer Science (ENTCS)
Reversibility and Models for Concurrency
Electronic Notes in Theoretical Computer Science (ENTCS)
A Compositional Semantics for the Reversible p-Calculus
LICS '13 Proceedings of the 2013 28th Annual ACM/IEEE Symposium on Logic in Computer Science
Hi-index | 0.00 |
Reversible 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, ACP and CSP into reversible operators, while preserving their operational semantics.