{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T05:07:27Z","timestamp":1740114447022,"version":"3.37.3"},"reference-count":37,"publisher":"Elsevier BV","license":[{"start":{"date-parts":[[2016,12,1]],"date-time":"2016-12-01T00:00:00Z","timestamp":1480550400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2020,12,20]],"date-time":"2020-12-20T00:00:00Z","timestamp":1608422400000},"content-version":"vor","delay-in-days":1480,"URL":"http:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"},{"start":{"date-parts":[[2016,12,1]],"date-time":"2016-12-01T00:00:00Z","timestamp":1480550400000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-017"},{"start":{"date-parts":[[2016,12,1]],"date-time":"2016-12-01T00:00:00Z","timestamp":1480550400000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"},{"start":{"date-parts":[[2016,12,1]],"date-time":"2016-12-01T00:00:00Z","timestamp":1480550400000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-012"},{"start":{"date-parts":[[2016,12,1]],"date-time":"2016-12-01T00:00:00Z","timestamp":1480550400000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2016,12,1]],"date-time":"2016-12-01T00:00:00Z","timestamp":1480550400000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-004"}],"funder":[{"DOI":"10.13039\/100000001","name":"National Science Foundation","doi-asserted-by":"publisher","award":["CCF1116836"],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["Theoretical Computer Science"],"published-print":{"date-parts":[[2016,12]]},"DOI":"10.1016\/j.tcs.2016.09.023","type":"journal-article","created":{"date-parts":[[2016,10,9]],"date-time":"2016-10-09T00:17:12Z","timestamp":1475972232000},"page":"60-75","update-policy":"https:\/\/doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":19,"special_numbering":"PA","title":["On deciding synchronizability for asynchronously communicating systems"],"prefix":"10.1016","volume":"656","author":[{"given":"Samik","family":"Basu","sequence":"first","affiliation":[]},{"given":"Tevfik","family":"Bultan","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/j.tcs.2016.09.023_br0010","series-title":"Programming Languages Design and Implementation","first-page":"321","article-title":"P: safe asynchronous event-driven programming","author":"Desai","year":"2013"},{"year":"2005","series-title":"Web Services Platform Architecture: SOAP, WSDL, WS-Policy, WS-Addressing, WS-BPEL, WS-Reliable Messaging, and More","author":"Weerawarana","key":"10.1016\/j.tcs.2016.09.023_br0040"},{"key":"10.1016\/j.tcs.2016.09.023_br0050","series-title":"13th International Symposium on Distributed Computing","first-page":"1","article-title":"A case for message oriented middleware","author":"Banavar","year":"1999"},{"issue":"2","key":"10.1016\/j.tcs.2016.09.023_br0060","doi-asserted-by":"crossref","first-page":"90","DOI":"10.1109\/MIC.2005.42","article-title":"MOM vs. RPC: communication models for distributed applications","volume":"9","author":"Menasc\u00e9","year":"2005","journal-title":"IEEE Internet Computing"},{"issue":"2","key":"10.1016\/j.tcs.2016.09.023_br0070","doi-asserted-by":"crossref","first-page":"323","DOI":"10.1145\/322374.322380","article-title":"On communicating finite-state machines","volume":"30","author":"Brand","year":"1983","journal-title":"J. ACM"},{"key":"10.1016\/j.tcs.2016.09.023_br0080","doi-asserted-by":"crossref","first-page":"166","DOI":"10.1016\/j.ic.2005.05.006","article-title":"Verification of programs with half-duplex communication","volume":"202","author":"C\u00e9c\u00e9","year":"2005","journal-title":"Inform. and Comput."},{"key":"10.1016\/j.tcs.2016.09.023_br0090","series-title":"14th Int. Conf. Tools and Algorithms for the Construction and Analysis of Systems","first-page":"299","article-title":"Context-bounded analysis of concurrent queue systems","author":"Torre","year":"2008"},{"key":"10.1016\/j.tcs.2016.09.023_br0100","series-title":"Proc. 13th Int. World Wide Web Conf.","first-page":"621","article-title":"Analysis of interacting BPEL web services","author":"Fu","year":"2004"},{"issue":"12","key":"10.1016\/j.tcs.2016.09.023_br0110","doi-asserted-by":"crossref","first-page":"1042","DOI":"10.1109\/TSE.2005.141","article-title":"Synchronizability of conversations among web services","volume":"31","author":"Fu","year":"2005","journal-title":"IEEE Trans. Softw. Eng."},{"key":"10.1016\/j.tcs.2016.09.023_br0120","series-title":"20th International World Wide Web Conference","first-page":"795","article-title":"Choreography conformance via synchronizability","author":"Basu","year":"2011"},{"key":"10.1016\/j.tcs.2016.09.023_br0130","series-title":"13th International Conference on Verification, Model Checking, and Abstract Interpretation","first-page":"56","article-title":"Synchronizability for verification of asynchronously communicating systems","author":"Basu","year":"2012"},{"key":"10.1016\/j.tcs.2016.09.023_br0140","unstructured":"Web service choregraphy description language, https:\/\/www.w3.org\/TR\/ws-cdl-10-primer\/, 2006."},{"key":"10.1016\/j.tcs.2016.09.023_br0160","series-title":"Proceedings of the 2002 ACM SIGPLAN Workshop on Erlang","first-page":"64","article-title":"Getting Erlang to talk to the outside world","author":"Armstrong","year":"2002"},{"issue":"4","key":"10.1016\/j.tcs.2016.09.023_br0170","doi-asserted-by":"crossref","first-page":"372","DOI":"10.1145\/1041680.1041682","article-title":"Total order broadcast and multicast algorithms: taxonomy and survey","volume":"36","author":"D\u00e9fago","year":"2004","journal-title":"ACM Comput. Surv."},{"issue":"4","key":"10.1016\/j.tcs.2016.09.023_br0180","doi-asserted-by":"crossref","first-page":"173","DOI":"10.1007\/s004460050018","article-title":"Synchronous, asynchronous, and causally ordered communication","volume":"9","author":"Charron-Bost","year":"1996","journal-title":"Distrib. Comput."},{"year":"2015","series-title":"On the Diversity of Asynchronous Communication","author":"Chevrou","key":"10.1016\/j.tcs.2016.09.023_br0190"},{"year":"1999","series-title":"Model Checking","author":"Clarke","key":"10.1016\/j.tcs.2016.09.023_br0200"},{"key":"10.1016\/j.tcs.2016.09.023_br0210","doi-asserted-by":"crossref","first-page":"279","DOI":"10.1109\/32.588521","article-title":"The model checker spin","volume":"23","author":"Holzmann","year":"1997","journal-title":"IEEE Trans. Softw. Eng."},{"issue":"2","key":"10.1016\/j.tcs.2016.09.023_br0220","doi-asserted-by":"crossref","first-page":"91","DOI":"10.1006\/inco.1996.0053","article-title":"Verifying programs with unreliable channels","volume":"127","author":"Abdulla","year":"1996","journal-title":"Inform. and Comput."},{"key":"10.1016\/j.tcs.2016.09.023_br0230","series-title":"Proceedings, Mathematical Foundations of Computer Science 2002: 27th International Symposium","first-page":"543","article-title":"On verifying fair lossy channel system","author":"Masson","year":"2002"},{"key":"10.1016\/j.tcs.2016.09.023_br0240","series-title":"Mathematics of Program Construction","first-page":"272","article-title":"Slack elasticity in concurrent computing","author":"Manohar","year":"1998"},{"key":"10.1016\/j.tcs.2016.09.023_br0250","series-title":"6th International Conference on Verification, Model Checking, and Abstract Interpretation","first-page":"413","article-title":"Efficient verification of halting properties for MPI programs with wildcard receives","author":"Siegel","year":"2005"},{"key":"10.1016\/j.tcs.2016.09.023_br0260","series-title":"17th Euro. MPI Conf. Advances in Message Passing Interface","first-page":"152","article-title":"Precise dynamic analysis for slack elasticity: adding buffering without adding bugs","author":"Vakkalanka","year":"2010"},{"key":"10.1016\/j.tcs.2016.09.023_br0270","series-title":"13th Int. Conf. on Foundations of Software Science and Computational Structures","first-page":"267","article-title":"Reachability analysis of communicating pushdown systems","author":"Heu\u00dfner","year":"2010"},{"key":"10.1016\/j.tcs.2016.09.023_br0280","series-title":"7th European Symp. on Programming Languages and Systems","first-page":"122","article-title":"Language primitives and type discipline for structured communication-based programming","author":"Honda","year":"1998"},{"key":"10.1016\/j.tcs.2016.09.023_br0290","series-title":"Proceedings of Symposium Principles of Programming Languages","first-page":"273","article-title":"Multiparty asynchronous session types","author":"Honda","year":"2008"},{"key":"10.1016\/j.tcs.2016.09.023_br0300","series-title":"Programming Languages and Systems \u2013 21st European Symposium on Programming","first-page":"194","article-title":"Multiparty session types meet communicating automata","author":"Deni\u00e9lou","year":"2012"},{"key":"10.1016\/j.tcs.2016.09.023_br0310","series-title":"Proc. 18th Int. Symp. on Software Testing and Analysis","first-page":"13","article-title":"Analyzing singularity channel contracts","author":"Stengel","year":"2009"},{"issue":"1","key":"10.1016\/j.tcs.2016.09.023_br0320","doi-asserted-by":"crossref","first-page":"97","DOI":"10.1016\/j.tcs.2004.09.034","article-title":"Realizability and verification of {MSC} graphs","volume":"331","author":"Alur","year":"2005","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/j.tcs.2016.09.023_br0330","series-title":"39th ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages","first-page":"191","article-title":"Deciding choreography realizability","author":"Basu","year":"2012"},{"key":"10.1016\/j.tcs.2016.09.023_br0340","series-title":"16th International Conference on Concurrency Theory","first-page":"443","article-title":"On implementation of global concurrent systems with local asynchronous controllers","author":"Genest","year":"2005"},{"key":"10.1016\/j.tcs.2016.09.023_br0350","series-title":"37th International Colloquium on Automata, Languages and Programming","first-page":"52","article-title":"Optimal Zielonka-type construction of deterministic asynchronous automata","author":"Genest","year":"2010"},{"key":"10.1016\/j.tcs.2016.09.023_br0360","series-title":"IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science","first-page":"213","article-title":"Implementing realistic asynchronous automata","volume":"vol. 24","author":"Akshay","year":"2013"},{"key":"10.1016\/j.tcs.2016.09.023_br0370","series-title":"Proceedings of the 38th Conference on Current Trends in Theory and Practice of Computer Science","first-page":"238","article-title":"Multitape NFA: weak synchronization of the input heads","author":"Egecioglu","year":"2012"},{"key":"10.1016\/j.tcs.2016.09.023_br0380","doi-asserted-by":"crossref","first-page":"74","DOI":"10.1016\/j.tcs.2012.04.006","article-title":"On synchronized multi-tape and multi-head automata","volume":"449","author":"Ibarra","year":"2012","journal-title":"Theoret. Comput. Sci."},{"issue":"6","key":"10.1016\/j.tcs.2016.09.023_br0390","doi-asserted-by":"crossref","first-page":"799","DOI":"10.1142\/S0129054113400194","article-title":"How to synchronize the heads of a multitape automaton","volume":"24","author":"Ibarra","year":"2013","journal-title":"Internat. J. Found. Comput. Sci."},{"issue":"1\u20134","key":"10.1016\/j.tcs.2016.09.023_br0400","first-page":"119","article-title":"Weak synchronization and synchronizability of multi-tape pushdown automata and Turing machines","volume":"19","author":"Ibarra","year":"2014","journal-title":"J. Autom. Lang. Comb."}],"container-title":["Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0304397516305102?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0304397516305102?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2024,4,6]],"date-time":"2024-04-06T16:27:34Z","timestamp":1712420854000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0304397516305102"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016,12]]},"references-count":37,"alternative-id":["S0304397516305102"],"URL":"https:\/\/doi.org\/10.1016\/j.tcs.2016.09.023","relation":{},"ISSN":["0304-3975"],"issn-type":[{"type":"print","value":"0304-3975"}],"subject":[],"published":{"date-parts":[[2016,12]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"On deciding synchronizability for asynchronously communicating systems","name":"articletitle","label":"Article Title"},{"value":"Theoretical Computer Science","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/j.tcs.2016.09.023","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"article","name":"content_type","label":"Content Type"},{"value":"\u00a9 2016 Elsevier B.V.","name":"copyright","label":"Copyright"}]}}