{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,8,28]],"date-time":"2026-08-28T14:16:41Z","timestamp":1787926601790,"version":"build-2784847793"},"publisher-location":"Cham","reference-count":67,"publisher":"Springer Nature Switzerland","isbn-type":[{"value":"9783031954962","type":"print"},{"value":"9783031954979","type":"electronic"}],"license":[{"start":{"date-parts":[[2025,1,1]],"date-time":"2025-01-01T00:00:00Z","timestamp":1735689600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2025,1,1]],"date-time":"2025-01-01T00:00:00Z","timestamp":1735689600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2025]]},"DOI":"10.1007\/978-3-031-95497-9_5","type":"book-chapter","created":{"date-parts":[[2025,6,14]],"date-time":"2025-06-14T13:15:42Z","timestamp":1749906942000},"page":"75-95","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Noninterference Analysis of Stochastically Timed Reversible Systems"],"prefix":"10.1007","author":[{"given":"Andrea","family":"Esposito","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Alessandro","family":"Aldini","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Marco","family":"Bernardo","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2025,6,11]]},"reference":[{"key":"5_CR1","doi-asserted-by":"publisher","first-page":"49","DOI":"10.1109\/MSEC.2018.2888775","volume":"17","author":"M Al-Rubaie","year":"2019","unstructured":"Al-Rubaie, M., Chang, J.M.: Privacy-preserving machine learning: threats and solutions. IEEE Secur. Priv. 17, 49\u201358 (2019)","journal-title":"IEEE Secur. Priv."},{"key":"5_CR2","doi-asserted-by":"publisher","first-page":"16","DOI":"10.1016\/j.scico.2005.07.010","volume":"63","author":"A Aldini","year":"2006","unstructured":"Aldini, A.: Classification of security properties in a Linda-like process algebra. Sci. Comput. Program. 63, 16\u201338 (2006)","journal-title":"Sci. Comput. Program."},{"key":"5_CR3","doi-asserted-by":"crossref","unstructured":"Aldini, A., Bernardo, M.: A general framework for nondeterministic, probabilistic, and stochastic noninterference. In: Proceedings of the 1st Joint Workshop on Automated Reasoning for Security Protocol Analysis and Issues in the Theory of Security (ARSPA\/WITS\u00a02009), LNCS, vol.\u00a05511, pp. 18\u201333. Springer (2009)","DOI":"10.1007\/978-3-642-03459-6_2"},{"key":"5_CR4","doi-asserted-by":"publisher","first-page":"282","DOI":"10.1016\/j.sysarc.2010.06.005","volume":"57","author":"A Aldini","year":"2011","unstructured":"Aldini, A., Bernardo, M.: Component-oriented verification of noninterference. J. Syst. Architect. 57, 282\u2013293 (2011)","journal-title":"J. Syst. Architect."},{"key":"5_CR5","doi-asserted-by":"publisher","first-page":"191","DOI":"10.3233\/JCS-2004-12202","volume":"12","author":"A Aldini","year":"2004","unstructured":"Aldini, A., Bravetti, M., Gorrieri, R.: A process-algebraic approach for the analysis of probabilistic noninterference. J. Comput. Secur. 12, 191\u2013245 (2004)","journal-title":"J. Comput. Secur."},{"key":"5_CR6","doi-asserted-by":"publisher","first-page":"58","DOI":"10.1016\/j.tcs.2011.07.020","volume":"413","author":"S Andova","year":"2012","unstructured":"Andova, S., Georgievska, S., Trcka, N.: Branching bisimulation congruence for probabilistic systems. Theoret. Comput. Sci. 413, 58\u201372 (2012)","journal-title":"Theoret. Comput. Sci."},{"key":"5_CR7","doi-asserted-by":"crossref","unstructured":"Bai, Y., Fan, M., Li, Y., Xie, C.: Privacy risk assessment of training data in machine learning. In: Proceedings of the 34th IEEE Int. Conf. on Communications (ICC\u00a02022), pp. 1015\u20131015. IEEE-CS Press (2022)","DOI":"10.1109\/ICC45855.2022.9839062"},{"key":"5_CR8","first-page":"137","volume":"54","author":"R Barbuti","year":"2003","unstructured":"Barbuti, R., Tesei, L.: A decidable notion of timed non-interference. Fund. Inform. 54, 137\u2013150 (2003)","journal-title":"Fund. Inform."},{"key":"5_CR9","doi-asserted-by":"publisher","first-page":"525","DOI":"10.1147\/rd.176.0525","volume":"17","author":"CH Bennett","year":"1973","unstructured":"Bennett, C.H.: Logical reversibility of computation. IBM J. Res. Dev. 17, 525\u2013532 (1973)","journal-title":"IBM J. Res. Dev."},{"key":"5_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"180","DOI":"10.1007\/978-3-540-72522-0_5","volume-title":"Formal Methods for Performance Evaluation","author":"M Bernardo","year":"2007","unstructured":"Bernardo, M.: A survey of Markovian behavioral equivalences. In: Bernardo, M., Hillston, J. (eds.) SFM 2007. LNCS, vol. 4486, pp. 180\u2013219. Springer, Heidelberg (2007). https:\/\/doi.org\/10.1007\/978-3-540-72522-0_5"},{"key":"5_CR11","doi-asserted-by":"publisher","first-page":"99","DOI":"10.1016\/j.tcs.2014.10.025","volume":"563","author":"M Bernardo","year":"2015","unstructured":"Bernardo, M.: On the tradeoff between compositionality and exactness in weak bisimilarity for integrated-time Markovian process calculi. Theoret. Comput. Sci. 563, 99\u2013143 (2015)","journal-title":"Theoret. Comput. Sci."},{"key":"5_CR12","doi-asserted-by":"publisher","first-page":"117","DOI":"10.1016\/S0304-3975(01)00090-1","volume":"290","author":"M Bernardo","year":"2003","unstructured":"Bernardo, M., Bravetti, M.: Performance measure sensitive congruences for Markovian process algebras. Theoret. Comput. Sci. 290, 117\u2013160 (2003)","journal-title":"Theoret. Comput. Sci."},{"key":"5_CR13","doi-asserted-by":"publisher","first-page":"2","DOI":"10.1016\/j.tcs.2016.02.022","volume":"629","author":"M Bernardo","year":"2016","unstructured":"Bernardo, M., Corradini, F., Tesei, L.: Timed process calculi with deterministic or stochastic delays: commuting between durational and durationless actions. Theoret. Comput. Sci. 629, 2\u201339 (2016)","journal-title":"Theoret. Comput. Sci."},{"key":"5_CR14","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/S0304-3975(97)00127-8","volume":"202","author":"M Bernardo","year":"1998","unstructured":"Bernardo, M., Gorrieri, R.: A tutorial on EMPA: a theory of concurrent processes with nondeterminism, priorities, probabilities and time. Theoret. Comput. Sci. 202, 1\u201354 (1998)","journal-title":"Theoret. Comput. Sci."},{"key":"5_CR15","doi-asserted-by":"crossref","unstructured":"Bernardo, M., Lanese, I., Marin, A., Mezzina, C.A., Rossi, S., Sacerdoti Coen, C.: Causal reversibility implies time reversibility. In: Proceedings of the 20th International Conference on the Quantitative Evaluation of Systems (QEST\u00a02023), LNCS, vol. 14287, pp. 270\u2013287. Springer (2023)","DOI":"10.1007\/978-3-031-43835-6_19"},{"key":"5_CR16","doi-asserted-by":"crossref","unstructured":"Bernardo, M., Mezzina, C.A.: Bridging causal reversibility and time reversibility: a stochastic process algebraic approach. Logical Methods Comput. Sci. 19(2), 6:1\u20136:27 (2023)","DOI":"10.46298\/lmcs-19(2:6)2023"},{"key":"5_CR17","doi-asserted-by":"crossref","unstructured":"Bernardo, M., Rossi, S.: Reverse bisimilarity vs. forward bisimilarity. In: Proceeding of the 26th International Conference on Foundations of Software Science and Computation Structures (FOSSACS\u00a02023), LNCS, vol. 13992, pp. 265\u2013284. Springer (2023)","DOI":"10.1007\/978-3-031-30829-1_13"},{"key":"5_CR18","doi-asserted-by":"publisher","first-page":"560","DOI":"10.1145\/828.833","volume":"31","author":"SD Brookes","year":"1984","unstructured":"Brookes, S.D., Hoare, C., Roscoe, A.W.: A theory of communicating sequential processes. J. ACM 31, 560\u2013599 (1984)","journal-title":"J. ACM"},{"key":"5_CR19","unstructured":"Buchholz, P.: Markovian process algebra: composition and equivalence. In: Proceeding of the 2nd International Workshop on Process Algebra and Performance Modelling (PAPM\u00a01994), pp. 11\u201330. University of Erlangen, Technical Report\u00a027-4 (1994)"},{"key":"5_CR20","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"292","DOI":"10.1007\/978-3-540-28644-8_19","volume-title":"CONCUR 2004 - Concurrency Theory","author":"V Danos","year":"2004","unstructured":"Danos, V., Krivine, J.: Reversible communicating systems. In: Gardner, P., Yoshida, N. (eds.) CONCUR 2004. LNCS, vol. 3170, pp. 292\u2013307. Springer, Heidelberg (2004). https:\/\/doi.org\/10.1007\/978-3-540-28644-8_19"},{"key":"5_CR21","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"398","DOI":"10.1007\/11539452_31","volume-title":"CONCUR 2005 \u2013 Concurrency Theory","author":"V Danos","year":"2005","unstructured":"Danos, V., Krivine, J.: Transactions in RCCS. In: Abadi, M., de Alfaro, L. (eds.) CONCUR 2005. LNCS, vol. 3653, pp. 398\u2013412. Springer, Heidelberg (2005). https:\/\/doi.org\/10.1007\/11539452_31"},{"key":"5_CR22","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"152","DOI":"10.1007\/BFb0039058","volume-title":"CONCUR \u201990 Theories of Concurrency: Unification and Extension","author":"R De Nicola","year":"1990","unstructured":"De Nicola, R., Montanari, U., Vaandrager, F.: Back and forth bisimulations. In: Baeten, J., Klop, J.W. (eds.) CONCUR 1990. LNCS, vol. 458, pp. 152\u2013165. Springer, Heidelberg (1990). https:\/\/doi.org\/10.1007\/BFb0039058"},{"key":"5_CR23","unstructured":"Engblom, J.: A review of reverse debugging. In: Proceeding of the 4th System, Software, SoC and Silicon Debug Conference (S4D 2012), pp.\u00a01\u20136. IEEE-CS Press (2012)"},{"key":"5_CR24","doi-asserted-by":"crossref","unstructured":"Esposito, A., Aldini, A., Bernardo, M.: Noninterference analysis of reversible probabilistic systems. In: Proceeding of the 44th International Conference on Formal Techniques for Distributed Objects, Components, and Systems (FORTE\u00a02024), LNCS, vol. 14678, pp. 39\u201359. Springer (2024)","DOI":"10.1007\/978-3-031-62645-6_3"},{"key":"5_CR25","doi-asserted-by":"crossref","unstructured":"Esposito, A., Aldini, A., Bernardo, M., Rossi, S.: Noninterference analysis of reversible systems: an approach based on branching bisimilarity. Logical Methods Comput. Sci. 21(1), 6:1\u20136:28 (2025)","DOI":"10.46298\/lmcs-21(1:6)2025"},{"key":"5_CR26","doi-asserted-by":"crossref","unstructured":"Focardi, R., Gorrieri, R.: Classification of security properties. In: Proceeding of the 1st International School on Foundations of Security Analysis and Design (FOSAD\u00a02000), LNCS, vol.\u00a02171, pp. 331\u2013396. Springer (2001)","DOI":"10.1007\/3-540-45608-2_6"},{"key":"5_CR27","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"16","DOI":"10.1007\/3-540-47813-2_2","volume-title":"Verification, Model Checking, and Abstract Interpretation","author":"R Focardi","year":"2002","unstructured":"Focardi, R., Piazza, C., Rossi, S.: Proofs methods for bisimulation based information flow security. In: Cortesi, A. (ed.) VMCAI 2002. LNCS, vol. 2294, pp. 16\u201331. Springer, Heidelberg (2002). https:\/\/doi.org\/10.1007\/3-540-47813-2_2"},{"key":"5_CR28","doi-asserted-by":"publisher","first-page":"65","DOI":"10.3233\/JCS-2006-14103","volume":"14","author":"R Focardi","year":"2006","unstructured":"Focardi, R., Rossi, S.: Information flow security in dynamic contexts. J. Comput. Secur. 14, 65\u2013110 (2006)","journal-title":"J. Comput. Secur."},{"key":"5_CR29","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"370","DOI":"10.1007\/978-3-642-54804-8_26","volume-title":"Fundamental Approaches to Software Engineering","author":"E Giachino","year":"2014","unstructured":"Giachino, E., Lanese, I., Mezzina, C.A.: Causal-consistent reversible debugging. In: Gnesi, S., Rensink, A. (eds.) FASE 2014. LNCS, vol. 8411, pp. 370\u2013384. Springer, Heidelberg (2014). https:\/\/doi.org\/10.1007\/978-3-642-54804-8_26"},{"key":"5_CR30","doi-asserted-by":"crossref","unstructured":"Giacobazzi, R., Mastroeni, I.: Abstract non-interference: a unifying framework for weakening information-flow. ACM Trans. Privacy Secur. 21(2), 9:1\u20139:31 (2018)","DOI":"10.1145\/3175660"},{"key":"5_CR31","doi-asserted-by":"publisher","unstructured":"van Glabbeek, R.J.: A complete axiomatization for branching bisimulation congruence of finite-state behaviours. In: Borzyszkowski, A.M., Soko\u0142owski, S. (eds.) MFCS 1993. LNCS, vol. 711, pp. 473\u2013484. Springer, Heidelberg (1993). https:\/\/doi.org\/10.1007\/3-540-57182-5_39","DOI":"10.1007\/3-540-57182-5_39"},{"key":"5_CR32","unstructured":"van Glabbeek, R.J.: The linear time \u2013 branching time spectrum\u00a0I. In: Handbook of Process Algebra, pp. 3\u201399. Elsevier (2001)"},{"key":"5_CR33","doi-asserted-by":"publisher","first-page":"555","DOI":"10.1145\/233551.233556","volume":"43","author":"RJ van Glabbeek","year":"1996","unstructured":"van Glabbeek, R.J., Weijland, W.P.: Branching time and abstraction in bisimulation semantics. J. ACM 43, 555\u2013600 (1996)","journal-title":"J. ACM"},{"key":"5_CR34","doi-asserted-by":"crossref","unstructured":"Goguen, J.A., Meseguer, J.: Security policies and security models. In: Proceeding of the 2nd IEEE Symposium on Security and Privacy (SSP\u00a01982), pp. 11\u201320. IEEE-CS Press (1982)","DOI":"10.1109\/SP.1982.10014"},{"key":"5_CR35","doi-asserted-by":"crossref","unstructured":"G\u00f6tz, N., Herzog, U., Rettelbach, M.: Multiprocessor and distributed systems design: the integration of functional specification and performance analysis using stochastic process algebras. In: Proceeding of the 16th International Symposium on Computer Performance Modelling, Measurement and Evaluation (PERFORMANCE\u00a01993), LNCS, vol.\u00a0729, pp. 121\u2013146. Springer (1993)","DOI":"10.1007\/BFb0013851"},{"key":"5_CR36","doi-asserted-by":"crossref","unstructured":"Hansson, H., Jonsson, B.: A calculus for communicating systems with time and probabilities. In: Proceeding of the 11th IEEE Real-Time Systems Symposium (RTSS\u00a01990), pp. 278\u2013287. IEEE-CS Press (1990)","DOI":"10.1109\/REAL.1990.128759"},{"key":"5_CR37","unstructured":"Hedin, D., Sabelfeld, A.: A perspective on information-flow control. In: Software Safety and Security \u2013 Tools for Analysis and Verification, pp. 319\u2013347. IOS Press (2012)"},{"key":"5_CR38","doi-asserted-by":"crossref","unstructured":"Hermanns, H.: Interactive Markov Chains. Springer (2002), volume 2428 of LNCS","DOI":"10.1007\/3-540-45804-2"},{"key":"5_CR39","unstructured":"Hermanns, H., Rettelbach, M.: Syntax, semantics, equivalences, and axioms for MTIPP. In: Proceeding of the 2nd International Workshop on Process Algebra and Performance Modelling (PAPM\u00a01994), pp. 71\u201387. University of Erlangen, Technical Report\u00a027-4 (1994)"},{"key":"5_CR40","doi-asserted-by":"crossref","unstructured":"Hillston, J.: A Compositional Approach to Performance Modelling. Cambridge University Press (1996)","DOI":"10.1017\/CBO9780511569951"},{"key":"5_CR41","first-page":"1","volume":"181","author":"J Hillston","year":"2021","unstructured":"Hillston, J., Marin, A., Piazza, C., Rossi, S.: Persistent stochastic non-interference. Fund. Inform. 181, 1\u201335 (2021)","journal-title":"Fund. Inform."},{"key":"5_CR42","doi-asserted-by":"publisher","first-page":"371","DOI":"10.1145\/360248.360251","volume":"19","author":"RM Keller","year":"1976","unstructured":"Keller, R.M.: Formal verification of parallel programs. Commun. ACM 19, 371\u2013384 (1976)","journal-title":"Commun. ACM"},{"key":"5_CR43","doi-asserted-by":"publisher","first-page":"183","DOI":"10.1147\/rd.53.0183","volume":"5","author":"R Landauer","year":"1961","unstructured":"Landauer, R.: Irreversibility and heat generation in the computing process. IBM J. Res. Dev. 5, 183\u2013191 (1961)","journal-title":"IBM J. Res. Dev."},{"key":"5_CR44","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"370","DOI":"10.1007\/978-3-642-37036-6_21","volume-title":"Programming Languages and Systems","author":"I Lanese","year":"2013","unstructured":"Lanese, I., Lienhardt, M., Mezzina, C.A., Schmitt, A., Stefani, J.-B.: Concurrent flexible reversibility. In: Felleisen, M., Gardner, P. (eds.) ESOP 2013. LNCS, vol. 7792, pp. 370\u2013390. Springer, Heidelberg (2013). https:\/\/doi.org\/10.1007\/978-3-642-37036-6_21"},{"key":"5_CR45","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"247","DOI":"10.1007\/978-3-319-90686-7_16","volume-title":"Functional and Logic Programming","author":"I Lanese","year":"2018","unstructured":"Lanese, I., Nishida, N., Palacios, A., Vidal, G.: CauDEr: a causal-consistent reversible debugger for erlang. In: Gallagher, J.P., Sulzmann, M. (eds.) FLOPS 2018. LNCS, vol. 10818, pp. 247\u2013263. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-319-90686-7_16"},{"key":"5_CR46","doi-asserted-by":"publisher","first-page":"625","DOI":"10.1017\/S0263574717000613","volume":"36","author":"JS Laursen","year":"2018","unstructured":"Laursen, J.S., Ellekilde, L.P., Schultz, U.P.: Modelling reversible execution of robotic assembly. Robotica 36, 625\u2013654 (2018)","journal-title":"Robotica"},{"key":"5_CR47","doi-asserted-by":"crossref","unstructured":"Mantel, H.: Information flow and noninterference. In: Encyclopedia of Cryptography and Security, pp. 605\u2013607. Springer (2011)","DOI":"10.1007\/978-1-4419-5906-5_874"},{"key":"5_CR48","doi-asserted-by":"publisher","first-page":"1057","DOI":"10.1016\/S0304-3975(02)00596-0","volume":"290","author":"F Martinelli","year":"2003","unstructured":"Martinelli, F.: Analysis of security protocols as open systems. Theoret. Comput. Sci. 290, 1057\u20131106 (2003)","journal-title":"Theoret. Comput. Sci."},{"key":"5_CR49","unstructured":"Milner, R.: Communication and Concurrency. Prentice Hall (1989)"},{"key":"5_CR50","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"401","DOI":"10.1007\/BFb0039073","volume-title":"CONCUR \u201990 Theories of Concurrency: Unification and Extension","author":"F Moller","year":"1990","unstructured":"Moller, F., Tofts, C.: A temporal calculus of communicating systems. In: Baeten, J., Klop, J.W. (eds.) CONCUR 1990. LNCS, vol. 458, pp. 401\u2013415. Springer, Heidelberg (1990). https:\/\/doi.org\/10.1007\/BFb0039073"},{"key":"5_CR51","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"559","DOI":"10.1007\/3-540-55719-9_104","volume-title":"Automata, Languages and Programming","author":"F Moller","year":"1992","unstructured":"Moller, F., Tofts, C.: Behavioural abstraction in TCCS. In: Kuich, W. (ed.) ICALP 1992. LNCS, vol. 623, pp. 559\u2013570. Springer, Heidelberg (1992). https:\/\/doi.org\/10.1007\/3-540-55719-9_104"},{"key":"5_CR52","doi-asserted-by":"publisher","unstructured":"Park, D.: Concurrency and automata on infinite sequences. In: Deussen, P. (ed.) GI-TCS 1981. LNCS, vol. 104, pp. 167\u2013183. Springer, Heidelberg (1981). https:\/\/doi.org\/10.1007\/BFb0017309","DOI":"10.1007\/BFb0017309"},{"key":"5_CR53","doi-asserted-by":"publisher","first-page":"303","DOI":"10.1007\/s10586-013-0277-4","volume":"17","author":"KS Perumalla","year":"2014","unstructured":"Perumalla, K.S., Park, A.J.: Reverse computation for rollback-based fault tolerance in large parallel systems - evaluating the potential gains and systems effects. Clust. Comput. 17, 303\u2013313 (2014)","journal-title":"Clust. Comput."},{"key":"5_CR54","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"334","DOI":"10.1007\/3-540-44618-4_25","volume-title":"CONCUR 2000 \u2014 Concurrency Theory","author":"A Philippou","year":"2000","unstructured":"Philippou, A., Lee, I., Sokolsky, O.: Weak Bisimulation for probabilistic systems. In: Palamidessi, C. (ed.) CONCUR 2000. LNCS, vol. 1877, pp. 334\u2013349. Springer, Heidelberg (2000). https:\/\/doi.org\/10.1007\/3-540-44618-4_25"},{"key":"5_CR55","doi-asserted-by":"publisher","first-page":"70","DOI":"10.1016\/j.jlap.2006.11.002","volume":"73","author":"I Phillips","year":"2007","unstructured":"Phillips, I., Ulidowski, I.: Reversing algebraic process calculi. J. Logic Algebraic Program. 73, 70\u201396 (2007)","journal-title":"J. Logic Algebraic Program."},{"key":"5_CR56","doi-asserted-by":"crossref","unstructured":"Phillips, I., Ulidowski, I., Yuen, S.: A reversible process calculus and the modelling of the ERK signalling pathway. In: Proceeding of the 4th International Workshop on Reversible Computation (RC\u00a02012), LNCS, vol.\u00a07581, pp. 218\u2013232. Springer (2012)","DOI":"10.1007\/978-3-642-36315-3_18"},{"key":"5_CR57","doi-asserted-by":"crossref","unstructured":"Pinna, G.M.: Reversing steps in membrane systems computations. In: Proceeding of the 18th International Conference on Membrane Computing (CMC\u00a02017), LNCS, vol. 10725, pp. 245\u2013261. Springer (2017)","DOI":"10.1007\/978-3-319-73359-3_16"},{"key":"5_CR58","doi-asserted-by":"publisher","first-page":"578","DOI":"10.1093\/comjnl\/38.7.578","volume":"38","author":"C Priami","year":"1995","unstructured":"Priami, C.: Stochastic $$\\pi $$-calculus. Comput. J. 38, 578\u2013589 (1995)","journal-title":"Comput. J."},{"key":"5_CR59","doi-asserted-by":"crossref","unstructured":"Sabelfeld, A., Sands, D.: Probabilistic noninterference for multi-threaded programs. In: Proceeding of the 13th IEEE Computer Security Foundations Workshop (CSFW\u00a02000), pp. 200\u2013214. IEEE-CS Press (2000)","DOI":"10.1109\/CSFW.2000.856937"},{"key":"5_CR60","doi-asserted-by":"crossref","unstructured":"Sangiorgi, D., Milner, R.: The problem of \u201cweak bisimulation up to\u201d. In: Proceeding of the 3rd International Conference on Concurrency Theory (CONCUR\u00a01992), LNCS, vol.\u00a0630, pp. 32\u201346. Springer (1992)","DOI":"10.1007\/BFb0084781"},{"key":"5_CR61","doi-asserted-by":"publisher","first-page":"257","DOI":"10.1007\/s00354-018-0038-2","volume":"36","author":"M Schordan","year":"2018","unstructured":"Schordan, M., Oppelstrup, T., Jefferson, D.R., Barnes, P.D., Jr.: Generation of reversible C++ code for optimistic parallel discrete event simulation. N. Gener. Comput. 36, 257\u2013280 (2018)","journal-title":"N. Gener. Comput."},{"key":"5_CR62","doi-asserted-by":"publisher","first-page":"1427","DOI":"10.1109\/LWC.2019.2920128","volume":"8","author":"H Siljak","year":"2019","unstructured":"Siljak, H., Psara, K., Philippou, A.: Distributed antenna selection for massive MIMO using reversing Petri nets. IEEE Wirel. Commun. Lett. 8, 1427\u20131430 (2019)","journal-title":"IEEE Wirel. Commun. Lett."},{"key":"5_CR63","doi-asserted-by":"crossref","unstructured":"Vassor, M., Stefani, J.B.: Checkpoint\/rollback vs causally-consistent reversibility. In: Proceeding of the 10th International Conference on Reversible Computation (RC\u00a02018), LNCS, vol. 11106, pp. 286\u2013303. Springer (2018)","DOI":"10.1007\/978-3-319-99498-7_20"},{"key":"5_CR64","doi-asserted-by":"crossref","unstructured":"Volpano, D., Smith, G.: Probabilistic noninterference in a concurrent language. In: Proceeding of the 11th IEEE Computer Security Foundations Workshop (CSFW\u00a01998), pp. 34\u201343. IEEE-CS Press (1998)","DOI":"10.1109\/CSFW.1998.683153"},{"key":"5_CR65","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"569","DOI":"10.1007\/978-3-642-15375-4_39","volume-title":"CONCUR 2010 - Concurrency Theory","author":"E de Vries","year":"2010","unstructured":"de Vries, E., Koutavas, V., Hennessy, M.: Communicating transactions. In: Gastin, P., Laroussinie, F. (eds.) CONCUR 2010. LNCS, vol. 6269, pp. 569\u2013583. Springer, Heidelberg (2010). https:\/\/doi.org\/10.1007\/978-3-642-15375-4_39"},{"key":"5_CR66","doi-asserted-by":"publisher","first-page":"356","DOI":"10.1214\/aoap\/1177005428","volume":"3","author":"B Ycart","year":"1993","unstructured":"Ycart, B.: The philosophers\u2019 process: an ergodic reversible nearest particle system. Ann. Appl. Prob. 3, 356\u2013363 (1993)","journal-title":"Ann. Appl. Prob."},{"key":"5_CR67","doi-asserted-by":"crossref","unstructured":"Zheng, L., Myers, A.: Dynamic security labels and noninterference. In: Proceeding of the 2nd IFIP Workshop on Formal Aspects in Security and Trust (FAST\u00a02004), IFIP AICT, vol.\u00a0173, pp. 27\u201340. Springer (2004)","DOI":"10.1007\/0-387-24098-5_3"}],"container-title":["Lecture Notes in Computer Science","Formal Techniques for Distributed Objects, Components, and Systems"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-95497-9_5","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,9,9]],"date-time":"2025-09-09T21:43:45Z","timestamp":1757454225000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-95497-9_5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025]]},"ISBN":["9783031954962","9783031954979"],"references-count":67,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-95497-9_5","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2025]]},"assertion":[{"value":"11 June 2025","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"FORTE","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Formal Techniques for Distributed Objects, Components, and Systems","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Lille","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"France","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2025","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"16 June 2025","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"20 June 2025","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"45","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"forte2025","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/www.discotec.org\/2025\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}