L. Aceto, A. Ingolfsdottir, K.G. Larsen & J. Srba (2007):
Reactive Systems: Modelling, Specification and Verification.
Cambridge University Press,
doi:10.1017/CBO9780511814105.
C.H. Bennett (1973):
Logical Reversibility of Computation.
IBM Journal of Research and Development 17,
pp. 525–532,
doi:10.1147/rd.176.0525.
M. Bernardo & A. Esposito (2023):
On the Weak Continuation of Reverse Bisimilarity vs. Forward Bisimilarity.
In: Proc. of the 24th Italian Conf. on Theoretical Computer Science (ICTCS 2023).
CEUR-WS.
To appear.
M. Bernardo & S. Rossi (2023):
Reverse Bisimilarity vs. Forward Bisimilarity.
In: Proc. of the 26th Int. Conf. on Foundations of Software Science and Computation Structures (FOSSACS 2023),
LNCS 13992.
Springer,
pp. 265–284,
doi:10.1007/978-3-031-30829-1_13.
M.C. Browne, E.M. Clarke & O. Grümberg (1988):
Characterizing Finite Kripke Structures in Propositional Temporal Logic.
Theoretical Computer Science 59,
pp. 115–131,
doi:10.1016/0304-3975(88)90098-9.
R. Cleaveland (1990):
On Automatically Explaining Bisimulation Inequivalence.
In: Proc. of the 2nd Int. Workshop on Computer Aided Verification (CAV 1990),
LNCS 531.
Springer,
pp. 364–372,
doi:10.1007/BFb0023750.
V. Danos & J. Krivine (2004):
Reversible Communicating Systems.
In: Proc. of the 15th Int. Conf. on Concurrency Theory (CONCUR 2004),
LNCS 3170.
Springer,
pp. 292–307,
doi:10.1007/978-3-540-28644-8_19.
R. De Nicola, U. Montanari & F. Vaandrager (1990):
Back and Forth Bisimulations.
In: Proc. of the 1st Int. Conf. on Concurrency Theory (CONCUR 1990),
LNCS 458.
Springer,
pp. 152–165,
doi:10.1007/BFb0039058.
R. De Nicola & F. Vaandrager (1995):
Three Logics for Branching Bisimulation.
Journal of the ACM 42,
pp. 458–487,
doi:10.1145/201019.201032.
R.J. van Glabbeek & W.P. Weijland (1996):
Branching Time and Abstraction in Bisimulation Semantics.
Journal of the ACM 43,
pp. 555–600,
doi:10.1145/233551.233556.
M. Hennessy & R. Milner (1985):
Algebraic Laws for Nondeterminism and Concurrency.
Journal of the ACM 32,
pp. 137–162,
doi:10.1145/2455.2460.
M. Hennessy & C. Stirling (1985):
The Power of the Future Perfect in Program Logics.
Information and Control 67,
pp. 23–52,
doi:10.1016/S0019-9958(85)80025-5.
R. Landauer (1961):
Irreversibility and Heat Generation in the Computing Process.
IBM Journal of Research and Development 5,
pp. 183–191,
doi:10.1147/rd.53.0183.
I. Lanese, D. Medi\'c & C.A. Mezzina (2021):
Static versus Dynamic Reversibility in CCS.
Acta Informatica 58,
pp. 1–34,
doi:10.1007/s00236-019-00346-6.
O. Lichtenstein, A. Pnueli & L. Zuck (1985):
The Glory of the Past.
In: Proc. of the Conf. on Logics in Programs,
LNCS 193.
Springer,
pp. 196–218,
doi:10.1007/3-540-15648-8_16.
R. Milner (1989):
Communication and Concurrency.
Prentice Hall.
D. Park (1981):
Concurrency and Automata on Infinite Sequences.
In: Proc. of the 5th GI Conf. on Theoretical Computer Science,
LNCS 104.
Springer,
pp. 167–183,
doi:10.1007/BFb0017309.
I. Phillips & I. Ulidowski (2007):
Reversing Algebraic Process Calculi.
Journal of Logic and Algebraic Programming 73,
pp. 70–96,
doi:10.1016/j.jlap.2006.11.002.
eptcs@eptcs.org