{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,19]],"date-time":"2025-09-19T09:36:40Z","timestamp":1758274600209,"version":"3.40.3"},"publisher-location":"Cham","reference-count":24,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783031172434"},{"type":"electronic","value":"9783031172441"}],"license":[{"start":{"date-parts":[[2022,1,1]],"date-time":"2022-01-01T00:00:00Z","timestamp":1640995200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2022,1,1]],"date-time":"2022-01-01T00:00:00Z","timestamp":1640995200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2022]]},"DOI":"10.1007\/978-3-031-17244-1_21","type":"book-chapter","created":{"date-parts":[[2022,10,9]],"date-time":"2022-10-09T19:33:23Z","timestamp":1665344003000},"page":"352-369","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["On Probabilistic Extension of\u00a0the\u00a0Interaction Theory"],"prefix":"10.1007","author":[{"given":"Hongmeng","family":"Wang","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-1328-6197","authenticated-orcid":false,"given":"Huan","family":"Long","sequence":"additional","affiliation":[]},{"given":"Hao","family":"Wu","sequence":"additional","affiliation":[]},{"given":"Qizhe","family":"Yang","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2022,10,10]]},"reference":[{"key":"21_CR1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-662-45198-4","volume-title":"Semantics of Probabilistic Processes: An Operational Approach","author":"Y Deng","year":"2014","unstructured":"Deng, Y.: Semantics of Probabilistic Processes: An Operational Approach. Springer, Heidelberg (2014). https:\/\/doi.org\/10.1007\/978-3-662-45198-4"},{"key":"21_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"166","DOI":"10.1007\/978-3-642-39698-4_11","volume-title":"Theories of Programming and Formal Methods","author":"Y Fu","year":"2013","unstructured":"Fu, Y.: The value-passing calculus. In: Liu, Z., Woodcock, J., Zhu, H. (eds.) Theories of Programming and Formal Methods. LNCS, vol. 8051, pp. 166\u2013195. Springer, Heidelberg (2013). https:\/\/doi.org\/10.1007\/978-3-642-39698-4_11"},{"key":"21_CR3","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.tcs.2015.07.043","volume":"611","author":"Y Fu","year":"2016","unstructured":"Fu, Y.: Theory of interaction. Theor. Comput. Sci. 611, 1\u201349 (2016)","journal-title":"Theor. Comput. Sci."},{"key":"21_CR4","doi-asserted-by":"publisher","first-page":"181","DOI":"10.1016\/j.tcs.2021.04.001","volume":"869","author":"Y Fu","year":"2021","unstructured":"Fu, Y.: Model independent approach to probabilistic models. Theor. Comput. Sci. 869, 181\u2013194 (2021)","journal-title":"Theor. Comput. Sci."},{"key":"21_CR5","doi-asserted-by":"publisher","first-page":"1387","DOI":"10.1016\/j.tcs.2009.11.011","volume":"411","author":"Y Fu","year":"2010","unstructured":"Fu, Y., Lu, H.: On the expressiveness of interaction. Theoret. Comput. Sci. 411, 1387\u20131451 (2010)","journal-title":"Theoret. Comput. Sci."},{"key":"21_CR6","unstructured":"Giacalone, A., Jou, C.C., Smolka, S.A.: Algebraic reasoning for probabilistic concurrent systems. In: Proceeding IFIP TC2 Working Conference on Programming Concepts and Methods. Citeseer (1990)"},{"key":"21_CR7","unstructured":"van Glabbeek, R.: Linear time-branching time spectrum i. In: Handbook of Process Algebra, pp. 3\u201399. North-Holland (2001)"},{"key":"21_CR8","doi-asserted-by":"crossref","unstructured":"van Glabbeek, R.: A theory of encodings and expressiveness (extended abstract). In: Foundations of Software Science and Computation Structures - 21st International Conference, FOSSACS 2018, pp. 183\u2013202 (2018)","DOI":"10.1007\/978-3-319-89366-2_10"},{"issue":"4","key":"21_CR9","first-page":"371","volume":"93","author":"R van Glabbeek","year":"2009","unstructured":"van Glabbeek, R., Luttik, B., Tr\u010dka, N.: Branching bisimilarity with explicit divergence. Fundam. Inf. 93(4), 371\u2013392 (2009)","journal-title":"Fundam. Inf."},{"issue":"3","key":"21_CR10","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(3), 555\u2013600 (1996)","journal-title":"J. ACM"},{"key":"21_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"66","DOI":"10.1007\/3-540-57208-2_6","volume-title":"CONCUR 1993","author":"RJ Glabbeek","year":"1993","unstructured":"Glabbeek, R.J.: The linear time \u2014 branching time spectrum II. In: Best, E. (ed.) CONCUR 1993. LNCS, vol. 715, pp. 66\u201381. Springer, Heidelberg (1993). https:\/\/doi.org\/10.1007\/3-540-57208-2_6"},{"key":"21_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"492","DOI":"10.1007\/978-3-540-85361-9_38","volume-title":"CONCUR 2008 - Concurrency Theory","author":"D Gorla","year":"2008","unstructured":"Gorla, D.: Towards a unified approach to encodability and separation results for process calculi. In: van Breugel, F., Chechik, M. (eds.) CONCUR 2008. LNCS, vol. 5201, pp. 492\u2013507. Springer, Heidelberg (2008). https:\/\/doi.org\/10.1007\/978-3-540-85361-9_38"},{"issue":"4","key":"21_CR13","doi-asserted-by":"publisher","first-page":"639","DOI":"10.1017\/S0960129514000279","volume":"26","author":"D Gorla","year":"2016","unstructured":"Gorla, D., Nestman, U.: Full abstraction for expressiveness: history, myths and facts. Math. Struct. Comput. Sci. 26(4), 639\u2013654 (2016)","journal-title":"Math. Struct. Comput. Sci."},{"key":"21_CR14","doi-asserted-by":"crossref","unstructured":"Hansson, H., Jonsson, B.: A calculus for communicating systems with time and probabilities. In: 1990 Proceedings 11th Real-Time Systems Symposium, pp. 278\u2013287. IEEE (1990)","DOI":"10.1109\/REAL.1990.128759"},{"key":"21_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"146","DOI":"10.1007\/3-540-46432-8_10","volume-title":"Foundations of Software Science and Computation Structures","author":"OM Herescu","year":"2000","unstructured":"Herescu, O.M., Palamidessi, C.: Probabilistic asynchronous $$\\pi $$ Calculus. In: Tiuryn, J. (ed.) FoSSaCS 2000. LNCS, vol. 1784, pp. 146\u2013160. Springer, Heidelberg (2000). https:\/\/doi.org\/10.1007\/3-540-46432-8_10"},{"key":"21_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"183","DOI":"10.1007\/978-3-319-69483-2_11","volume-title":"Dependable Software Engineering. Theories, Tools, and Applications","author":"J Xue","year":"2017","unstructured":"Xue, J., Long, H., Fu, Y.: Remark on some $$\\pi $$ variants. In: Larsen, K.G., Sokolsky, O., Wang, J. (eds.) SETTA 2017. LNCS, vol. 10606, pp. 183\u2013199. Springer, Cham (2017). https:\/\/doi.org\/10.1007\/978-3-319-69483-2_11"},{"issue":"2","key":"21_CR17","doi-asserted-by":"publisher","first-page":"198","DOI":"10.1016\/j.ic.2010.10.001","volume":"209","author":"I Lanese","year":"2011","unstructured":"Lanese, I., P\u00e9rez, J.A., Sangiorgi, D., Schmitt, A.: On the expressiveness and decidability of higher-order process calculi. Inf. Comput. 209(2), 198\u2013226 (2011)","journal-title":"Inf. Comput."},{"issue":"1","key":"21_CR18","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/0890-5401(91)90030-6","volume":"94","author":"KG Larsen","year":"1991","unstructured":"Larsen, K.G., Skou, A.: Bisimulation through probabilistic testing. Inf. Comput. 94(1), 1\u201328 (1991)","journal-title":"Inf. Comput."},{"key":"21_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-10235-3","volume-title":"A Calculus of Communicating Systems","year":"1980","unstructured":"Milner, R. (ed.): A Calculus of Communicating Systems. LNCS, vol. 92. Springer, Heidelberg (1980). https:\/\/doi.org\/10.1007\/3-540-10235-3"},{"issue":"1","key":"21_CR20","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/0890-5401(92)90008-4","volume":"100","author":"R Milner","year":"1992","unstructured":"Milner, R., Parrow, J., Walker, D.: A calculus of mobile processes (parts i and ii). Inf. Comput. 100(1), 1\u201377 (1992)","journal-title":"Inf. Comput."},{"key":"21_CR21","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"152","DOI":"10.1007\/BFb0039058","volume-title":"CONCUR 1990 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":"21_CR22","unstructured":"Sangiorgi, D.: Expressing Mobility in Process Algebras: First-Order and Higher-Order Paradigms. Ph.D. thesis, University of Edinburgh (1992)"},{"issue":"2","key":"21_CR23","first-page":"250","volume":"2","author":"R Segala","year":"1995","unstructured":"Segala, R., Lynch, N.: Probabilistic simulations for probabilistic processes. Nordic J. Comput. 2(2), 250\u2013273 (1995)","journal-title":"Nordic J. Comput."},{"key":"21_CR24","doi-asserted-by":"publisher","unstructured":"Zhang, W., Long, H., Xu, X.: Uniform random process model revisited. In: Proceedings of the 17th Asian Symposium on Programming Languages and Systems (APLAS 2019), pp. 388\u2013404 (2019). https:\/\/doi.org\/10.1007\/978-3-030-34175-6_20","DOI":"10.1007\/978-3-030-34175-6_20"}],"container-title":["Lecture Notes in Computer Science","Formal Methods and Software Engineering"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-17244-1_21","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,1,28]],"date-time":"2023-01-28T12:26:13Z","timestamp":1674908773000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-17244-1_21"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022]]},"ISBN":["9783031172434","9783031172441"],"references-count":24,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-17244-1_21","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2022]]},"assertion":[{"value":"10 October 2022","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"ICFEM","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Formal Engineering Methods","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Madrid","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Spain","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2022","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"24 October 2022","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"27 October 2022","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"23","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"icfem2022","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/maude.ucm.es\/ICFEM22\/index.html","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Single-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"EasyChair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"61","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"23","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"0","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"38% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3 invited papers (two papers and one abstract)","order":10,"name":"additional_info_on_review_process","label":"Additional Info on Review Process","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}