{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,21]],"date-time":"2025-06-21T08:24:37Z","timestamp":1750494277276,"version":"3.40.3"},"publisher-location":"Cham","reference-count":49,"publisher":"Springer Nature Switzerland","isbn-type":[{"type":"print","value":"9783031770180"},{"type":"electronic","value":"9783031770197"}],"license":[{"start":{"date-parts":[[2024,11,22]],"date-time":"2024-11-22T00:00:00Z","timestamp":1732233600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2024,11,22]],"date-time":"2024-11-22T00:00:00Z","timestamp":1732233600000},"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-77019-7_15","type":"book-chapter","created":{"date-parts":[[2024,11,21]],"date-time":"2024-11-21T20:48:23Z","timestamp":1732222103000},"page":"251-271","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Reversibility in\u00a0Process Calculi with\u00a0Nondeterminism and\u00a0Probabilities"],"prefix":"10.1007","author":[{"given":"Marco","family":"Bernardo","sequence":"first","affiliation":[]},{"given":"Claudio A.","family":"Mezzina","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2024,11,22]]},"reference":[{"key":"15_CR1","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. Theor. Comput. Sci. 413, 58\u201372 (2012)","journal-title":"Theor. Comput. Sci."},{"key":"15_CR2","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":"15_CR3","doi-asserted-by":"crossref","unstructured":"Bernardo, M., Esposito, A.: Modal logic characterizations of forward, reverse, and forward-reverse bisimilarities. In: Proceedings of the 14th International Symposium on Games, Automata, Logics, and Formal Verification (GANDALF\u00a02023). EPTCS, vol.\u00a0390, pp. 67\u201381 (2023)","DOI":"10.4204\/EPTCS.390.5"},{"key":"15_CR4","series-title":"LNCS","doi-asserted-by":"publisher","first-page":"270","DOI":"10.1007\/978-3-031-43835-6_19","volume-title":"QEST 2023","author":"M Bernardo","year":"2023","unstructured":"Bernardo, M., Lanese, I., Marin, A., Mezzina, C.A., Rossi, S., Sacerdoti Coen, C.: Causal reversibility implies time reversibility. In: Jansen, N., Tribastone, M. (eds.) QEST 2023. LNCS, vol. 14287, pp. 270\u2013287. Springer, Cham (2023). https:\/\/doi.org\/10.1007\/978-3-031-43835-6_19"},{"key":"15_CR5","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":"15_CR6","series-title":"LNCS","doi-asserted-by":"publisher","first-page":"15","DOI":"10.1007\/978-3-031-42626-1_2","volume-title":"FORMATS 2023","author":"M Bernardo","year":"2023","unstructured":"Bernardo, M., Mezzina, C.A.: Causal reversibility for timed process calculi with lazy\/eager durationless actions and time additivity. In: Petrucci, L., Sproston, J. (eds.) FORMATS 2023. LNCS, vol. 14138, pp. 15\u201332. Springer, Cham (2023). https:\/\/doi.org\/10.1007\/978-3-031-42626-1_2"},{"key":"15_CR7","doi-asserted-by":"publisher","first-page":"187","DOI":"10.1038\/nature10872","volume":"483","author":"A B\u00e9rut","year":"2012","unstructured":"B\u00e9rut, A., Arakelyan, A., Petrosyan, A., Ciliberto, S., Dillenschneider, R., Lutz, E.: Experimental verification of Landauer\u2019s principle linking information and thermodynamics. Nature 483, 187\u2013189 (2012)","journal-title":"Nature"},{"key":"15_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"371","DOI":"10.1007\/3-540-45694-5_25","volume-title":"CONCUR 2002 \u2014 Concurrency Theory","author":"S Cattani","year":"2002","unstructured":"Cattani, S., Segala, R.: Decision algorithms for probabilistic bisimulation. In: Brim, L., K\u0159et\u00ednsk\u00fd, M., Ku\u010dera, A., Jan\u010dar, P. (eds.) CONCUR 2002. LNCS, vol. 2421, pp. 371\u2013386. Springer, Heidelberg (2002). https:\/\/doi.org\/10.1007\/3-540-45694-5_25"},{"key":"15_CR9","doi-asserted-by":"crossref","unstructured":"Chatterjee, K., Goharshady, A.K., Pourdamghani, A.: Probabilistic smart contracts: secure randomness on the blockchain. In: Proceedings of the 1st IEEE International Conference on Blockchain and Cryptocurrency (ICBC\u00a02019), pp. 403\u2013412. IEEE-CS Press (2019)","DOI":"10.1109\/BLOC.2019.8751326"},{"key":"15_CR10","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":"15_CR11","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":"15_CR12","series-title":"LNCS","doi-asserted-by":"publisher","first-page":"152","DOI":"10.1007\/BFb0039058","volume-title":"CONCUR 1990","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":"15_CR13","unstructured":"Derman, C.: Finite State Markovian Decision Processes. Academic Press (1970)"},{"key":"15_CR14","series-title":"LNCS","doi-asserted-by":"publisher","first-page":"57","DOI":"10.1007\/978-3-031-35355-0_5","volume-title":"FORTE 2023","author":"A Esposito","year":"2023","unstructured":"Esposito, A., Aldini, A., Bernardo, M.: Branching bisimulation semantics enables noninterference analysis of reversible systems. In: Huisman, M., Ravara, A. (eds.) FORTE 2023. LNCS, vol. 13910, pp. 57\u201374. Springer, Cham (2023). https:\/\/doi.org\/10.1007\/978-3-031-35355-0_5"},{"key":"15_CR15","series-title":"LNCS","doi-asserted-by":"publisher","first-page":"39","DOI":"10.1007\/978-3-031-62645-6_3","volume-title":"FORTE 2024","author":"A Esposito","year":"2024","unstructured":"Esposito, A., Aldini, A., Bernardo, M.: Noninterference analysis of reversible probabilistic systems. In: Castiglioni, V., Francalanza, A. (eds.) FORTE 2024. LNCS, vol. 14678, pp. 39\u201359. Springer, Cham (2024). https:\/\/doi.org\/10.1007\/978-3-031-62645-6_3"},{"key":"15_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1007\/978-3-319-99498-7_1","volume-title":"Reversible Computation","author":"MP Frank","year":"2018","unstructured":"Frank, M.P.: Physical foundations of Landauer\u2019s principle. In: Kari, J., Ulidowski, I. (eds.) RC 2018. LNCS, vol. 11106, pp. 3\u201333. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-319-99498-7_1"},{"key":"15_CR17","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":"15_CR18","doi-asserted-by":"publisher","first-page":"59","DOI":"10.1006\/inco.1995.1123","volume":"121","author":"RJ van Glabbeek","year":"1995","unstructured":"van Glabbeek, R.J., Smolka, S.A., Steffen, B.: Reactive, generative and stratified models of probabilistic processes. Inf. Comput. 121, 59\u201380 (1995)","journal-title":"Inf. Comput."},{"key":"15_CR19","unstructured":"Hansson, H.: Time and probability in formal design of distributed systems. Ph.D. thesis (1992)"},{"key":"15_CR20","doi-asserted-by":"crossref","unstructured":"Hansson, H., Jonsson, B.: A calculus for communicating systems with time and probabilities. In: Proceedings of the 11th IEEE Real-Time Systems Symposium (RTSS\u00a01990), pp. 278\u2013287. IEEE-CS Press (1990)","DOI":"10.1109\/REAL.1990.128759"},{"key":"15_CR21","doi-asserted-by":"crossref","unstructured":"Hoare, C.A.R.: Communicating Sequential Processes. Prentice Hall (1985)","DOI":"10.1007\/978-3-642-82921-5_4"},{"key":"15_CR22","volume-title":"Reversibility and Stochastic Networks","author":"FP Kelly","year":"1979","unstructured":"Kelly, F.P.: Reversibility and Stochastic Networks. Wiley, Hoboken (1979)"},{"key":"15_CR23","unstructured":"Kemeny, J.G., Snell, J.L.: Finite Markov Chains. Van Nostrand (1960)"},{"key":"15_CR24","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"204","DOI":"10.1007\/978-3-642-36315-3_17","volume-title":"Reversible Computation","author":"J Krivine","year":"2013","unstructured":"Krivine, J.: A verification technique for reversible process algebra. In: Gl\u00fcck, R., Yokoyama, T. (eds.) RC 2012. LNCS, vol. 7581, pp. 204\u2013217. Springer, Heidelberg (2013). https:\/\/doi.org\/10.1007\/978-3-642-36315-3_17"},{"key":"15_CR25","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":"15_CR26","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":"15_CR27","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/s00236-019-00346-6","volume":"58","author":"I Lanese","year":"2021","unstructured":"Lanese, I., Medi\u0107, D., Mezzina, C.A.: Static versus dynamic reversibility in CCS. Acta Informatica 58, 1\u201334 (2021)","journal-title":"Acta Informatica"},{"key":"15_CR28","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":"15_CR29","doi-asserted-by":"crossref","unstructured":"Lanese, I., Phillips, I., Ulidowski, I.: An axiomatic theory for reversible computation. ACM Trans. Comput. Logic 25(2), 11:1\u201311:40 (2024)","DOI":"10.1145\/3648474"},{"key":"15_CR30","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":"15_CR31","doi-asserted-by":"crossref","unstructured":"Lehmann, D., Rabin, M.O.: On the advantage of free choice: A symmetric and fully distributed solution to the dining philosophers problem. In: Proceedings of the 8th ACM Symposium on Principles of Programming Languages (POPL\u00a01981), pp. 133\u2013138. ACM Press (1981)","DOI":"10.1145\/567532.567547"},{"key":"15_CR32","doi-asserted-by":"publisher","first-page":"97","DOI":"10.1016\/0304-3975(76)90009-8","volume":"2","author":"JJ L\u00e9vy","year":"1976","unstructured":"L\u00e9vy, J.J.: An algebraic interpretation of the $$\\lambda \\beta $$K-calculus; and an application of a labelled $$\\lambda $$-calculus. Theor. Comput. Sci. 2, 97\u2013114 (1976)","journal-title":"Theor. Comput. Sci."},{"key":"15_CR33","unstructured":"Milner, R.: Communication and Concurrency. Prentice Hall (1989)"},{"key":"15_CR34","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":"15_CR35","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":"15_CR36","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":"15_CR37","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"218","DOI":"10.1007\/978-3-642-36315-3_18","volume-title":"Reversible Computation","author":"I Phillips","year":"2013","unstructured":"Phillips, I., Ulidowski, I., Yuen, S.: A reversible process calculus and the modelling of the ERK signalling pathway. In: Gl\u00fcck, R., Yokoyama, T. (eds.) RC 2012. LNCS, vol. 7581, pp. 218\u2013232. Springer, Heidelberg (2013). https:\/\/doi.org\/10.1007\/978-3-642-36315-3_18"},{"key":"15_CR38","doi-asserted-by":"publisher","unstructured":"Pinna, G.M.: Reversing steps in membrane systems computations. In: Gheorghe, M., Rozenberg, G., Salomaa, A., Zandron, C. (eds.) CMC 2017. LNCS, vol. 10725, pp. 245\u2013261. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-319-73359-3_16","DOI":"10.1007\/978-3-319-73359-3_16"},{"key":"15_CR39","doi-asserted-by":"crossref","unstructured":"Prabhu, P., Ramalingam, G., Vaswani, K.: Safe programmable speculative parallelism. In: Proceedings of the 31st ACM Conference on Programming Language Design and Implementation (PLDI\u00a02010), pp. 50\u201361. ACM Press (2010)","DOI":"10.1145\/1806596.1806603"},{"key":"15_CR40","doi-asserted-by":"publisher","first-page":"230","DOI":"10.1016\/S0019-9958(63)90290-0","volume":"6","author":"MO Rabin","year":"1963","unstructured":"Rabin, M.O.: Probabilistic automata. Inf. Control 6, 230\u2013245 (1963)","journal-title":"Inf. Control"},{"key":"15_CR41","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":"15_CR42","unstructured":"Segala, R.: Modeling and verification of randomized distributed real-time systems. Ph.D. thesis (1995)"},{"key":"15_CR43","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"481","DOI":"10.1007\/978-3-540-48654-1_35","volume-title":"CONCUR \u201994: Concurrency Theory","author":"R Segala","year":"1994","unstructured":"Segala, R., Lynch, N.: Probabilistic simulations for probabilistic processes. In: Jonsson, B., Parrow, J. (eds.) CONCUR 1994. LNCS, vol. 836, pp. 481\u2013496. Springer, Heidelberg (1994). https:\/\/doi.org\/10.1007\/978-3-540-48654-1_35"},{"key":"15_CR44","doi-asserted-by":"crossref","unstructured":"Segala, R., Turrini, A.: Comparative analysis of bisimulation relations on alternating and non-alternating probabilistic models. In: Proceedings of the 2nd International Conference on the Quantitative Evaluation of Systems (QEST\u00a02005), pp. 44\u201353. IEEE-CS Press (2005)","DOI":"10.1109\/QEST.2005.9"},{"key":"15_CR45","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":"15_CR46","doi-asserted-by":"publisher","first-page":"134","DOI":"10.1016\/j.ic.2015.07.004","volume":"244","author":"A Turrini","year":"2015","unstructured":"Turrini, A., Hermanns, H.: Polynomial time decision algorithms for probabilistic automata. Inf. Comput. 244, 134\u2013171 (2015)","journal-title":"Inf. Comput."},{"key":"15_CR47","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"286","DOI":"10.1007\/978-3-319-99498-7_20","volume-title":"Reversible Computation","author":"M Vassor","year":"2018","unstructured":"Vassor, M., Stefani, J.-B.: Checkpoint\/rollback vs causally-consistent reversibility. In: Kari, J., Ulidowski, I. (eds.) RC 2018. LNCS, vol. 11106, pp. 286\u2013303. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-319-99498-7_20"},{"key":"15_CR48","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":"15_CR49","doi-asserted-by":"crossref","unstructured":"Yokoyama, T., Gl\u00fcck, R.: A reversible programming language and its invertible self-interpreter. In: Proceedings of the 13th ACM Workshop on Partial Evaluation and Semantics-based Program Manipulation (PEPM\u00a02007), pp. 144\u2013153. ACM Press (2007)","DOI":"10.1145\/1244381.1244404"}],"container-title":["Lecture Notes in Computer Science","Theoretical Aspects of Computing \u2013 ICTAC 2024"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-77019-7_15","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,11,21]],"date-time":"2024-11-21T21:30:00Z","timestamp":1732224600000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-77019-7_15"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,11,22]]},"ISBN":["9783031770180","9783031770197"],"references-count":49,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-77019-7_15","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2024,11,22]]},"assertion":[{"value":"22 November 2024","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"ICTAC","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Colloquium on Theoretical Aspects of Computing","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Bangkok","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Thailand","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2024","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"25 November 2024","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"29 November 2024","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"21","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"ictac2024","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/ictac2024.cs.ait.ac.th\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}