{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,5]],"date-time":"2026-02-05T07:48:33Z","timestamp":1770277713090,"version":"3.49.0"},"reference-count":30,"publisher":"Association for Computing Machinery (ACM)","issue":"1","license":[{"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.acm.org\/publications\/policies\/copyright_policy#Background"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":["ACM SIGLOG News"],"published-print":{"date-parts":[[2022,1]]},"abstract":"<jats:p>Treewidth, or similar measures, have been a quite useful technique in the verification of infinite state systems. We illustrate, through examples, how such measures help in analyzing a system.<\/jats:p>","DOI":"10.1145\/3527540.3527542","type":"journal-article","created":{"date-parts":[[2022,3,17]],"date-time":"2022-03-17T23:28:46Z","timestamp":1647559726000},"page":"6-21","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":4,"title":["How treewidth helps in verification"],"prefix":"10.1145","volume":"9","author":[{"given":"C","family":"Aiswarya","sequence":"first","affiliation":[{"name":"Chennai Mathematical Institute, India"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2022,3,17]]},"reference":[{"key":"e_1_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.4230\/LIPIcs.CONCUR.2017.38"},{"key":"e_1_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1006\/inco.1996.0053"},{"key":"e_1_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.4230\/LIPIcs.FSTTCS.2014.11"},{"key":"e_1_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-32940-1"},{"key":"e_1_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-11936-6"},{"key":"e_1_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.4230\/LIPIcs.CONCUR.2016.27"},{"key":"e_1_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1145\/1516512.1516518"},{"key":"e_1_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1142\/S0129054117500332"},{"key":"e_1_2_1_9_1","volume-title":"Non-Sequential Theory of Distributed Systems. CoRR abs\/1904.06942","author":"Bollig Benedikt","year":"2019","unstructured":"Benedikt Bollig and Paul Gastin . 2019. Non-Sequential Theory of Distributed Systems. CoRR abs\/1904.06942 ( 2019 ). http:\/\/arxiv.org\/abs\/1904.06942 Benedikt Bollig and Paul Gastin. 2019. Non-Sequential Theory of Distributed Systems. CoRR abs\/1904.06942 (2019). http:\/\/arxiv.org\/abs\/1904.06942"},{"key":"e_1_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1145\/322374.322380"},{"key":"e_1_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1142\/S0129054196000191"},{"key":"e_1_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1002\/malq.19600060105"},{"key":"e_1_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1142\/9789812384720"},{"key":"e_1_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.jal.2005.08.004"},{"key":"e_1_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511977619"},{"key":"e_1_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.2307\/1993511"},{"key":"e_1_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.5555\/2367430.2367439"},{"key":"e_1_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.2178\/jsl\/1231082313"},{"key":"e_1_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-12032-9"},{"key":"e_1_2_1_21_1","unstructured":"ITU-TS 1998. ITU-TS Recommendation Z.120 ann B: Formal Semantics of Message Sequence Charts. (1998).  ITU-TS 1998. ITU-TS Recommendation Z.120 ann B: Formal Semantics of Message Sequence Charts. (1998)."},{"key":"e_1_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511974960.006"},{"key":"e_1_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1109\/LICS.2007.9"},{"key":"e_1_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-78800-3"},{"key":"e_1_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-23217-6"},{"key":"e_1_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.1145\/1926385.1926419"},{"key":"e_1_2_1_27_1","doi-asserted-by":"publisher","DOI":"10.1142\/9789814271059"},{"key":"e_1_2_1_28_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-31980-1"},{"key":"e_1_2_1_29_1","doi-asserted-by":"publisher","DOI":"10.2307\/1995086"},{"key":"e_1_2_1_30_1","doi-asserted-by":"publisher","DOI":"10.1016\/0168-0072(91)90054-P"},{"key":"e_1_2_1_31_1","first-page":"326","article-title":"Finite Automata and Logic of Monadic Predicates","volume":"149","author":"Trakhtenbrot Boris A.","year":"1961","unstructured":"Boris A. Trakhtenbrot . 1961 . Finite Automata and Logic of Monadic Predicates . Doklady Akademii Nauk SSR 149 (1961), 326 - 329 . Boris A. Trakhtenbrot. 1961. Finite Automata and Logic of Monadic Predicates. Doklady Akademii Nauk SSR 149 (1961), 326-329.","journal-title":"Doklady Akademii Nauk SSR"}],"container-title":["ACM SIGLOG News"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3527540.3527542","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3527540.3527542","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T20:18:53Z","timestamp":1750191533000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3527540.3527542"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,1]]},"references-count":30,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2022,1]]}},"alternative-id":["10.1145\/3527540.3527542"],"URL":"https:\/\/doi.org\/10.1145\/3527540.3527542","relation":{},"ISSN":["2372-3491"],"issn-type":[{"value":"2372-3491","type":"electronic"}],"subject":[],"published":{"date-parts":[[2022,1]]},"assertion":[{"value":"2022-03-17","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}