{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,19]],"date-time":"2025-06-19T04:52:47Z","timestamp":1750308767493,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":32,"publisher":"ACM","license":[{"start":{"date-parts":[[2014,7,14]],"date-time":"2014-07-14T00:00:00Z","timestamp":1405296000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/linproxy.fan.workers.dev:443\/https\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"name":"EGIDE\/DAAD-Procope (TAMTV)"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2014,7,14]]},"DOI":"10.1145\/2603088.2603093","type":"proceedings-article","created":{"date-parts":[[2014,7,28]],"date-time":"2014-07-28T13:21:45Z","timestamp":1406553705000},"page":"1-10","update-policy":"https:\/\/linproxy.fan.workers.dev:443\/https\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":4,"title":["Logic for communicating automata with parameterized topology"],"prefix":"10.1145","author":[{"given":"Benedikt","family":"Bollig","sequence":"first","affiliation":[{"name":"LSV, ENS Cachan, CNRS & Inria, France"}]}],"member":"320","published-online":{"date-parts":[[2014,7,14]]},"reference":[{"key":"e_1_3_2_1_1_1","series-title":"LNCS","first-page":"134","volume-title":"Proc. of CAV'99","author":"Abdulla P. A.","year":"1999","unstructured":"P. A. Abdulla , A. Bouajjani , B. Jonsson , and M. Nilsson . Handling global conditions in parameterized system verification . In Proc. of CAV'99 , volume 1633 of LNCS , pages 134 -- 145 . Springer , 1999 . P. A. Abdulla, A. Bouajjani, B. Jonsson, and M. Nilsson. Handling global conditions in parameterized system verification. In Proc. of CAV'99, volume 1633 of LNCS, pages 134--145. Springer, 1999."},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2004.09.034"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1145\/1516512.1516518"},{"key":"e_1_3_2_1_4_1","series-title":"LNCS","first-page":"177","volume-title":"Proc. of LATA'13","author":"Bollig B.","year":"2013","unstructured":"B. Bollig , A. Cyriac , L. H\u00e9lou\u00ebt , A. Kara , and T. Schwentick . Dynamic communicating automata and branching high-level MSCs . In Proc. of LATA'13 , volume 7810 of LNCS , pages 177 -- 189 . Springer , 2013 . B. Bollig, A. Cyriac, L. H\u00e9lou\u00ebt, A. Kara, and T. Schwentick. Dynamic communicating automata and branching high-level MSCs. In Proc. of LATA'13, volume 7810 of LNCS, pages 177--189. Springer, 2013."},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.jal.2012.01.002"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2006.01.014"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1007\/s10703-008-0048-7"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1016\/0890-5401(89)90026-6"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1002\/malq.19600060105"},{"key":"e_1_3_2_1_10_1","series-title":"LNCS","first-page":"119","volume-title":"Proc. of OPODIS'10","author":"Chalopin J.","year":"2010","unstructured":"J. Chalopin , S. Das , and A. Kosowski . Constructing a map of an anonymous graph: Applications of universal sequences . In Proc. of OPODIS'10 , volume 6490 of LNCS , pages 119 -- 134 . Springer , 2010 . J. Chalopin, S. Das, and A. Kosowski. Constructing a map of an anonymous graph: Applications of universal sequences. In Proc. of OPODIS'10, volume 6490 of LNCS, pages 119--134. Springer, 2010."},{"key":"e_1_3_2_1_11_1","series-title":"LNCS","first-page":"109","volume-title":"Proc. of RP'13","author":"Delzanno G.","year":"2013","unstructured":"G. Delzanno , A. Sangnier , and R. Traverso . Parameterized verification of broadcast networks of register automata . In Proc. of RP'13 , volume 8169 of LNCS , pages 109 -- 121 . Springer , 2013 . G. Delzanno, A. Sangnier, and R. Traverso. Parameterized verification of broadcast networks of register automata. In Proc. of RP'13, volume 8169 of LNCS, pages 109--121. Springer, 2013."},{"key":"e_1_3_2_1_12_1","series-title":"LNCS","volume-title":"Proc. of CONCUR'10","author":"Delzanno G.","year":"2010","unstructured":"G. Delzanno , A. Sangnier , and G. Zavattaro . Parameterized verification of ad hoc networks . In Proc. of CONCUR'10 , volume 6269 of LNCS . Springer , 2010 . G. Delzanno, A. Sangnier, and G. Zavattaro. Parameterized verification of ad hoc networks. In Proc. of CONCUR'10, volume 6269 of LNCS. Springer, 2010."},{"key":"e_1_3_2_1_13_1","series-title":"LNCS","first-page":"238","volume-title":"Proc. of LATA'13","author":"Delzanno G.","year":"2013","unstructured":"G. Delzanno and R. Traverso . Decidability and complexity results for verification of asynchronous broadcast networks . In Proc. of LATA'13 , volume 7810 of LNCS , pages 238 -- 249 . Springer , 2013 . G. Delzanno and R. Traverso. Decidability and complexity results for verification of asynchronous broadcast networks. In Proc. of LATA'13, volume 7810 of LNCS, pages 238--249. Springer, 2013."},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1090\/S0002-9947-1961-0139530-9"},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1142\/S0129054103001881"},{"key":"e_1_3_2_1_16_1","first-page":"105","volume-title":"Logic Colloquium '81","author":"Gaifman H.","year":"1982","unstructured":"H. Gaifman . On local and nonlocal properties. In J. Stern, editor , Logic Colloquium '81 , pages 105 -- 135 . North-Holland , 1982 . H. Gaifman. On local and nonlocal properties. In J. Stern, editor, Logic Colloquium '81, pages 105--135. North-Holland, 1982."},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.ic.2009.12.003"},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-39212-2_26"},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.ic.2006.01.005"},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.5555\/2367430.2367439"},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1145\/146637.146681"},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-11409-0_14"},{"key":"e_1_3_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.ic.2004.08.004"},{"key":"e_1_3_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-28756-5_25"},{"key":"e_1_3_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.apal.2004.01.004"},{"key":"e_1_3_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0890-5401(03)00123-8"},{"key":"e_1_3_2_1_27_1","series-title":"IFIP","first-page":"477","volume-title":"Proc. of IFIP-TCS'08","author":"Meyer R.","year":"2008","unstructured":"R. Meyer . On boundedness in depth in the pi-calculus . In Proc. of IFIP-TCS'08 , volume 273 of IFIP , pages 477 -- 489 . Springer , 2008 . R. Meyer. On boundedness in depth in the pi-calculus. In Proc. of IFIP-TCS'08, volume 273 of IFIP, pages 477--489. Springer, 2008."},{"issue":"3","key":"e_1_3_2_1_28_1","first-page":"109","article-title":"Local normal forms for first-order logic with applications to games and automata","volume":"3","author":"Schwentick T.","year":"1999","unstructured":"T. Schwentick and K. Barthelmann . Local normal forms for first-order logic with applications to games and automata . Discrete Math. Theor. Comput. Sci. , 3 ( 3 ): 109 -- 124 , 1999 . T. Schwentick and K. Barthelmann. Local normal forms for first-order logic with applications to games and automata. Discrete Math. Theor. Comput. Sci., 3(3):109--124, 1999.","journal-title":"Discrete Math. Theor. Comput. Sci."},{"key":"e_1_3_2_1_29_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF01691346"},{"key":"e_1_3_2_1_30_1","series-title":"DIMACS","volume-title":"Proc. of POMIV'96","author":"Thomas W.","year":"1996","unstructured":"W. Thomas . Elements of an automata theory over partial orders . In Proc. of POMIV'96 , volume 29 of DIMACS . AMS , 1996 . W. Thomas. Elements of an automata theory over partial orders. In Proc. of POMIV'96, volume 29 of DIMACS. AMS, 1996."},{"key":"e_1_3_2_1_31_1","first-page":"103","article-title":"Finite automata and monadic second order logic","volume":"3","author":"Trakhtenbrot B. A.","year":"1962","unstructured":"B. A. Trakhtenbrot . Finite automata and monadic second order logic . Siberian Math. J , 3 : 103 -- 131 , 1962 . In Russian; English translation in Amer. Math. Soc. Transl. 59, 1966, 23--55. B. A. Trakhtenbrot. Finite automata and monadic second order logic. Siberian Math. J, 3:103--131, 1962. In Russian; English translation in Amer. Math. Soc. Transl. 59, 1966, 23--55.","journal-title":"Siberian Math. J"},{"key":"e_1_3_2_1_32_1","volume-title":"Notes on finite asynchronous automata. R. A. I. R. O. --- Informatique Th\u00e9orique et Applications, 21:99--135","author":"Zielonka W.","year":"1987","unstructured":"W. Zielonka . Notes on finite asynchronous automata. R. A. I. R. O. --- Informatique Th\u00e9orique et Applications, 21:99--135 , 1987 . W. Zielonka. Notes on finite asynchronous automata. R. A. I. R. O. --- Informatique Th\u00e9orique et Applications, 21:99--135, 1987."}],"event":{"name":"CSL-LICS '14: JOINT MEETING OF the Twenty-Third EACSL Annual Conference on COMPUTER SCIENCE LOGIC","sponsor":["SIGLOG ACM Special Interest Group on Logic and Computation","EACSL European Association for Computer Science Logic","IEEE-CS\\DATC IEEE Computer Society","SIGACT ACM Special Interest Group on Algorithms and Computation Theory"],"location":"Vienna Austria","acronym":"CSL-LICS '14"},"container-title":["Proceedings of the Joint Meeting of the Twenty-Third EACSL Annual Conference on Computer Science Logic (CSL) and the Twenty-Ninth Annual ACM\/IEEE Symposium on Logic in Computer Science (LICS)"],"original-title":[],"link":[{"URL":"https:\/\/linproxy.fan.workers.dev:443\/https\/dl.acm.org\/doi\/10.1145\/2603088.2603093","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/linproxy.fan.workers.dev:443\/https\/dl.acm.org\/doi\/pdf\/10.1145\/2603088.2603093","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T20:22:33Z","timestamp":1750278153000},"score":1,"resource":{"primary":{"URL":"https:\/\/linproxy.fan.workers.dev:443\/https\/dl.acm.org\/doi\/10.1145\/2603088.2603093"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014,7,14]]},"references-count":32,"alternative-id":["10.1145\/2603088.2603093","10.1145\/2603088"],"URL":"https:\/\/linproxy.fan.workers.dev:443\/https\/doi.org\/10.1145\/2603088.2603093","relation":{},"subject":[],"published":{"date-parts":[[2014,7,14]]},"assertion":[{"value":"2014-07-14","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}