{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T23:58:21Z","timestamp":1743119901713,"version":"3.40.3"},"publisher-location":"Cham","reference-count":25,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030217587"},{"type":"electronic","value":"9783030217594"}],"license":[{"start":{"date-parts":[[2019,1,1]],"date-time":"2019-01-01T00:00:00Z","timestamp":1546300800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2019,1,1]],"date-time":"2019-01-01T00:00:00Z","timestamp":1546300800000},"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":[[2019]]},"DOI":"10.1007\/978-3-030-21759-4_1","type":"book-chapter","created":{"date-parts":[[2019,6,2]],"date-time":"2019-06-02T23:30:20Z","timestamp":1559518220000},"page":"3-20","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Psi-Calculi Revisited: Connectivity and Compositionality"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-6406-7875","authenticated-orcid":false,"given":"Johannes","family":"\u00c5man Pohjola","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2019,5,29]]},"reference":[{"unstructured":"\u00c5man Pohjola, J.: Psi-calculi revisited: connectivity and compositionality. Technical report, EP192416, CSIRO, Canberra, Australia (2019). https:\/\/publications.csiro.au\/rpr\/pub?pid=csiro:EP192416","key":"1_CR1"},{"doi-asserted-by":"publisher","unstructured":"Bengtson, J., Johansson, M., Parrow, J., Victor, B.: Psi-calculi: a framework for mobile processes with nominal data and logic. Logical Methods Comput. Sci. 7(1) (2011). https:\/\/doi.org\/10.2168\/LMCS-7(1:11)2011","key":"1_CR2","DOI":"10.2168\/LMCS-7(1:11)2011"},{"issue":"1","key":"1_CR3","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/s10817-015-9336-2","volume":"56","author":"Jesper Bengtson","year":"2015","unstructured":"Bengtson, J., Parrow, J., Weber, T.: Psi-calculi in Isabelle. J. Autom. Reasoning 56(1), 1\u201347 (2016). https:\/\/doi.org\/10.1007\/s10817-015-9336-2","journal-title":"Journal of Automated Reasoning"},{"doi-asserted-by":"publisher","unstructured":"Berry, G., Boudol, G.: The chemical abstract machine. In: Proceedings of the 17th ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, POPL 1990, pp. 81\u201394. ACM, New York (1990). https:\/\/doi.org\/10.1145\/96709.96717","key":"1_CR4","DOI":"10.1145\/96709.96717"},{"issue":"1","key":"1_CR5","doi-asserted-by":"publisher","first-page":"201","DOI":"10.1007\/s10270-013-0375-z","volume":"14","author":"Johannes Borgstr\u00f6m","year":"2013","unstructured":"Borgstr\u00f6m, J., et al.: Broadcast psi-calculi with an application to wireless protocols. Softw. Syst. Model. 14(1), 201\u2013216 (2015). https:\/\/doi.org\/10.1007\/s10270-013-0375-z","journal-title":"Software & Systems Modeling"},{"key":"1_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"49","DOI":"10.1007\/3-540-59450-7_4","volume-title":"Object-Based Models and Languages for Concurrent Systems","author":"N Busi","year":"1995","unstructured":"Busi, N., Gorrieri, R.: Distributed conflicts in communicating systems. In: Ciancarini, P., Nierstrasz, O., Yonezawa, A. (eds.) ECOOP 1994. LNCS, vol. 924, pp. 49\u201365. Springer, Heidelberg (1995). https:\/\/doi.org\/10.1007\/3-540-59450-7_4"},{"issue":"2","key":"1_CR7","doi-asserted-by":"publisher","first-page":"235","DOI":"10.1016\/0304-3975(92)90014-7","volume":"103","author":"M Felleisen","year":"1992","unstructured":"Felleisen, M., Hieb, R.: The revised report on the syntactic theories of sequential control and state. Theor. Comput. Sci. 103(2), 235\u2013271 (1992). https:\/\/doi.org\/10.1016\/0304-3975(92)90014-7","journal-title":"Theor. Comput. Sci."},{"issue":"3-5","key":"1_CR8","doi-asserted-by":"publisher","first-page":"341","DOI":"10.1007\/s001650200016","volume":"13","author":"Murdoch J. Gabbay","year":"2002","unstructured":"Gabbay, M.J., Pitts, A.M.: A new approach to abstract syntax with variable binding. Formal Aspects Comput. 13, 341\u2013363 (2002). https:\/\/doi.org\/10.1007\/s001650200016","journal-title":"Formal Aspects of Computing"},{"key":"1_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"373","DOI":"10.1007\/3-540-44612-5_33","volume-title":"Mathematical Foundations of Computer Science 2000","author":"P Gardner","year":"2000","unstructured":"Gardner, P., Wischik, L.: Explicit fusions. In: Nielsen, M., Rovan, B. (eds.) MFCS 2000. LNCS, vol. 1893, pp. 373\u2013382. Springer, Heidelberg (2000). https:\/\/doi.org\/10.1007\/3-540-44612-5_33"},{"issue":"9","key":"1_CR10","doi-asserted-by":"publisher","first-page":"1031","DOI":"10.1016\/j.ic.2010.05.002","volume":"208","author":"D Gorla","year":"2010","unstructured":"Gorla, D.: Towards a unified approach to encodability and separation results for process calculi. Inf. Comput. 208(9), 1031\u20131053 (2010). https:\/\/doi.org\/10.1016\/j.ic.2010.05.002","journal-title":"Inf. Comput."},{"doi-asserted-by":"publisher","unstructured":"Hirschkoff, D., Madiot, J., Sangiorgi, D.: Name-passing calculi: from fusions to preorders and types. In: 28th Annual ACM\/IEEE Symposium on Logic in Computer Science, LICS 2013, New Orleans, LA, USA, 25\u201328 June 2013, pp. 378\u2013387. IEEE Computer Society (2013). https:\/\/doi.org\/10.1109\/LICS.2013.44","key":"1_CR11","DOI":"10.1109\/LICS.2013.44"},{"issue":"6","key":"1_CR12","doi-asserted-by":"publisher","first-page":"806","DOI":"10.1016\/j.jlamp.2015.07.001","volume":"84","author":"D Hirschkoff","year":"2015","unstructured":"Hirschkoff, D., Madiot, J., Xu, X.: A behavioural theory for a $$\\pi $$-calculus with preorders. J. Log. Algebr. Meth. Program. 84(6), 806\u2013825 (2015). https:\/\/doi.org\/10.1016\/j.jlamp.2015.07.001","journal-title":"J. Log. Algebr. Meth. Program."},{"key":"1_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"143","DOI":"10.1007\/978-3-319-24644-4_10","volume-title":"Fundamentals of Software Engineering","author":"D Hirschkoff","year":"2015","unstructured":"Hirschkoff, D., Madiot, J.-M., Xu, X.: A behavioural theory for a $$\\pi $$-calculus with preorders. In: Dastani, M., Sirjani, M. (eds.) FSEN 2015. LNCS, vol. 9392, pp. 143\u2013158. Springer, Cham (2015). https:\/\/doi.org\/10.1007\/978-3-319-24644-4_10"},{"unstructured":"Johansson, M.: Psi-calculi: a framework for mobile process calculi: cook your own correct process calculus - just add data and logic. Ph.D. thesis, Uppsala University, Division of Computer Systems (2010)","key":"1_CR14"},{"doi-asserted-by":"publisher","unstructured":"Johansson, M., Bengtson, J., Parrow, J., Victor, B.: Weak equivalences in psi-calculi. In: LICS, pp. 322\u2013331. IEEE Computer Society (2010). https:\/\/doi.org\/10.1109\/LICS.2010.30","key":"1_CR15","DOI":"10.1109\/LICS.2010.30"},{"key":"1_CR16","doi-asserted-by":"publisher","first-page":"25","DOI":"10.4204\/EPTCS.155.4","volume":"155","author":"Dimitrios Kouzapas","year":"2014","unstructured":"Kouzapas, D., Gutkovas, R., Gay, S.J.: Session types for broadcasting. In: Donaldson, A.F., Vasconcelos, V.T. (eds.) Proceedings 7th Workshop on Programming Language Approaches to Concurrency and Communication-cEntric Software, PLACES 2014, Grenoble, France, 12 April 2014. EPTCS, vol. 155, pp. 25\u201331 (2014). https:\/\/doi.org\/10.4204\/EPTCS.155.4","journal-title":"Electronic Proceedings in Theoretical Computer Science"},{"key":"1_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"167","DOI":"10.1007\/BFb0032030","volume-title":"Automata, Languages and Programming","author":"R Milner","year":"1990","unstructured":"Milner, R.: Functions as processes. In: Paterson, M.S. (ed.) ICALP 1990. LNCS, vol. 443, pp. 167\u2013180. Springer, Heidelberg (1990). https:\/\/doi.org\/10.1007\/BFb0032030"},{"issue":"1","key":"1_CR18","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, part I\/II. Inf. Comput. 100(1), 1\u201377 (1992). https:\/\/doi.org\/10.1016\/0890-5401(92)90008-4","journal-title":"Inf. Comput."},{"issue":"1\u20132","key":"1_CR19","doi-asserted-by":"publisher","first-page":"203","DOI":"10.1016\/j.tcs.2006.08.036","volume":"367","author":"S Nanz","year":"2006","unstructured":"Nanz, S., Hankin, C.: A framework for security analysis of mobile wireless networks. Theor. Comput. Sci. 367(1\u20132), 203\u2013227 (2006)","journal-title":"Theor. Comput. Sci."},{"issue":"1","key":"1_CR20","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1006\/inco.2000.2868","volume":"163","author":"U Nestmann","year":"2000","unstructured":"Nestmann, U., Pierce, B.C.: Decoding choice encodings. Inf. Comput. 163(1), 1\u201359 (2000). https:\/\/doi.org\/10.1006\/inco.2000.2868","journal-title":"Inf. Comput."},{"doi-asserted-by":"publisher","unstructured":"Palamidessi, C.: Comparing the expressive power of the synchronous and the asynchronous pi-calculus. In: Lee, P., Henglein, F., Jones, N.D. (eds.) Conference Record of POPL 1997: The 24th ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, Papers Presented at the Symposium, Paris, France, 15\u201317 January 1997, pp. 256\u2013265. ACM Press (1997). https:\/\/doi.org\/10.1145\/263699.263731","key":"1_CR21","DOI":"10.1145\/263699.263731"},{"key":"1_CR22","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"210","DOI":"10.1007\/978-3-642-28729-9_14","volume-title":"Foundations of Software Science and Computational Structures","author":"K Peters","year":"2012","unstructured":"Peters, K., Nestmann, U.: Is it a \u201cgood\u201d encoding of mixed choice? In: Birkedal, L. (ed.) FoSSaCS 2012. LNCS, vol. 7213, pp. 210\u2013224. Springer, Heidelberg (2012). https:\/\/doi.org\/10.1007\/978-3-642-28729-9_14"},{"key":"1_CR23","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"310","DOI":"10.1007\/978-3-642-37036-6_18","volume-title":"Programming Languages and Systems","author":"K Peters","year":"2013","unstructured":"Peters, K., Nestmann, U., Goltz, U.: On distributability in process calculi. In: Felleisen, M., Gardner, P. (eds.) ESOP 2013. LNCS, vol. 7792, pp. 310\u2013329. Springer, Heidelberg (2013). https:\/\/doi.org\/10.1007\/978-3-642-37036-6_18"},{"issue":"4","key":"1_CR24","doi-asserted-by":"publisher","first-page":"327","DOI":"10.1007\/s10817-008-9097-2","volume":"40","author":"C Urban","year":"2008","unstructured":"Urban, C.: Nominal techniques in Isabelle\/HOL. J. Autom. Reason. 40(4), 327\u2013356 (2008). https:\/\/doi.org\/10.1007\/s10817-008-9097-2","journal-title":"J. Autom. Reason."},{"issue":"3","key":"1_CR25","doi-asserted-by":"publisher","first-page":"606","DOI":"10.1016\/j.tcs.2005.03.017","volume":"304","author":"L Wischik","year":"2005","unstructured":"Wischik, L., Gardner, P.: Explicit fusions. Theor. Comput. Sci. 304(3), 606\u2013630 (2005). https:\/\/doi.org\/10.1016\/j.tcs.2005.03.017","journal-title":"Theor. Comput. Sci."}],"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-030-21759-4_1","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,6,3]],"date-time":"2023-06-03T00:02:57Z","timestamp":1685750577000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-21759-4_1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019]]},"ISBN":["9783030217587","9783030217594"],"references-count":25,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-21759-4_1","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2019]]},"assertion":[{"value":"29 May 2019","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":"Copenhagen","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":"2019","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"17 June 2019","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"21 June 2019","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"39","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"forte2019","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/www.discotec.org\/2019\/forte","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":"42","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":"15","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":"3","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":"36% - 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.1","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":"5","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":"This content has been made available to all.","name":"free","label":"Free to read"}]}}