Reversible Communicating Systems
By Vincent Danos, Jean-Louis Krivine. International Conference on Concurrency Theory, 2004
400 citations recorded by the source corpus.
Subfields: Computational Theory and Mathematics, Computer Networks and Communications
View Paper: https://www.semanticscholar.org/paper/7dbcc829411392b736cf356759d5f1bc483e5a03
How researchers see this paper
The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.
In Computational Theory and Mathematics
In Computer Networks and Communications
Citations in the corpus
- Transactions in RCCS (2005, methodology): “A crucial point is that this backtracking mechanism is correct [2], in the sense that it never reaches states that could not be reached forwardly, else condition (ii) would be no longer satisfied, and reaches them all, else condition (iii) would no longer be satisfied either.”