Medic, Doriana and Mezzina, Claudio Antares Static VS Dynamic Reversibility in CCS. In: Reversible Computation : 8th International Conference, RC 2016, Bologna, Italy, July 7-8, 2016, Proceedings. Lecture Notes in Computer Science (9720). Springer, pp. 36-51. ISBN 978-3-319-40577-3 (2016)
This is the latest version of this item.
|
PDF
Download (362kB) | Preview |
Abstract
The notion of reversible computing is attracting interest because of its applications in diverse fields, in particular the study of programming abstractions for fault tolerant systems. Reversible CCS (RCCS), proposed by Danos and Krivine, enacts reversibility by means of memory stacks. Ulidowski and Phillips proposed a general method to reverse a process calculus given in a particular SOS format, by exploiting the idea of making all the operators of a calculus static. CCSK is then derived from CCS with this method. In this paper we show that RCCS is at least as expressive as CCSK.
| Item Type: | Book Section |
|---|---|
| Identification Number: | https://doi.org/10.1007/978-3-319-40578-0 |
| Subjects: | Q Science > QA Mathematics > QA75 Electronic computers. Computer science Q Science > QA Mathematics > QA76 Computer software |
| Research Area: | Computer Science and Applications |
| Depositing User: | Claudio Antares Mezzina |
| Date Deposited: | 08 Sep 2016 06:40 |
| Last Modified: | 08 Sep 2016 06:40 |
| URI: | http://eprints.imtlucca.it/id/eprint/3526 |
Available Versions of this Item
-
Static VS Dynamic Reversibility in CCS. (deposited 13 Jul 2016 09:39)
- Static VS Dynamic Reversibility in CCS. (deposited 08 Sep 2016 06:40) [Currently Displayed]
Actions (login required)
 |
Edit Item |
