eprintid: 3514
rev_number: 9
eprint_status: archive
userid: 67
dir: disk0/00/00/35/14
datestamp: 2016-07-13 09:39:18
lastmod: 2016-07-13 09:39:18
status_changed: 2016-07-13 09:39:18
type: book_section
metadata_visibility: no_search
creators_name: Medic, Doriana
creators_name: Mezzina, Claudio Antares
creators_id: 
creators_id: claudio.mezzina@imtlucca.it
title: Static VS Dynamic Reversibility in CCS
ispublished: pub
subjects: QA75
subjects: QA76
divisions: CSA
full_text_status: none
pres_type: paper
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.
date: 2016
date_type: published
series: Lecture Notes in Computer Science
number: 9720
publisher: Springer
pagerange: 36-51
pages: 15
event_title: Reversible Computation - 8th International Conference, RC 2016, Bologna, Italy, July 7-8, 2016, Proceedings
event_type: conference
id_number: 10.1007/978-3-319-40578-0
refereed: TRUE
isbn: 978-3-319-40577-3
book_title: Reversible Computation : 8th International Conference, RC 2016, Bologna, Italy, July 7-8, 2016, Proceedings
official_url: http://dx.doi.org/10.1007/978-3-319-40578-0_3
citation:   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)