{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,19]],"date-time":"2025-06-19T09:03:44Z","timestamp":1750323824457,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":26,"publisher":"ACM","license":[{"start":{"date-parts":[[2016,7,5]],"date-time":"2016-07-05T00:00:00Z","timestamp":1467676800000},"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":[],"published-print":{"date-parts":[[2016,7,5]]},"DOI":"10.1145\/2933575.2934552","type":"proceedings-article","created":{"date-parts":[[2016,10,14]],"date-time":"2016-10-14T13:34:47Z","timestamp":1476452087000},"page":"457-466","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":6,"title":["First-order logic with reachability for infinite-state systems"],"prefix":"10.1145","author":[{"given":"Emanuele","family":"D'Osualdo","sequence":"first","affiliation":[{"name":"University of Kaiserslautern"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Roland","family":"Meyer","sequence":"additional","affiliation":[{"name":"University of Kaiserslautern"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Georg","family":"Zetzsche","sequence":"additional","affiliation":[{"name":"LSV, CNRS & ENS Cachan, Universit\u00e9 Paris-Saclay"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2016,7,5]]},"reference":[{"key":"e_1_3_2_1_1_1","series-title":"LNCS","first-page":"35","volume-title":"CONCUR","author":"Abdulla P. A.","year":"2004","unstructured":"P. A. Abdulla , B. Jonsson , M. Nilsson , and M. Saksena . A survey of regular model checking . In CONCUR , volume 3170 of LNCS , pages 35 -- 48 . Springer , 2004 . P. A. Abdulla, B. Jonsson, M. Nilsson, and M. Saksena. A survey of regular model checking. In CONCUR, volume 3170 of LNCS, pages 35--48. Springer, 2004."},{"key":"e_1_3_2_1_2_1","first-page":"1188","volume":"269","author":"Benois M.","year":"1969","unstructured":"M. Benois . Parties rationnelles du groupe libre. CR Acad. Sci. Paris , 269 : 1188 -- 1190 , 1969 . M. Benois. Parties rationnelles du groupe libre. CR Acad. Sci. Paris, 269: 1188--1190, 1969.","journal-title":"CR Acad. Sci. Paris"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.5555\/788022.789015"},{"key":"e_1_3_2_1_4_1","series-title":"LNCS","first-page":"152","volume-title":"ICALP","author":"Boigelot B.","year":"1998","unstructured":"B. Boigelot and P. Wolper . On the expressiveness of real and integer arithmetic automata . In ICALP , volume 1443 of LNCS , pages 152 -- 163 . Springer , 1998 . B. Boigelot and P. Wolper. On the expressiveness of real and integer arithmetic automata. In ICALP, volume 1443 of LNCS, pages 152--163. Springer, 1998."},{"key":"e_1_3_2_1_5_1","series-title":"LNCS","first-page":"135","volume-title":"CONCUR","author":"Bouajjani A.","year":"1997","unstructured":"A. Bouajjani , J. Esparza , and O. Maler . Reachability analysis of pushdown automata: Application to model-checking . In CONCUR , volume 1243 of LNCS , pages 135 -- 150 . Springer , 1997 . A. Bouajjani, J. Esparza, and O. Maler. Reachability analysis of pushdown automata: Application to model-checking. In CONCUR, volume 1243 of LNCS, pages 135--150. Springer, 1997."},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1002\/malq.19600060105"},{"key":"e_1_3_2_1_7_1","series-title":"LNCS","first-page":"231","volume-title":"MFCS","author":"Buckheister P.","year":"2013","unstructured":"P. Buckheister and G. Zetzsche . Semilinearity and context-freeness of languages accepted by valence automata . In MFCS , volume 8087 of LNCS , pages 231 -- 242 . Springer , 2013 . P. Buckheister and G. Zetzsche. Semilinearity and context-freeness of languages accepted by valence automata. In MFCS, volume 8087 of LNCS, pages 231--242. Springer, 2013."},{"key":"e_1_3_2_1_8_1","series-title":"LNCS","first-page":"112","volume-title":"FSTTCS","author":"Carayol A.","year":"2003","unstructured":"A. Carayol and S. W\u00f6hrle . The caucal hierarchy of infinite graphs in terms of logic and higher-order pushdown automata . In FSTTCS , volume 2914 of LNCS , pages 112 -- 123 . Springer , 2003 . A. Carayol and S. W\u00f6hrle. The caucal hierarchy of infinite graphs in terms of logic and higher-order pushdown automata. In FSTTCS, volume 2914 of LNCS, pages 112--123. Springer, 2003."},{"key":"e_1_3_2_1_9_1","series-title":"LNCS","first-page":"194","volume-title":"ICALP","author":"Caucal D.","year":"1996","unstructured":"D. Caucal . On infinite transition graphs having a decidable monadic theory . In ICALP , volume 1099 of LNCS , pages 194 -- 205 . Springer , 1996 . D. Caucal. On infinite transition graphs having a decidable monadic theory. In ICALP, volume 1099 of LNCS, pages 194--205. Springer, 1996."},{"key":"e_1_3_2_1_10_1","series-title":"LNCS","first-page":"98","volume-title":"ICALP","author":"Colcombet T.","year":"2002","unstructured":"T. Colcombet . On families of graphs having a decidable first order theory with reachability . In ICALP , volume 2380 of LNCS , pages 98 -- 109 . Springer , 2002 . T. Colcombet. On families of graphs having a decidable first order theory with reachability. In ICALP, volume 2380 of LNCS, pages 98--109. Springer, 2002."},{"key":"e_1_3_2_1_11_1","series-title":"LIPIcs","first-page":"140","volume-title":"FSTTCS","author":"Darondeau P.","year":"2011","unstructured":"P. Darondeau , S. Demri , R. Meyer , and C. Morvan . Petri net reachability graphs: Decidability status of FO properties . In FSTTCS , volume 13 of LIPIcs , pages 140 -- 151 . Schloss Dagstuhl , 2011 . P. Darondeau, S. Demri, R. Meyer, and C. Morvan. Petri net reachability graphs: Decidability status of FO properties. In FSTTCS, volume 13 of LIPIcs, pages 140--151. Schloss Dagstuhl, 2011."},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1147\/rd.91.0047"},{"key":"e_1_3_2_1_13_1","series-title":"LNCS","first-page":"39","volume-title":"STACS","author":"Harju T.","year":"1996","unstructured":"T. Harju , J. Karhum\u00e4ki , and D. Krob . Remarks on generalized post correspondence problem . In STACS , volume 1046 of LNCS , pages 39 -- 48 . Springer , 1996 . T. Harju, J. Karhum\u00e4ki, and D. Krob. Remarks on generalized post correspondence problem. In STACS, volume 1046 of LNCS, pages 39--48. Springer, 1996."},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1145\/322047.322058"},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.5555\/648045.745192"},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-24749-4_39"},{"key":"e_1_3_2_1_17_1","series-title":"LNCS","first-page":"402","volume-title":"CONCUR","author":"Leroux J.","year":"2004","unstructured":"J. Leroux and G. Sutre . On flatness for 2-dimensional vector addition systems with states . In CONCUR , volume 3170 of LNCS , pages 402 -- 416 . Springer , 2004 . J. Leroux and G. Sutre. On flatness for 2-dimensional vector addition systems with states. In CONCUR, volume 3170 of LNCS, pages 402--416. Springer, 2004."},{"key":"e_1_3_2_1_18_1","series-title":"LNCS","first-page":"342","volume-title":"ICALP","author":"Lugiez D.","year":"2000","unstructured":"D. Lugiez and P. Schnoebelen . Decidable first-order transition logics for PA-processes . In ICALP , volume 1853 of LNCS , pages 342 -- 353 . Springer , 2000 . D. Lugiez and P. Schnoebelen. Decidable first-order transition logics for PA-processes. In ICALP, volume 1853 of LNCS, pages 342--353. Springer, 2000."},{"key":"e_1_3_2_1_19_1","volume-title":"Hilbert's Tenth Problem","author":"Matiyasevich Y. V.","year":"1993","unstructured":"Y. V. Matiyasevich . Hilbert's Tenth Problem . MIT Press , Cambridge , 1993 . Y. V. Matiyasevich. Hilbert's Tenth Problem. MIT Press, Cambridge, 1993."},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1109\/LICS.2006.38"},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1145\/321356.321364"},{"key":"e_1_3_2_1_22_1","series-title":"LNCS","first-page":"460","volume-title":"LATIN","author":"Sakarovitch J.","year":"1992","unstructured":"J. Sakarovitch . The \"last\" decision problem for rational trace languages . In LATIN , volume 583 of LNCS , pages 460 -- 473 . Springer , 1992 . J. Sakarovitch. The \"last\" decision problem for rational trace languages. In LATIN, volume 583 of LNCS, pages 460--473. Springer, 1992."},{"key":"e_1_3_2_1_23_1","series-title":"LIPIcs","first-page":"493","volume-title":"FSTTCS","author":"Schulz S.","year":"2010","unstructured":"S. Schulz . First-order logic with reachability predicates on infinite systems . In FSTTCS , volume 8 of LIPIcs , pages 493 -- 504 . Schloss Dagstuhl , 2010 . S. Schulz. First-order logic with reachability predicates on infinite systems. In FSTTCS, volume 8 of LIPIcs, pages 493--504. Schloss Dagstuhl, 2010."},{"key":"e_1_3_2_1_24_1","series-title":"LNCS","first-page":"62","volume-title":"CAV","author":"Walukiewicz I.","year":"1996","unstructured":"I. Walukiewicz . Pushdown processes: Games and model checking . In CAV , volume 1102 of LNCS , pages 62 -- 74 . Springer , 1996 . I. Walukiewicz. Pushdown processes: Games and model checking. In CAV, volume 1102 of LNCS, pages 62--74. Springer, 1996."},{"key":"e_1_3_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-39212-2_39"},{"key":"e_1_3_2_1_26_1","series-title":"LNCS","doi-asserted-by":"crossref","first-page":"166","DOI":"10.1007\/978-3-319-24537-9_15","volume-title":"Reachability Problems","author":"Zetzsche G.","year":"2015","unstructured":"G. Zetzsche . The emptiness problem for valence automata or: Another decidable extension of Petri nets . In Reachability Problems , volume 9328 of LNCS , pages 166 -- 178 . Springer , 2015 . G. Zetzsche. The emptiness problem for valence automata or: Another decidable extension of Petri nets. In Reachability Problems, volume 9328 of LNCS, pages 166--178. Springer, 2015."}],"event":{"name":"LICS '16: 31st Annual ACM\/IEEE Symposium on Logic in Computer Science","sponsor":["SIGLOG ACM Special Interest Group on Logic and Computation","EACSL European Association for Computer Science Logic","IEEE-CS\\DATC IEEE Computer Society"],"location":"New York NY USA","acronym":"LICS '16"},"container-title":["Proceedings of the 31st Annual ACM\/IEEE Symposium on Logic in Computer Science"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2933575.2934552","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/2933575.2934552","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T04:54:53Z","timestamp":1750222493000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2933575.2934552"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016,7,5]]},"references-count":26,"alternative-id":["10.1145\/2933575.2934552","10.1145\/2933575"],"URL":"https:\/\/doi.org\/10.1145\/2933575.2934552","relation":{},"subject":[],"published":{"date-parts":[[2016,7,5]]},"assertion":[{"value":"2016-07-05","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}