<bibliography>
 <citation type="inproceedings" key="DBLP:conf/lics/AbdullaAA16">
  <author>Parosh Aziz <surname>Abdulla</surname></author>
  <author>C. <surname>Aiswarya</surname></author>
  <author>Mohamed Faouzi <surname>Atig</surname></author>
  <year>2016</year>
  <title>Data Communicating Processes with Unreliable Channels</title>
  <editor>Martin <surname>Grohe</surname></editor>
  <editor>Eric <surname>Koskinen</surname></editor>
  <editor>Natarajan <surname>Shankar</surname></editor>
  <booktitle>Proceedings of the 31st Annual ACM/IEEE Symposium on Logic in Computer Science, LICS '16, New York, NY, USA, July 5-8, 2016</booktitle>
  <publisher>ACM</publisher>
  <pages>166&#8211;175</pages>
  <doi>10.1145/2933575.2934535</doi>
 </citation>
 <citation type="inproceedings" key="DBLP:conf/cav/AbdullaBJ98">
  <author>Parosh Aziz <surname>Abdulla</surname></author>
  <author>Ahmed <surname>Bouajjani</surname></author>
  <author>Bengt <surname>Jonsson</surname></author>
  <year>1998</year>
  <title>On-the-Fly Analysis of Systems with Unbounded, Lossy FIFO Channels</title>
  <editor>Alan J. <surname>Hu</surname></editor>
  <editor>Moshe Y. <surname>Vardi</surname></editor>
  <booktitle>Computer Aided Verification, 10th International Conference, CAV'98, Vancouver, BC, Canada, June 28 - July 2, 1998, Proceedings</booktitle>
  <series>Lecture Notes in Computer Science</series>
  <volume>1427</volume>
  <publisher>Springer</publisher>
  <pages>305&#8211;318</pages>
  <doi>10.1007/BFb0028754</doi>
 </citation>
 <citation type="inproceedings" key="DBLP:conf/atva/AiswaryaGK14">
  <author>C. <surname>Aiswarya</surname></author>
  <author>Paul <surname>Gastin</surname></author>
  <author>K. Narayan <surname>Kumar</surname></author>
  <year>2014</year>
  <title>Verifying Communicating Multi-pushdown Systems via Split-Width</title>
  <editor>Franck <surname>Cassez</surname></editor>
  <editor>Jean-Fran&#x00e7;ois <surname>Raskin</surname></editor>
  <booktitle>Automated Technology for Verification and Analysis - 12th International Symposium, ATVA 2014, Sydney, NSW, Australia, November 3-7, 2014, Proceedings</booktitle>
  <series>Lecture Notes in Computer Science</series>
  <volume>8837</volume>
  <publisher>Springer</publisher>
  <pages>1&#8211;17</pages>
  <doi>10.1007/978-3-319-11936-6_1</doi>
 </citation>
 <citation type="article" key="DBLP:journals/tse/AlurEY03">
  <author>Rajeev <surname>Alur</surname></author>
  <author>Kousha <surname>Etessami</surname></author>
  <author>Mihalis <surname>Yannakakis</surname></author>
  <year>2003</year>
  <title>Inference of Message Sequence Charts</title>
  <journal>IEEE Trans. Software Eng.</journal>
  <volume>29</volume>
  <number>7</number>
  <pages>623&#8211;633</pages>
  <doi>10.1109/TSE.2003.1214326</doi>
 </citation>
 <citation type="article" key="DBLP:journals/tcs/AlurEY05">
  <author>Rajeev <surname>Alur</surname></author>
  <author>Kousha <surname>Etessami</surname></author>
  <author>Mihalis <surname>Yannakakis</surname></author>
  <year>2005</year>
  <title>Realizability and verification of MSC graphs</title>
  <journal>Theor. Comput. Sci.</journal>
  <volume>331</volume>
  <number>1</number>
  <pages>97&#8211;114</pages>
  <doi>10.1016/j.tcs.2004.09.034</doi>
 </citation>
 <citation type="inproceedings" key="DBLP:conf/concur/AlurY99">
  <author>Rajeev <surname>Alur</surname></author>
  <author>Mihalis <surname>Yannakakis</surname></author>
  <year>1999</year>
  <title>Model Checking of Message Sequence Charts</title>
  <editor>Jos C. M. <surname>Baeten</surname></editor>
  <editor>Sjouke <surname>Mauw</surname></editor>
  <booktitle>CONCUR '99: Concurrency Theory, 10th International Conference, Eindhoven, The Netherlands, August 24-27, 1999, Proceedings</booktitle>
  <series>Lecture Notes in Computer Science</series>
  <volume>1664</volume>
  <publisher>Springer</publisher>
  <pages>114&#8211;129</pages>
  <doi>10.1007/3-540-48320-9_10</doi>
 </citation>
 <citation type="inproceedings" key="DBLP:conf/coordination/BarbaneraLT20">
  <author>Franco <surname>Barbanera</surname></author>
  <author>Ivan <surname>Lanese</surname></author>
  <author>Emilio <surname>Tuosto</surname></author>
  <year>2020</year>
  <title>Choreography Automata</title>
  <editor>Simon <surname>Bliudze</surname></editor>
  <editor>Laura <surname>Bocchi</surname></editor>
  <booktitle>Coordination Models and Languages - 22nd IFIP WG 6.1 International Conference, COORDINATION 2020, Held as Part of the 15th International Federated Conference on Distributed Computing Techniques, DisCoTec 2020, Valletta, Malta, June 15-19, 2020, Proceedings</booktitle>
  <series>Lecture Notes in Computer Science</series>
  <volume>12134</volume>
  <publisher>Springer</publisher>
  <pages>86&#8211;106</pages>
  <doi>10.1007/978-3-030-50029-0_6</doi>
 </citation>
 <citation type="inproceedings" key="DBLP:conf/tacas/Ben-AbdallahL97">
  <author>Han&#234;ne <surname>Ben-Abdallah</surname></author>
  <author>Stefan <surname>Leue</surname></author>
  <year>1997</year>
  <title>Syntactic Detection of Process Divergence and Non-local Choice inMessage Sequence Charts</title>
  <editor>Ed <surname>Brinksma</surname></editor>
  <booktitle>Tools and Algorithms for Construction and Analysis of Systems, Third International Workshop, TACAS '97, Enschede, The Netherlands, April 2-4, 1997, Proceedings</booktitle>
  <series>Lecture Notes in Computer Science</series>
  <volume>1217</volume>
  <publisher>Springer</publisher>
  <pages>259&#8211;274</pages>
  <doi>10.1007/BFb0035393</doi>
 </citation>
 <citation type="inproceedings" key="DBLP:conf/sas/BoigelotGWW97">
  <author>Bernard <surname>Boigelot</surname></author>
  <author>Patrice <surname>Godefroid</surname></author>
  <author>Bernard <surname>Willems</surname></author>
  <author>Pierre <surname>Wolper</surname></author>
  <year>1997</year>
  <title>The Power of QDDs (Extended Abstract)</title>
  <editor>Pascal Van <surname>Hentenryck</surname></editor>
  <booktitle>Static Analysis, 4th International Symposium, SAS '97, Paris, France, September 8-10, 1997, Proceedings</booktitle>
  <series>Lecture Notes in Computer Science</series>
  <volume>1302</volume>
  <publisher>Springer</publisher>
  <pages>172&#8211;186</pages>
  <doi>10.1007/BFb0032741</doi>
 </citation>
 <citation type="inproceedings" key="DBLP:conf/concur/BolligFS20">
  <author>Benedikt <surname>Bollig</surname></author>
  <author>Alain <surname>Finkel</surname></author>
  <author>Amrita <surname>Suresh</surname></author>
  <year>2020</year>
  <title>Bounded Reachability Problems Are Decidable in FIFO Machines</title>
  <editor>Igor <surname>Konnov</surname></editor>
  <editor>Laura <surname>Kov&#225;cs</surname></editor>
  <booktitle>31st International Conference on Concurrency Theory, CONCUR 2020, September 1-4, 2020, Vienna, Austria (Virtual Conference)</booktitle>
  <series>LIPIcs</series>
  <volume>171</volume>
  <publisher>Schloss Dagstuhl - Leibniz-Zentrum f&#252;r Informatik</publisher>
  <pages>49:1&#8211;49:17</pages>
  <doi>10.4230/LIPIcs.CONCUR.2020.49</doi>
 </citation>
 <citation type="article" key="DBLP:journals/corr/abs-1904-06942">
  <author>Benedikt <surname>Bollig</surname></author>
  <author>Paul <surname>Gastin</surname></author>
  <year>2019</year>
  <title>Non-Sequential Theory of Distributed Systems</title>
  <journal>CoRR</journal>
  <volume>abs/1904.06942</volume>
  <doi>10.48550/arXiv.1904.06942</doi>
  <eprint>1904.06942</eprint>
 </citation>
 <citation type="inproceedings" key="DBLP:conf/concur/BolligGFLLS21">
  <author>Benedikt <surname>Bollig</surname></author>
  <author>Cinzia Di <surname>Giusto</surname></author>
  <author>Alain <surname>Finkel</surname></author>
  <author>Laetitia <surname>Laversa</surname></author>
  <author>&#201;tienne <surname>Lozes</surname></author>
  <author>Amrita <surname>Suresh</surname></author>
  <year>2021</year>
  <title>A Unifying Framework for Deciding Synchronizability</title>
  <editor>Serge <surname>Haddad</surname></editor>
  <editor>Daniele <surname>Varacca</surname></editor>
  <booktitle>32nd International Conference on Concurrency Theory, CONCUR 2021, August 24-27, 2021, Virtual Conference</booktitle>
  <series>LIPIcs</series>
  <volume>203</volume>
  <publisher>Schloss Dagstuhl - Leibniz-Zentrum f&#252;r Informatik</publisher>
  <pages>14:1&#8211;14:18</pages>
  <doi>10.4230/LIPIcs.CONCUR.2021.14</doi>
 </citation>
 <citation type="inproceedings" key="DBLP:conf/cav/BouajjaniEJQ18">
  <author>Ahmed <surname>Bouajjani</surname></author>
  <author>Constantin <surname>Enea</surname></author>
  <author>Kailiang <surname>Ji</surname></author>
  <author>Shaz <surname>Qadeer</surname></author>
  <year>2018</year>
  <title>On the Completeness of Verifying Message Passing Programs Under Bounded Asynchrony</title>
  <editor>Hana <surname>Chockler</surname></editor>
  <editor>Georg <surname>Weissenbacher</surname></editor>
  <booktitle>Computer Aided Verification - 30th International Conference, CAV 2018, Held as Part of the Federated Logic Conference, FloC 2018, Oxford, UK, July 14-17, 2018, Proceedings, Part II</booktitle>
  <series>Lecture Notes in Computer Science</series>
  <volume>10982</volume>
  <publisher>Springer</publisher>
  <pages>372&#8211;391</pages>
  <doi>10.1007/978-3-319-96142-2_23</doi>
 </citation>
 <citation type="article" key="DBLP:journals/jacm/BrandZ83">
  <author>Daniel <surname>Brand</surname></author>
  <author>Pitro <surname>Zafiropulo</surname></author>
  <year>1983</year>
  <title>On Communicating Finite-State Machines</title>
  <journal>J. ACM</journal>
  <volume>30</volume>
  <number>2</number>
  <pages>323&#8211;342</pages>
  <doi>10.1145/322374.322380</doi>
 </citation>
 <citation type="inproceedings" key="Carbone2005ATB">
  <author>Marco <surname>Carbone</surname></author>
  <author>Kohei <surname>Honda</surname></author>
  <author>N. <surname>Yoshida</surname></author>
  <author>R. <surname>Milner</surname></author>
  <author>G. <surname>Brown</surname></author>
  <author>Steve <surname>Ross-Talbot</surname></author>
  <year>2005</year>
  <title>A Theoretical Basis of Communication-Centred Concurrent Programming</title>
 </citation>
 <citation type="article" key="DBLP:journals/corr/abs-1203-0780">
  <author>Giuseppe <surname>Castagna</surname></author>
  <author>Mariangiola <surname>Dezani-Ciancaglini</surname></author>
  <author>Luca <surname>Padovani</surname></author>
  <year>2012</year>
  <title>On Global Types and Multi-Party Session</title>
  <journal>Log. Methods Comput. Sci.</journal>
  <volume>8</volume>
  <number>1</number>
  <doi>10.2168/LMCS-8(1:24)2012</doi>
 </citation>
 <citation type="article" key="DBLP:journals/iandc/CeceF05">
  <author>G&#233;rard <surname>C&#233;c&#233;</surname></author>
  <author>Alain <surname>Finkel</surname></author>
  <year>2005</year>
  <title>Verification of programs with half-duplex communication</title>
  <journal>Inf. Comput.</journal>
  <volume>202</volume>
  <number>2</number>
  <pages>166&#8211;190</pages>
  <doi>10.1016/j.ic.2005.05.006</doi>
 </citation>
 <citation type="inproceedings" key="DBLP:conf/sefm/DanHC10">
  <author>Haitao <surname>Dan</surname></author>
  <author>Robert M. <surname>Hierons</surname></author>
  <author>Steve <surname>Counsell</surname></author>
  <year>2010</year>
  <title>Non-local Choice and Implied Scenarios</title>
  <editor>Jos&#233; Luiz <surname>Fiadeiro</surname></editor>
  <editor>Stefania <surname>Gnesi</surname></editor>
  <editor>Andrea <surname>Maggiolo-Schettini</surname></editor>
  <booktitle>8th IEEE International Conference on Software Engineering and Formal Methods, SEFM 2010, Pisa, Italy, 13-18 September 2010</booktitle>
  <publisher>IEEE Computer Society</publisher>
  <pages>53&#8211;62</pages>
  <doi>10.1109/SEFM.2010.14</doi>
 </citation>
 <citation type="inproceedings" key="DBLP:conf/esop/DenielouY12">
  <author>Pierre-Malo <surname>Deni&#233;lou</surname></author>
  <author>Nobuko <surname>Yoshida</surname></author>
  <year>2012</year>
  <title>Multiparty Session Types Meet Communicating Automata</title>
  <editor>Helmut <surname>Seidl</surname></editor>
  <booktitle>Programming Languages and Systems - 21st European Symposium on Programming, ESOP 2012, Held as Part of the European Joint Conferences on Theory and Practice of Software, ETAPS 2012, Tallinn, Estonia, March 24 - April 1, 2012. Proceedings</booktitle>
  <series>Lecture Notes in Computer Science</series>
  <volume>7211</volume>
  <publisher>Springer</publisher>
  <pages>194&#8211;213</pages>
  <doi>10.1007/978-3-642-28869-2_10</doi>
 </citation>
 <citation type="inproceedings" key="DBLP:conf/eurosys/FahndrichAHHHLL06">
  <author>Manuel <surname>F&#228;hndrich</surname></author>
  <author>Mark <surname>Aiken</surname></author>
  <author>Chris <surname>Hawblitzel</surname></author>
  <author>Orion <surname>Hodson</surname></author>
  <author>Galen C. <surname>Hunt</surname></author>
  <author>James R. <surname>Larus</surname></author>
  <author>Steven <surname>Levi</surname></author>
  <year>2006</year>
  <title>Language support for fast and reliable message-based communication in singularity OS</title>
  <editor>Yolande <surname>Berbers</surname></editor>
  <editor>Willy <surname>Zwaenepoel</surname></editor>
  <booktitle>Proceedings of the 2006 EuroSys Conference, Leuven, Belgium, April 18-21, 2006</booktitle>
  <publisher>ACM</publisher>
  <pages>177&#8211;190</pages>
  <doi>10.1145/1217935.1217953</doi>
 </citation>
 <citation type="inproceedings" key="DBLP:conf/icalp/FinkelL17">
  <author>Alain <surname>Finkel</surname></author>
  <author>&#201;tienne <surname>Lozes</surname></author>
  <year>2017</year>
  <title>Synchronizability of Communicating Finite State Machines is not Decidable</title>
  <editor>Ioannis <surname>Chatzigiannakis</surname></editor>
  <editor>Piotr <surname>Indyk</surname></editor>
  <editor>Fabian <surname>Kuhn</surname></editor>
  <editor>Anca <surname>Muscholl</surname></editor>
  <booktitle>44th International Colloquium on Automata, Languages, and Programming, ICALP 2017, July 10-14, 2017, Warsaw, Poland</booktitle>
  <series>LIPIcs</series>
  <volume>80</volume>
  <publisher>Schloss Dagstuhl - Leibniz-Zentrum f&#252;r Informatik</publisher>
  <pages>122:1&#8211;122:14</pages>
  <doi>10.4230/LIPIcs.ICALP.2017.122</doi>
 </citation>
 <citation type="article" key="DBLP:journals/jfp/GayV10">
  <author>Simon J. <surname>Gay</surname></author>
  <author>Vasco Thudichum <surname>Vasconcelos</surname></author>
  <year>2010</year>
  <title>Linear type theory for asynchronous session types</title>
  <journal>J. Funct. Program.</journal>
  <volume>20</volume>
  <number>1</number>
  <pages>19&#8211;50</pages>
  <doi>10.1017/S0956796809990268</doi>
 </citation>
 <citation type="inproceedings" key="DBLP:conf/concur/GazagnaireGHTY07">
  <author>Thomas <surname>Gazagnaire</surname></author>
  <author>Blaise <surname>Genest</surname></author>
  <author>Lo&#239;c <surname>H&#233;lou&#235;t</surname></author>
  <author>P. S. <surname>Thiagarajan</surname></author>
  <author>Shaofa <surname>Yang</surname></author>
  <year>2007</year>
  <title>Causal Message Sequence Charts</title>
  <editor>Lu&#237;s <surname>Caires</surname></editor>
  <editor>Vasco Thudichum <surname>Vasconcelos</surname></editor>
  <booktitle>CONCUR 2007 - Concurrency Theory, 18th International Conference, CONCUR 2007, Lisbon, Portugal, September 3-8, 2007, Proceedings</booktitle>
  <series>Lecture Notes in Computer Science</series>
  <volume>4703</volume>
  <publisher>Springer</publisher>
  <pages>166&#8211;180</pages>
  <doi>10.1007/978-3-540-74407-8_12</doi>
 </citation>
 <citation type="article" key="DBLP:journals/fuin/GenestKM07">
  <author>Blaise <surname>Genest</surname></author>
  <author>Dietrich <surname>Kuske</surname></author>
  <author>Anca <surname>Muscholl</surname></author>
  <year>2007</year>
  <title>On Communicating Automata with Bounded Channels</title>
  <journal>Fundam. Inform.</journal>
  <volume>80</volume>
  <number>1-3</number>
  <pages>147&#8211;167</pages>
  <url>http://content.iospress.com/articles/fundamenta-informaticae/fi80-1-3-09</url>
 </citation>
 <citation type="inproceedings" key="DBLP:conf/acsd/GenestM05">
  <author>Blaise <surname>Genest</surname></author>
  <author>Anca <surname>Muscholl</surname></author>
  <year>2005</year>
  <title>Message Sequence Charts: A Survey</title>
  <booktitle>Fifth International Conference on Application of Concurrency to System Design (ACSD 2005), 6-9 June 2005, St. Malo, France</booktitle>
  <publisher>IEEE Computer Society</publisher>
  <pages>2&#8211;4</pages>
  <doi>10.1109/ACSD.2005.25</doi>
 </citation>
 <citation type="inproceedings" key="DBLP:conf/ac/GenestMP03">
  <author>Blaise <surname>Genest</surname></author>
  <author>Anca <surname>Muscholl</surname></author>
  <author>Doron A. <surname>Peled</surname></author>
  <year>2003</year>
  <title>Message Sequence Charts</title>
  <editor>J&#246;rg <surname>Desel</surname></editor>
  <editor>Wolfgang <surname>Reisig</surname></editor>
  <editor>Grzegorz <surname>Rozenberg</surname></editor>
  <booktitle>Lectures on Concurrency and Petri Nets, Advances in Petri Nets [This tutorial volume originates from the 4th Advanced Course on Petri Nets, ACPN 2003, held in Eichst&#228;tt, Germany in September 2003. In addition to lectures given at ACPN 2003, additional chapters have been commissioned]</booktitle>
  <series>Lecture Notes in Computer Science</series>
  <volume>3098</volume>
  <publisher>Springer</publisher>
  <pages>537&#8211;558</pages>
  <doi>10.1007/978-3-540-27755-2_15</doi>
 </citation>
 <citation type="article" key="DBLP:journals/jcss/GenestMSZ06">
  <author>Blaise <surname>Genest</surname></author>
  <author>Anca <surname>Muscholl</surname></author>
  <author>Helmut <surname>Seidl</surname></author>
  <author>Marc <surname>Zeitoun</surname></author>
  <year>2006</year>
  <title>Infinite-state high-level MSCs: Model-checking and realizability</title>
  <journal>J. Comput. Syst. Sci.</journal>
  <volume>72</volume>
  <number>4</number>
  <pages>617&#8211;647</pages>
  <doi>10.1016/j.jcss.2005.09.007</doi>
 </citation>
 <citation type="inproceedings" key="DBLP:conf/fossacs/GiustoLL20">
  <author>Cinzia Di <surname>Giusto</surname></author>
  <author>Laetitia <surname>Laversa</surname></author>
  <author>&#201;tienne <surname>Lozes</surname></author>
  <year>2020</year>
  <title>On the k-synchronizability of Systems</title>
  <editor>Jean <surname>Goubault-Larrecq</surname></editor>
  <editor>Barbara <surname>K&#246;nig</surname></editor>
  <booktitle>Foundations of Software Science and Computation Structures - 23rd International Conference, FOSSACS 2020, Held as Part of the European Joint Conferences on Theory and Practice of Software, ETAPS 2020, Dublin, Ireland, April 25-30, 2020, Proceedings</booktitle>
  <series>Lecture Notes in Computer Science</series>
  <volume>12077</volume>
  <publisher>Springer</publisher>
  <pages>157&#8211;176</pages>
  <doi>10.1007/978-3-030-45231-5_9</doi>
 </citation>
 <citation type="inproceedings" key="NO-DBLP-wrong-local-choice">
  <author>Lo&#239;c <surname>H&#233;lou&#235;t</surname></author>
  <author>Claude <surname>Jard</surname></author>
  <year>2000</year>
  <title>Conditions for synthesis of communicating automata from HMSCs</title>
  <booktitle>In 5th International Workshop on Formal Methods for Industrial Critical Systems (FMICS)</booktitle>
 </citation>
 <citation type="article" key="DBLP:journals/corr/abs-1209-0359">
  <author>Alexander <surname>Heu&#223;ner</surname></author>
  <author>J&#233;r&#244;me <surname>Leroux</surname></author>
  <author>Anca <surname>Muscholl</surname></author>
  <author>Gr&#233;goire <surname>Sutre</surname></author>
  <year>2012</year>
  <title>Reachability Analysis of Communicating Pushdown Systems</title>
  <journal>Log. Methods Comput. Sci.</journal>
  <volume>8</volume>
  <number>3</number>
  <doi>10.2168/LMCS-8(3:23)2012</doi>
 </citation>
 <citation type="inproceedings" key="DBLP:conf/concur/Honda93">
  <author>Kohei <surname>Honda</surname></author>
  <year>1993</year>
  <title>Types for Dyadic Interaction</title>
  <editor>Eike <surname>Best</surname></editor>
  <booktitle>CONCUR '93, 4th International Conference on Concurrency Theory, Hildesheim, Germany, August 23-26, 1993, Proceedings</booktitle>
  <series>Lecture Notes in Computer Science</series>
  <volume>715</volume>
  <publisher>Springer</publisher>
  <pages>509&#8211;523</pages>
  <doi>10.1007/3-540-57208-2_35</doi>
 </citation>
 <citation type="inproceedings" key="DBLP:conf/popl/HondaYC08">
  <author>Kohei <surname>Honda</surname></author>
  <author>Nobuko <surname>Yoshida</surname></author>
  <author>Marco <surname>Carbone</surname></author>
  <year>2008</year>
  <title>Multiparty asynchronous session types</title>
  <editor>George C. <surname>Necula</surname></editor>
  <editor>Philip <surname>Wadler</surname></editor>
  <booktitle>Proceedings of the 35th ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, POPL 2008, San Francisco, California, USA, January 7-12, 2008</booktitle>
  <publisher>ACM</publisher>
  <pages>273&#8211;284</pages>
  <doi>10.1145/1328438.1328472</doi>
 </citation>
 <citation type="article" key="DBLP:journals/jacm/HondaYC16">
  <author>Kohei <surname>Honda</surname></author>
  <author>Nobuko <surname>Yoshida</surname></author>
  <author>Marco <surname>Carbone</surname></author>
  <year>2016</year>
  <title>Multiparty Asynchronous Session Types</title>
  <journal>J. ACM</journal>
  <volume>63</volume>
  <number>1</number>
  <pages>9:1&#8211;9:67</pages>
  <doi>10.1145/2827695</doi>
 </citation>
 <citation type="article" key="DBLP:journals/mst/Kocher21">
  <author>Chris <surname>K&#246;cher</surname></author>
  <year>2021</year>
  <title>Reachability Problems on Reliable and Lossy Queue Automata</title>
  <journal>Theory Comput. Syst.</journal>
  <volume>65</volume>
  <number>8</number>
  <pages>1211&#8211;1242</pages>
  <doi>10.1007/s00224-021-10031-2</doi>
 </citation>
 <citation type="inproceedings" key="DBLP:conf/cav/LangeY19">
  <author>Julien <surname>Lange</surname></author>
  <author>Nobuko <surname>Yoshida</surname></author>
  <year>2019</year>
  <title>Verifying Asynchronous Interactions via Communicating Session Automata</title>
  <editor>Isil <surname>Dillig</surname></editor>
  <editor>Serdar <surname>Tasiran</surname></editor>
  <booktitle>Computer Aided Verification - 31st International Conference, CAV 2019, New York City, NY, USA, July 15-18, 2019, Proceedings, Part I</booktitle>
  <series>Lecture Notes in Computer Science</series>
  <volume>11561</volume>
  <publisher>Springer</publisher>
  <pages>97&#8211;117</pages>
  <doi>10.1007/978-3-030-25540-4_6</doi>
 </citation>
 <citation type="article" key="DBLP:journals/tcs/Lohrey03">
  <author>Markus <surname>Lohrey</surname></author>
  <year>2003</year>
  <title>Realizability of high-level message sequence charts: closing the gaps</title>
  <journal>Theor. Comput. Sci.</journal>
  <volume>309</volume>
  <number>1-3</number>
  <pages>529&#8211;554</pages>
  <doi>10.1016/j.tcs.2003.08.002</doi>
 </citation>
 <citation type="inproceedings" key="DBLP:conf/icalp/Madhusudan01">
  <author>P. <surname>Madhusudan</surname></author>
  <year>2001</year>
  <title>Reasoning about Sequential and Branching Behaviours of Message Sequence Graphs</title>
  <editor>Fernando <surname>Orejas</surname></editor>
  <editor>Paul G. <surname>Spirakis</surname></editor>
  <editor>Jan <surname>van Leeuwen</surname></editor>
  <booktitle>Automata, Languages and Programming, 28th International Colloquium, ICALP 2001, Crete, Greece, July 8-12, 2001, Proceedings</booktitle>
  <series>Lecture Notes in Computer Science</series>
  <volume>2076</volume>
  <publisher>Springer</publisher>
  <pages>809&#8211;820</pages>
  <doi>10.1007/3-540-48224-5_66</doi>
 </citation>
 <citation type="inproceedings" key="DBLP:conf/concur/MajumdarMSZ21">
  <author>Rupak <surname>Majumdar</surname></author>
  <author>Madhavan <surname>Mukund</surname></author>
  <author>Felix <surname>Stutz</surname></author>
  <author>Damien <surname>Zufferey</surname></author>
  <year>2021</year>
  <title>Generalising Projection in Asynchronous Multiparty Session Types</title>
  <editor>Serge <surname>Haddad</surname></editor>
  <editor>Daniele <surname>Varacca</surname></editor>
  <booktitle>32nd International Conference on Concurrency Theory, CONCUR 2021, August 24-27, 2021, Virtual Conference</booktitle>
  <series>LIPIcs</series>
  <volume>203</volume>
  <publisher>Schloss Dagstuhl - Leibniz-Zentrum f&#252;r Informatik</publisher>
  <pages>35:1&#8211;35:24</pages>
  <doi>10.4230/LIPIcs.CONCUR.2021.35</doi>
 </citation>
 <citation type="inproceedings" key="DBLP:conf/sdl/MauwR97">
  <author>Sjouke <surname>Mauw</surname></author>
  <author>Michel A. <surname>Reniers</surname></author>
  <year>1997</year>
  <title>High-level message sequence charts</title>
  <editor>Ana R. <surname>Cavalli</surname></editor>
  <editor>Amardeo <surname>Sarma</surname></editor>
  <booktitle>SDL '97 Time for Testing, SDL, MSC and Trends - 8th International SDL Forum, Evry, France, 23-29 September 1997, Proceedings</booktitle>
  <publisher>Elsevier</publisher>
  <pages>291&#8211;306</pages>
 </citation>
 <citation type="inproceedings" key="DBLP:conf/fase/MooijGR05">
  <author>Arjan J. <surname>Mooij</surname></author>
  <author>Nicolae <surname>Goga</surname></author>
  <author>Judi <surname>Romijn</surname></author>
  <year>2005</year>
  <title>Non-local Choice and Beyond: Intricacies of MSC Choice Nodes</title>
  <editor>Maura <surname>Cerioli</surname></editor>
  <booktitle>Fundamental Approaches to Software Engineering, 8th International Conference, FASE 2005, Held as Part of the Joint European Conferences on Theory and Practice of Software, ETAPS 2005, Edinburgh, UK, April 4-8, 2005, Proceedings</booktitle>
  <series>Lecture Notes in Computer Science</series>
  <volume>3442</volume>
  <publisher>Springer</publisher>
  <pages>273&#8211;288</pages>
  <doi>10.1007/978-3-540-31984-9_21</doi>
 </citation>
 <citation type="inproceedings" key="DBLP:conf/fase/Muccini03">
  <author>Henry <surname>Muccini</surname></author>
  <year>2003</year>
  <title>Detecting Implied Scenarios Analyzing Non-local Branching Choices</title>
  <editor>Mauro <surname>Pezz&#232;</surname></editor>
  <booktitle>Fundamental Approaches to Software Engineering, 6th International Conference, FASE 2003, Held as Part of the Joint European Conferences on Theory and Practice of Software, ETAPS 2003, Warsaw, Poland, April 7-11, 2003, Proceedings</booktitle>
  <series>Lecture Notes in Computer Science</series>
  <volume>2621</volume>
  <publisher>Springer</publisher>
  <pages>372&#8211;386</pages>
  <doi>10.1007/3-540-36578-8_26</doi>
 </citation>
 <citation type="article" key="DBLP:journals/acta/PengP92">
  <author>Wuxu <surname>Peng</surname></author>
  <author>S. <surname>Purushothaman</surname></author>
  <year>1992</year>
  <title>Analysis of a Class of Communicating Finite State Machines</title>
  <journal>Acta Informatica</journal>
  <volume>29</volume>
  <number>6/7</number>
  <pages>499&#8211;522</pages>
  <doi>10.1007/BF01185558</doi>
 </citation>
 <citation type="article" key="DBLP:journals/tosem/RoychoudhuryGS12">
  <author>Abhik <surname>Roychoudhury</surname></author>
  <author>Ankit <surname>Goel</surname></author>
  <author>Bikram <surname>Sengupta</surname></author>
  <year>2012</year>
  <title>Symbolic Message Sequence Charts</title>
  <journal>ACM Trans. Softw. Eng. Methodol.</journal>
  <volume>21</volume>
  <number>2</number>
  <pages>12:1&#8211;12:44</pages>
  <doi>10.1145/2089116.2089122</doi>
 </citation>
 <citation type="article" key="DBLP:journals/pacmpl/ScalasY19">
  <author>Alceste <surname>Scalas</surname></author>
  <author>Nobuko <surname>Yoshida</surname></author>
  <year>2019</year>
  <title>Less is more: multiparty session types revisited</title>
  <journal>Proc. ACM Program. Lang.</journal>
  <volume>3</volume>
  <number>POPL</number>
  <pages>30:1&#8211;30:29</pages>
  <doi>10.1145/3290343</doi>
 </citation>
 <citation type="article" key="arxiv-version">
  <author>Felix <surname>Stutz</surname></author>
  <author>Damien <surname>Zufferey</surname></author>
  <year>2022</year>
  <title>Comparing Channel Restrictions of Communicating State Machines, High-level Message Sequence Charts, and Multiparty Session Types</title>
  <journal>CoRR</journal>
  <volume>abs/2208.05559</volume>
  <doi>10.48550/arXiv.2208.05559</doi>
  <eprint>2208.05559</eprint>
 </citation>
 <citation type="inproceedings" key="DBLP:conf/tacas/TorreMP08">
  <author>Salvatore La <surname>Torre</surname></author>
  <author>P. <surname>Madhusudan</surname></author>
  <author>Gennaro <surname>Parlato</surname></author>
  <year>2008</year>
  <title>Context-Bounded Analysis of Concurrent Queue Systems</title>
  <editor>C. R. <surname>Ramakrishnan</surname></editor>
  <editor>Jakob <surname>Rehof</surname></editor>
  <booktitle>Tools and Algorithms for the Construction and Analysis of Systems, 14th International Conference, TACAS 2008, Held as Part of the Joint European Conferences on Theory and Practice of Software, ETAPS 2008, Budapest, Hungary, March 29-April 6, 2008. Proceedings</booktitle>
  <series>Lecture Notes in Computer Science</series>
  <volume>4963</volume>
  <publisher>Springer</publisher>
  <pages>299&#8211;314</pages>
  <doi>10.1007/978-3-540-78800-3_21</doi>
 </citation>
 <citation type="article" key="DBLP:journals/tcs/TouiliA10">
  <author>Tayssir <surname>Touili</surname></author>
  <author>Mohamed Faouzi <surname>Atig</surname></author>
  <year>2010</year>
  <title>Verifying parallel programs with dynamic communication structures</title>
  <journal>Theor. Comput. Sci.</journal>
  <volume>411</volume>
  <number>38-39</number>
  <pages>3460&#8211;3468</pages>
  <doi>10.1016/j.tcs.2010.05.028</doi>
 </citation>
 <citation type="techreport" key="z120-standard">
  <author>International Telecommunication <surname>Union</surname></author>
  <year>1996</year>
  <title>Z.120: Message Sequence Chart</title>
  <type>Technical Report</type>
  <institution>International Telecommunication Union</institution>
  <url>https://www.itu.int/rec/T-REC-Z.120</url>
 </citation>
</bibliography>
