Towards a Taxonomy for Reversible Computation Approaches
Research output: Chapter in Book/Report/Conference proceeding › Article in proceedings › Research › peer-review
Standard
Towards a Taxonomy for Reversible Computation Approaches. / Glück, Robert; Lanese, Ivan; Mezzina, Claudio Antares; Miszczak, Jarosław Adam; Phillips, Iain; Ulidowski, Irek; Vidal, Germán.
Reversible Computation - 15th International Conference, RC 2023, Proceedings. ed. / Martin Kutrib; Uwe Meyer. Springer, 2023. p. 24-39 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), Vol. 13960 LNCS).Research output: Chapter in Book/Report/Conference proceeding › Article in proceedings › Research › peer-review
Harvard
APA
Vancouver
Author
Bibtex
}
RIS
TY - GEN
T1 - Towards a Taxonomy for Reversible Computation Approaches
AU - Glück, Robert
AU - Lanese, Ivan
AU - Mezzina, Claudio Antares
AU - Miszczak, Jarosław Adam
AU - Phillips, Iain
AU - Ulidowski, Irek
AU - Vidal, Germán
N1 - Publisher Copyright: © 2023, The Author(s), under exclusive license to Springer Nature Switzerland AG.
PY - 2023
Y1 - 2023
N2 - Reversible computation is a paradigm allowing computation to proceed not only in the usual, forward direction, but also backwards. Reversible computation has been studied in a variety of models, including sequential and concurrent programming languages, automata, process calculi, Turing machines, circuits, Petri nets, event structures, term rewriting, quantum computing, and others. Also, it has found applications in areas as different as low-power computing, debugging, simulation, robotics, database design, and biochemical modeling. Thus, while the broad idea of reversible computation is the same in all the areas, it has been interpreted and adapted to fit the various settings. The existing notions of reversible computation however have never been compared and categorized in detail. This work aims at being a first stepping stone towards a taxonomy of the approaches that co-exist under the term reversible computation. We hope that such a work will shed light on the relation among the various approaches.
AB - Reversible computation is a paradigm allowing computation to proceed not only in the usual, forward direction, but also backwards. Reversible computation has been studied in a variety of models, including sequential and concurrent programming languages, automata, process calculi, Turing machines, circuits, Petri nets, event structures, term rewriting, quantum computing, and others. Also, it has found applications in areas as different as low-power computing, debugging, simulation, robotics, database design, and biochemical modeling. Thus, while the broad idea of reversible computation is the same in all the areas, it has been interpreted and adapted to fit the various settings. The existing notions of reversible computation however have never been compared and categorized in detail. This work aims at being a first stepping stone towards a taxonomy of the approaches that co-exist under the term reversible computation. We hope that such a work will shed light on the relation among the various approaches.
KW - Models and languages
KW - Reversible computing
KW - Taxonomy
UR - http://www.scopus.com/inward/record.url?scp=85169045145&partnerID=8YFLogxK
U2 - 10.1007/978-3-031-38100-3_3
DO - 10.1007/978-3-031-38100-3_3
M3 - Article in proceedings
AN - SCOPUS:85169045145
SN - 9783031380990
T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
SP - 24
EP - 39
BT - Reversible Computation - 15th International Conference, RC 2023, Proceedings
A2 - Kutrib, Martin
A2 - Meyer, Uwe
PB - Springer
T2 - 15th International Conference on Reversible Computation, RC 2023
Y2 - 18 July 2023 through 19 July 2023
ER -
ID: 366989094