Reversible Communicating Systems
Résumé
One obtains in this paper a process algebra RCCS, in the style of CCS, where processes can backtrack. Backtrack, just as plain forward computation, is seen as a synchronization and incurs no additional cost on the communication structure. It is shown that, given a past, a computation step can be taken back if and only if it leads to a causally equivalent past.
Domaines
Théorie et langage formel [cs.FL]
Origine : Fichiers produits par l'(les) auteur(s)
Loading...