{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,22]],"date-time":"2026-07-22T11:41:53Z","timestamp":1784720513167,"version":"3.55.0"},"publisher-location":"New York, NY, USA","reference-count":30,"publisher":"ACM","license":[{"start":{"date-parts":[[2013,1,23]],"date-time":"2013-01-23T00:00:00Z","timestamp":1358899200000},"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":[[2013,1,23]]},"DOI":"10.1145\/2429069.2429124","type":"proceedings-article","created":{"date-parts":[[2013,1,22]],"date-time":"2013-01-22T10:29:29Z","timestamp":1358850569000},"page":"457-468","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":63,"title":["Checking NFA equivalence with bisimulations up to congruence"],"prefix":"10.1145","author":[{"given":"Filippo","family":"Bonchi","sequence":"first","affiliation":[{"name":"CNRS, Lyon, France"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Damien","family":"Pous","sequence":"additional","affiliation":[{"name":"CNRS, Lyon, France"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"320","published-online":{"date-parts":[[2013,1,23]]},"reference":[{"key":"e_1_3_2_2_1_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-12002-2_14"},{"key":"e_1_3_2_2_2_1","volume-title":"The Design and Analysis of Computer Algorithms","author":"Aho A. V.","year":"1974","unstructured":"A. V. Aho , J. E. Hopcroft , and J. D. Ullman . The Design and Analysis of Computer Algorithms . Addison-Wesley , 1974 . A. V. Aho, J. E. Hopcroft, and J. D. Ullman. The Design and Analysis of Computer Algorithms. Addison-Wesley, 1974."},{"key":"e_1_3_2_2_3_1","doi-asserted-by":"crossref","unstructured":"A.\n      Aiken\n     and \n      B. R.\n      Murphy\n  . \n  Implementing regular tree expressions. FPCA vol. \n  523\n   of \n  phLNCS pages \n  427\n  --\n  447\n  . \n  Springer 1991\n  .   A. Aiken and B. R. Murphy. Implementing regular tree expressions. FPCA vol. 523 of phLNCS pages 427--447. Springer 1991.","DOI":"10.1007\/3540543961_21"},{"key":"e_1_3_2_2_4_1","doi-asserted-by":"crossref","unstructured":"J. C. M.\n      Baeten J. A.\n      Bergstra and \n      J. W.\n      Klop\n  . \n  Decidability of bisimulation equivalence for processes generating context-free languages. PARLE (II) vol. \n  259\n   of \n  phLNCS pages \n  94\n  --\n  111\n  . \n  Springer 1987\n  .   J. C. M. Baeten J. A. Bergstra and J. W. Klop. Decidability of bisimulation equivalence for processes generating context-free languages. PARLE (II) vol. 259 of phLNCS pages 94--111. Springer 1987.","DOI":"10.1007\/3-540-17945-3_5"},{"key":"e_1_3_2_2_6_1","unstructured":"F. Bonchi and D. Pous. Extended version of this abstract with omitted proofs. http:\/\/hal.inria.fr\/hal-00639716\/ 2012\\natexlaba.  F. Bonchi and D. Pous. Extended version of this abstract with omitted proofs. http:\/\/hal.inria.fr\/hal-00639716\/ 2012\\natexlaba."},{"key":"e_1_3_2_2_7_1","unstructured":"F. Bonchi and D. Pous. Web appendix for this paper. http:\/\/perso.ens-lyon.fr\/damien.pous\/hknt 2012\\natexlabb.  F. Bonchi and D. Pous. Web appendix for this paper. http:\/\/perso.ens-lyon.fr\/damien.pous\/hknt 2012\\natexlabb."},{"key":"e_1_3_2_2_8_1","series-title":"LNCS","volume-title":"Abstract regular model checking. Proc. CAV","author":"Bouajjani A.","year":"2004","unstructured":"A. Bouajjani , P. Habermehl , and T. Vojnar . Abstract regular model checking. Proc. CAV , vol. 3114 of LNCS . Springer , 2004 . A. Bouajjani, P. Habermehl, and T. Vojnar. Abstract regular model checking. Proc. CAV, vol. 3114 of LNCS. Springer, 2004."},{"key":"e_1_3_2_2_9_1","doi-asserted-by":"publisher","DOI":"10.1109\/TC.1986.1676819"},{"key":"e_1_3_2_2_10_1","first-page":"339","article-title":"Graphes canoniques de graphes alg\u00e9briques","volume":"24","author":"Caucal D.","year":"1990","unstructured":"D. Caucal . Graphes canoniques de graphes alg\u00e9briques . ITA , 24 : 339 -- 352 , 1990 . D. Caucal. Graphes canoniques de graphes alg\u00e9briques. ITA, 24: 339--352, 1990.","journal-title":"ITA"},{"key":"e_1_3_2_2_11_1","doi-asserted-by":"publisher","DOI":"10.1006\/inco.1995.1129"},{"key":"e_1_3_2_2_12_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-12002-2_2"},{"key":"e_1_3_2_2_13_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF00121127"},{"key":"e_1_3_2_2_14_1","doi-asserted-by":"publisher","DOI":"10.5555\/795662.796255"},{"key":"e_1_3_2_2_15_1","doi-asserted-by":"publisher","DOI":"10.1016\/0304-3975(95)00064-X"},{"key":"e_1_3_2_2_16_1","volume-title":"Optimizing an LTS-Simulation Algorithm. phComputing and Informatics","author":"Hol\u00edk L.","year":"2010","unstructured":"L. Hol\u00edk and J.vSim\u00e1vcek. Optimizing an LTS-Simulation Algorithm. phComputing and Informatics , 2010 (7): 1337--1348, 2010. L. Hol\u00edk and J.vSim\u00e1vcek. Optimizing an LTS-Simulation Algorithm. phComputing and Informatics, 2010 (7): 1337--1348, 2010."},{"key":"e_1_3_2_2_17_1","doi-asserted-by":"publisher","DOI":"10.1016\/B978-0-12-417750-5.50022-1"},{"key":"e_1_3_2_2_18_1","volume-title":"Cornell Univ.","author":"Hopcroft J. E.","year":"1971","unstructured":"J. E. Hopcroft and R. M. Karp . A linear algorithm for testing equivalence of finite automata. TR 114 , Cornell Univ. , December 1971 . J. E. Hopcroft and R. M. Karp. A linear algorithm for testing equivalence of finite automata. TR 114, Cornell Univ., December 1971."},{"key":"e_1_3_2_2_19_1","volume-title":"phIntroduction to Automata Theory, Languages and Computation","author":"Hopcroft J. E.","year":"1979","unstructured":"J. E. Hopcroft and J. D. Ullman . phIntroduction to Automata Theory, Languages and Computation . Addison-Wesley , 1979 . J. E. Hopcroft and J. D. Ullman. phIntroduction to Automata Theory, Languages and Computation. Addison-Wesley, 1979."},{"key":"e_1_3_2_2_20_1","doi-asserted-by":"publisher","DOI":"10.1145\/1053468.1053470"},{"key":"e_1_3_2_2_21_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-28756-5_7"},{"key":"e_1_3_2_2_22_1","first-page":"2","article-title":"From set-theoretic coinduction to coalgebraic coinduction: some results, some problems","volume":"19","author":"Lenisa M.","year":"1999","unstructured":"M. Lenisa . From set-theoretic coinduction to coalgebraic coinduction: some results, some problems . ENTCS , 19 : 2 -- 22 , 1999 . M. Lenisa. From set-theoretic coinduction to coalgebraic coinduction: some results, some problems. ENTCS, 19: 2--22, 1999.","journal-title":"ENTCS"},{"key":"e_1_3_2_2_23_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-10373-5_33"},{"key":"e_1_3_2_2_24_1","doi-asserted-by":"publisher","DOI":"10.1145\/800125.804029"},{"key":"e_1_3_2_2_25_1","volume-title":"Prentice Hall","author":"Milner R.","year":"1989","unstructured":"R. Milner . Communication and Concurrency . Prentice Hall , 1989 . R. Milner. Communication and Concurrency. Prentice Hall, 1989."},{"key":"e_1_3_2_2_26_1","doi-asserted-by":"crossref","unstructured":"D.\n      Pous\n    .\n  Complete lattices and up-to techniques. APLAS vol. \n  4807\n   of \n  LNCS pages \n  351\n  --\n  366\n  . \n  Springer 2007\n  .   D. Pous. Complete lattices and up-to techniques. APLAS vol. 4807 of LNCS pages 351--366. Springer 2007.","DOI":"10.1007\/978-3-540-76637-7_24"},{"key":"e_1_3_2_2_27_1","doi-asserted-by":"crossref","unstructured":"J.\n      Rutten\n    .\n  Automata and coinduction (an exercise in coalgebra). CONCUR vol. \n  1466\n   of \n  LNCS pages \n  194\n  --\n  218\n  . \n  Springer 1998\n  .   J. Rutten. Automata and coinduction (an exercise in coalgebra). CONCUR vol. 1466 of LNCS pages 194--218. Springer 1998.","DOI":"10.1007\/BFb0055624"},{"key":"e_1_3_2_2_28_1","doi-asserted-by":"publisher","DOI":"10.1017\/S0960129598002527"},{"key":"e_1_3_2_2_29_1","doi-asserted-by":"publisher","DOI":"10.5555\/2103603"},{"key":"e_1_3_2_2_30_1","doi-asserted-by":"publisher","DOI":"10.1007\/11591191_28"},{"key":"e_1_3_2_2_31_1","doi-asserted-by":"publisher","DOI":"10.1007\/11817963_5"}],"event":{"name":"POPL '13: The 40th Annual ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages","location":"Rome Italy","acronym":"POPL '13","sponsor":["SIGPLAN ACM Special Interest Group on Programming Languages","SIGACT ACM Special Interest Group on Algorithms and Computation Theory"]},"container-title":["Proceedings of the 40th annual ACM SIGPLAN-SIGACT symposium on Principles of programming languages"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2429069.2429124","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/2429069.2429124","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T04:35:35Z","timestamp":1750221335000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2429069.2429124"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013,1,23]]},"references-count":30,"alternative-id":["10.1145\/2429069.2429124","10.1145\/2429069"],"URL":"https:\/\/doi.org\/10.1145\/2429069.2429124","relation":{"is-identical-to":[{"id-type":"doi","id":"10.1145\/2480359.2429124","asserted-by":"object"}]},"subject":[],"published":{"date-parts":[[2013,1,23]]},"assertion":[{"value":"2013-01-23","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}