{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,8,17]],"date-time":"2026-08-17T23:25:31Z","timestamp":1787009131201,"version":"build-2736575974"},"publisher-location":"Cham","reference-count":70,"publisher":"Springer Nature Switzerland","isbn-type":[{"value":"9783032057914","type":"print"},{"value":"9783032057921","type":"electronic"}],"license":[{"start":{"date-parts":[[2025,10,2]],"date-time":"2025-10-02T00:00:00Z","timestamp":1759363200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2025,10,2]],"date-time":"2025-10-02T00:00:00Z","timestamp":1759363200000},"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":[[2026]]},"DOI":"10.1007\/978-3-032-05792-1_16","type":"book-chapter","created":{"date-parts":[[2025,10,1]],"date-time":"2025-10-01T10:31:49Z","timestamp":1759314709000},"page":"293-313","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Noninterference Analysis of Deterministically 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,10,2]]},"reference":[{"key":"16_CR1","doi-asserted-by":"publisher","first-page":"513","DOI":"10.1145\/132271.132276","volume":"17","author":"RK Abbott","year":"1992","unstructured":"Abbott, R.K., Garcia-Molina, H.: Scheduling real-time transactions: a performance evaluation. ACM Trans. Database Syst. 17, 513\u2013560 (1992)","journal-title":"ACM Trans. Database Syst."},{"key":"16_CR2","doi-asserted-by":"publisher","first-page":"317","DOI":"10.1007\/s002360050047","volume":"33","author":"L Aceto","year":"1996","unstructured":"Aceto, L., Murphy, D.: Timing and causality in process algebra. Acta Informatica 33, 317\u2013350 (1996)","journal-title":"Acta Informatica"},{"key":"16_CR3","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":"16_CR4","doi-asserted-by":"crossref","unstructured":"Aldini, A., Bernardo, M.: A general framework for nondeterministic, probabilistic, and stochastic noninterference. In: Proc. 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":"16_CR5","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":"16_CR6","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":"16_CR7","doi-asserted-by":"crossref","unstructured":"Baek, H., Lee, J., Lee, Y., Yoon, H.: Preemptive real-time scheduling incorporating security constraint for cyber physical systems. IEICE Trans. Inf. Syst. 99-D, 2121\u20132130 (2016)","DOI":"10.1587\/transinf.2015EDP7493"},{"key":"16_CR8","doi-asserted-by":"publisher","first-page":"142","DOI":"10.1007\/BF01898401","volume":"3","author":"JCM Baeten","year":"1991","unstructured":"Baeten, J.C.M., Bergstra, J.A.: Real time process algebra. Formal Aspects Comput. 3, 142\u2013188 (1991)","journal-title":"Formal Aspects Comput."},{"key":"16_CR9","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":"16_CR10","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":"16_CR11","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":"16_CR12","doi-asserted-by":"crossref","unstructured":"Bernardo, M., Esposito, A., Mezzina, C.A.: Alternative characterizations of hereditary history-preserving bisimilarity via backward ready multisets. In: Proc. of the 28th Int. Conf. on Foundations of Software Science and Computation Structures (FOSSACS\u00a02025). LNCS, vol. 15691, pp. 67\u201387. Springer (2025)","DOI":"10.1007\/978-3-031-90897-2_4"},{"key":"16_CR13","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: Proc. of the 20th Int. Conf. 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":"16_CR14","doi-asserted-by":"crossref","unstructured":"Bernardo, M., Rossi, S.: Reverse bisimilarity vs. forward bisimilarity. In: Proc. of the 26th Int. Conf. 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":"16_CR15","doi-asserted-by":"crossref","unstructured":"Bolognesi, T., Lucidi, F.: LOTOS-like process algebras with urgent or timed interactions. In: Proc. of the 4th Int. Conf. on Formal Description Techniques for Distributed Systems and Communication Protocols (FORTE\u00a01991). IFIP Transactions, vol.\u00a0C-2, pp. 249\u2013264 (1991)","DOI":"10.1016\/B978-0-444-89402-1.50027-8"},{"key":"16_CR16","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.A.R., Roscoe, A.W.: A theory of communicating sequential processes. J. ACM 31, 560\u2013599 (1984)","journal-title":"J. ACM"},{"key":"16_CR17","doi-asserted-by":"publisher","first-page":"735","DOI":"10.1007\/s00236-002-0094-3","volume":"38","author":"F Corradini","year":"2002","unstructured":"Corradini, F., Vogler, W., Jenner, L.: Comparing the worst-case efficiency of asynchronous systems with PAFAS. Acta Informatica 38, 735\u2013792 (2002)","journal-title":"Acta Informatica"},{"key":"16_CR18","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":"16_CR19","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":"16_CR20","doi-asserted-by":"crossref","unstructured":"David, R., Son, S.H.: A secure two phase locking protocol. In: Proc. of the 12th IEEE Symp. on Reliable Distributed Systems (SRDS\u00a01993), pp. 126\u2013135. IEEE-CS Press (1993)","DOI":"10.1109\/RELDIS.1993.393466"},{"key":"16_CR21","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.C.M., Klop, J.W. (eds.) CONCUR 1990. LNCS, vol. 458, pp. 152\u2013165. Springer, Heidelberg (1990). https:\/\/doi.org\/10.1007\/BFb0039058"},{"key":"16_CR22","unstructured":"Engblom, J.: A review of reverse debugging. In: Proc. of the 4th System, Software, SoC and Silicon Debug Conf. (S4D 2012), pp.\u00a01\u20136. IEEE-CS Press (2012)"},{"key":"16_CR23","doi-asserted-by":"crossref","unstructured":"Esposito, A., Aldini, A., Bernardo, M.: Noninterference analysis of reversible probabilistic systems. In: Proc. of the 44th Int. Conf. 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":"16_CR24","doi-asserted-by":"crossref","unstructured":"Esposito, A., Aldini, A., Bernardo, M.: Noninterference analysis of stochastically timed reversible systems. In: Proc. of the 45th Int. Conf. on Formal Techniques for Distributed Objects, Components, and Systems (FORTE\u00a02025). LNCS, vol. 15732, pp. 75\u201395. Springer (2025)","DOI":"10.1007\/978-3-031-95497-9_5"},{"key":"16_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":"16_CR26","doi-asserted-by":"crossref","unstructured":"Focardi, R., Gorrieri, R.: Classification of security properties. In: Proc. of the 1st Int. 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":"16_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":"16_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":"16_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":"16_CR30","doi-asserted-by":"crossref","unstructured":"Giacobazzi, R., Mastroeni, I.: Abstract non-interference: a unifying framework for weakening information-flow. ACM Trans. on Privacy and Security 21(2), 9:1\u20139:31 (2018)","DOI":"10.1145\/3175660"},{"key":"16_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":"16_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":"16_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":"16_CR34","doi-asserted-by":"crossref","unstructured":"Goguen, J.A., Meseguer, J.: Security policies and security models. In: Proc. of the 2nd IEEE Symp. on Security and Privacy (SSP\u00a01982), pp. 11\u201320. IEEE-CS Press (1982)","DOI":"10.1109\/SP.1982.10014"},{"key":"16_CR35","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":"16_CR36","doi-asserted-by":"publisher","first-page":"221","DOI":"10.1006\/inco.1995.1041","volume":"117","author":"M Hennessy","year":"1995","unstructured":"Hennessy, M., Regan, T.: A process algebra for timed systems. Inf. Comput. 117, 221\u2013239 (1995)","journal-title":"Inf. Comput."},{"key":"16_CR37","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":"16_CR38","doi-asserted-by":"crossref","unstructured":"Keefe, T.F., Tsai, W.T., Srivastava, J.: Multilevel secure database concurrency control. In: Proc. of the 6th Int. Conf. on Data Engineering (ICDE\u00a01990), pp. 337\u2013344. IEEE-CS Press (1990)","DOI":"10.1109\/ICDE.1990.113486"},{"key":"16_CR39","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":"16_CR40","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":"16_CR41","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":"16_CR42","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":"16_CR43","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":"16_CR44","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":"16_CR45","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":"16_CR46","unstructured":"Milner, R.: Communication and Concurrency. Prentice Hall (1989)"},{"key":"16_CR47","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.C.M., Klop, J.W. (eds.) CONCUR 1990. LNCS, vol. 458, pp. 401\u2013415. Springer, Heidelberg (1990). https:\/\/doi.org\/10.1007\/BFb0039073"},{"key":"16_CR48","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":"16_CR49","doi-asserted-by":"crossref","unstructured":"Nicollin, X., Sifakis, J.: An overview and synthesis on timed process algebras. In: Proc. of the REX Workshop on Real Time: Theory in Practice. LNCS, vol.\u00a0600, pp. 526\u2013548. Springer (1991)","DOI":"10.1007\/BFb0032006"},{"key":"16_CR50","doi-asserted-by":"publisher","first-page":"131","DOI":"10.1006\/inco.1994.1083","volume":"114","author":"X Nicollin","year":"1994","unstructured":"Nicollin, X., Sifakis, J.: The algebra of timed processes ATP: theory and application. Inf. Comput. 114, 131\u2013178 (1994)","journal-title":"Inf. Comput."},{"key":"16_CR51","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":"16_CR52","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":"16_CR53","doi-asserted-by":"crossref","unstructured":"Phillips, I., Ulidowski, I.: Reversing algebraic process calculi. J. Logic Algebraic Program. 73, 70\u201396 (2007)","DOI":"10.1016\/j.jlap.2006.11.002"},{"key":"16_CR54","doi-asserted-by":"crossref","unstructured":"Phillips, I., Ulidowski, I., Yuen, S.: A reversible process calculus and the modelling of the ERK signalling pathway. In: Proc. of the 4th Int. Workshop on Reversible Computation (RC\u00a02012). LNCS, vol.\u00a07581, pp. 218\u2013232. Springer (2012)","DOI":"10.1007\/978-3-642-36315-3_18"},{"key":"16_CR55","doi-asserted-by":"crossref","unstructured":"Pinna, G.M.: Reversing steps in membrane systems computations. In: Proc. of the 18th Int. Conf. on Membrane Computing (CMC\u00a02017). LNCS, vol. 10725, pp. 245\u2013261. Springer (2017)","DOI":"10.1007\/978-3-319-73359-3_16"},{"key":"16_CR56","doi-asserted-by":"publisher","first-page":"224","DOI":"10.1007\/BF01211556","volume":"5","author":"J Quemada","year":"1993","unstructured":"Quemada, J., Frutos, D., Azcorra, A.: TIC: a timed calculus. Formal Aspects Comput. 5, 224\u2013252 (1993)","journal-title":"Formal Aspects Comput."},{"key":"16_CR57","doi-asserted-by":"publisher","first-page":"249","DOI":"10.1016\/0304-3975(88)90030-8","volume":"58","author":"GM Reed","year":"1988","unstructured":"Reed, G.M., Roscoe, A.W.: A timed model for communicating sequential processes. Theoret. Comput. Sci. 58, 249\u2013261 (1988)","journal-title":"Theoret. Comput. Sci."},{"key":"16_CR58","doi-asserted-by":"crossref","unstructured":"Sabelfeld, A., Sands, D.: Probabilistic noninterference for multi-threaded programs. In: Proc. of the 13th IEEE Computer Security Foundations Workshop (CSFW\u00a02000), pp. 200\u2013214. IEEE-CS Press (2000)","DOI":"10.1109\/CSFW.2000.856937"},{"key":"16_CR59","doi-asserted-by":"crossref","unstructured":"Sangiorgi, D., Milner, R.: The problem of \u201cweak bisimulation up to\u201d. In: Proc. of the 3rd Int. Conf. on Concurrency Theory (CONCUR\u00a01992). LNCS, vol.\u00a0630, pp. 32\u201346. Springer (1992)","DOI":"10.1007\/BFb0084781"},{"key":"16_CR60","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":"16_CR61","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 Wireless Commun. Lett. 8, 1427\u20131430 (2019)","journal-title":"IEEE Wireless Commun. Lett."},{"key":"16_CR62","doi-asserted-by":"publisher","first-page":"865","DOI":"10.1109\/69.895799","volume":"12","author":"SH Son","year":"2000","unstructured":"Son, S.H., Mukkamala, R., David, R.: Integrating security and real-time requirements using covert channel capacity. IEEE Trans. on Knowledge Data Eng. 12, 865\u2013879 (2000)","journal-title":"IEEE Trans. on Knowledge Data Eng."},{"key":"16_CR63","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"524","DOI":"10.1007\/BFb0000494","volume-title":"Algebraic Methodology and Software Technology","author":"I Ulidowski","year":"1997","unstructured":"Ulidowski, I., Yuen, S.: Extending process languages with time. In: Johnson, M. (ed.) AMAST 1997. LNCS, vol. 1349, pp. 524\u2013538. Springer, Heidelberg (1997). https:\/\/doi.org\/10.1007\/BFb0000494"},{"key":"16_CR64","doi-asserted-by":"crossref","unstructured":"Vassor, M., Stefani, J.B.: Checkpoint\/rollback vs causally-consistent reversibility. In: Proc. of the 10th Int. Conf. on Reversible Computation (RC\u00a02018). LNCS, vol. 11106, pp. 286\u2013303. Springer (2018)","DOI":"10.1007\/978-3-319-99498-7_20"},{"key":"16_CR65","doi-asserted-by":"crossref","unstructured":"Volpano, D., Smith, G.: Probabilistic noninterference in a concurrent language. In: Proc. of the 11th IEEE Computer Security Foundations Workshop (CSFW\u00a01998), pp. 34\u201343. IEEE-CS Press (1998)","DOI":"10.1109\/CSFW.1998.683153"},{"key":"16_CR66","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 Vries","year":"2010","unstructured":"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":"16_CR67","doi-asserted-by":"crossref","unstructured":"Xie, T., Qin, X.: Improving security for periodic tasks in embedded systems through scheduling. ACM Trans. in Embedded Comput. Syst. 6(3), 20:1\u201320:19 (2007)","DOI":"10.1145\/1275986.1275992"},{"key":"16_CR68","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. Probability 3, 356\u2013363 (1993)","journal-title":"Ann. Appl. Probability"},{"key":"16_CR69","doi-asserted-by":"crossref","unstructured":"Yi, W.: CCS + time = an interleaving model for real time systems. In: Proc. of the 18th Int. Coll. on Automata, Languages and Programming (ICALP\u00a01991). LNCS, vol.\u00a0510, pp. 217\u2013228. Springer (1991)","DOI":"10.1007\/3-540-54233-7_136"},{"key":"16_CR70","doi-asserted-by":"crossref","unstructured":"Zheng, L., Myers, A.: Dynamic security labels and noninterference. In: Proc. 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","Quantitative Evaluation of Systems and Formal Modeling and Analysis of Timed Systems"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-032-05792-1_16","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,8,17]],"date-time":"2026-08-17T22:38:47Z","timestamp":1787006327000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-032-05792-1_16"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,10,2]]},"ISBN":["9783032057914","9783032057921"],"references-count":70,"URL":"https:\/\/doi.org\/10.1007\/978-3-032-05792-1_16","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2025,10,2]]},"assertion":[{"value":"2 October 2025","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"QEST+FORMATS","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Quantitative Evaluation of Systems and Formal Modeling and Analysis of Timed Systems","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Aarhus","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Denmark","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":"26 August 2025","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"28 August 2025","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"qest2025","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/www.qest-formats.org\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}