{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,16]],"date-time":"2026-03-16T09:33:58Z","timestamp":1773653638620,"version":"3.50.1"},"publisher-location":"Berlin, Heidelberg","reference-count":14,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540648963","type":"print"},{"value":"9783540684558","type":"electronic"}],"license":[{"start":{"date-parts":[[1998,1,1]],"date-time":"1998-01-01T00:00:00Z","timestamp":883612800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1998]]},"DOI":"10.1007\/bfb0055627","type":"book-chapter","created":{"date-parts":[[2006,7,27]],"date-time":"2006-07-27T07:31:00Z","timestamp":1153985460000},"page":"253-268","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":22,"title":["Simulation is decidable for one-counter nets"],"prefix":"10.1007","author":[{"given":"Parosh Aziz","family":"Abdulla","sequence":"first","affiliation":[]},{"given":"Karlis","family":"\u010cer\u0101ns","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2006,5,28]]},"reference":[{"key":"16_CR1","doi-asserted-by":"crossref","unstructured":"Parosh Aziz Abdulla and Bengt Jonsson. Verifying programs with unreliable channels. In Proc. 8th IEEE Int. Symp. on Logic in Computer Science, pages 160\u2013170, 1993.","DOI":"10.1109\/LICS.1993.287591"},{"key":"16_CR2","doi-asserted-by":"crossref","unstructured":"J.C.M. Baeten, J.A. Bergstra, and J.W. Klop. Decidability of bisimulation equivalence for processes generating context-free languages. Journal of the ACM, (40):653\u2013682, 1993.","DOI":"10.1145\/174130.174141"},{"key":"16_CR3","doi-asserted-by":"crossref","unstructured":"S. Christensen, Y. Hirshfeld, and F. Moller. Bisimulation equivalence is decidable for basic parallel processes. In Proc. CONCUR '93, Theories of Concurrency: Unification and Extension, pages 143\u2013157, 1993.","DOI":"10.1007\/3-540-57208-2_11"},{"key":"16_CR4","doi-asserted-by":"crossref","unstructured":"S. Christensen, H. H\u00fcttel, and C. Stirling. Bisimulation equivalence is decidable for all context-free processes. In W. R. Cleaveland, editor, Proc. CONCUR '92, Theories of Concurrency: Unification and Extension, pages 138\u2013147, 1992.","DOI":"10.1007\/BFb0084788"},{"key":"16_CR5","doi-asserted-by":"crossref","first-page":"221","DOI":"10.1007\/3-540-60249-6_54","volume":"965","author":"J. Esparza","year":"1995","unstructured":"J. Esparza. Petri nets, commutative context-free grammers, and basic parallel processes. In Proc. Fundementals of Computation Theory, number 965 in Lecture Notes in Computer Science, pages 221\u2013232, 1995.","journal-title":"Lecture Notes in Computer Science"},{"key":"16_CR6","doi-asserted-by":"crossref","unstructured":"J.F. Groote and H. H\u00fcttel. Undecidable equivelences for basic process algebra. Information and Computation, 1994.","DOI":"10.1006\/inco.1994.1101"},{"key":"16_CR7","doi-asserted-by":"crossref","unstructured":"P. Jan\u010dar. Undecidability of bisimilarity for Petri nets and related problem. Theoretical Computer Science, (148):281\u2013301, 1995.","DOI":"10.1016\/0304-3975(95)00037-W"},{"key":"16_CR8","doi-asserted-by":"crossref","unstructured":"P. Jan\u010dar. Bisimulation equivalence is decidable for one-counter processes. In Proc. ICALP '97, pages 549\u2013559, 1997.","DOI":"10.1007\/3-540-63165-8_210"},{"key":"16_CR9","doi-asserted-by":"crossref","first-page":"478","DOI":"10.1007\/3-540-61440-0_152","volume":"number 1099","author":"P. Jan\u010dar","year":"1996","unstructured":"P. Jan\u010dar and J. Esparza. Deciding finiteness of petri nets up to bisimulation. In Proc. ICALP '96, number 1099 in Lecture Notes in Computer Science, pages 478\u2013489, 1996.","journal-title":"Lecture Notes in Computer Science"},{"key":"16_CR10","doi-asserted-by":"crossref","unstructured":"P. Jan\u010dar and F. Moller. Checking regular properties of Petri nets. In Proc. CONCUR '95, 6th Int. Conf. on Concurrency Theory, pages 348\u2013362, 1995.","DOI":"10.1007\/3-540-60218-6_26"},{"key":"16_CR11","unstructured":"Mats Kindahl. Results on decidability of simulation and bisimulation for lossy channel systems. Technical Report 91, Department of Computer Systems, Uppsala University, May 1997. Licentiate Thesis."},{"key":"16_CR12","doi-asserted-by":"crossref","unstructured":"C. Stirling. Local model checking games. In Proc. CONCUR '95, 6th Int. Conf. on Concurrency Theory, volume 962 of Lecture Notes in Computer Science, pages 1\u201311. Springer Verlag, 1995.","DOI":"10.1007\/3-540-60218-6_1"},{"key":"16_CR13","doi-asserted-by":"crossref","unstructured":"C. Stirling. Decidability of bisimulation equivalence for normed pushdown processes. In Proc. CONCUR '96, 7th Int. Conf. on Concurrency Theory, volume 1119 of Lecture Notes in Computer Science, pages 217\u2013232. Springer Verlag, 1996.","DOI":"10.1007\/3-540-61604-7_57"},{"key":"16_CR14","doi-asserted-by":"crossref","unstructured":"W. Thomas. On the synthesis of strategies in infinite games. In STACS 95, volume 900 of Lect. Notes in Comput. Sci., pages 1\u201313. Springer-Verlag, 1995.","DOI":"10.1007\/3-540-59042-0_57"}],"container-title":["Lecture Notes in Computer Science","CONCUR'98 Concurrency Theory"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BFb0055627","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,1,10]],"date-time":"2025-01-10T03:08:17Z","timestamp":1736478497000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BFb0055627"}},"subtitle":["Extended abstract"],"short-title":[],"issued":{"date-parts":[[1998]]},"ISBN":["9783540648963","9783540684558"],"references-count":14,"URL":"https:\/\/doi.org\/10.1007\/bfb0055627","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[1998]]},"assertion":[{"value":"28 May 2006","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}