1. Aubert, C., Cristescu, I.: Contextual equivalences in configuration structures and reversibility. J. Log. Algebraic Methods Program. 86(1), 77–106 (2017)
2. Baeten, J.C.M., Verhoef, C.: A congruence theorem for structured operational semantics with predicates. In: Best, E. (ed.) Proceedings of the 4th International Conference on Concurrency Theory, Hildesheim (CONCUR’93) Germany, Lecture Notes in Computer Science, August 23–26, 1993, vol 715. Springer, pp. 477–492 (1993)
3. Berut, A., Arakelyan, A., Petrosyan, A., Ciliberto, S., Dillenschneider, R., Lutz, E.: Experimental verification of Landauer’ s principle linking information and thermodynamics. Nature 483(7388), 187–189 (2012). 03
4. Boothe, B.: Efficient algorithms for bidirectional debugging. In: Proceedings of the ACM SIGPLAN 2000 Conference on Programming Language Design and Implementation (PLDI’00), New York, NY, USA. ACM, pp. 299–310 (2000)
5. Boreale, M., Sangiorgi, D.: A fully abstract semantics for causality in the pi-calculus. In: Proceedings of the 12th Annual Symposium on Theoretical Aspects of Computer Science (STACS’95), Munich, Germany, March 2–4, 1995, pp. 243–254 (1995)