{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,28]],"date-time":"2025-10-28T00:26:26Z","timestamp":1761611186317},"publisher-location":"Berlin, Heidelberg","reference-count":23,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540647812"},{"type":"electronic","value":"9783540686811"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1998]]},"DOI":"10.1007\/bfb0055053","type":"book-chapter","created":{"date-parts":[[2006,8,1]],"date-time":"2006-08-01T08:08:05Z","timestamp":1154419685000},"page":"200-211","source":"Crossref","is-referenced-by-count":12,"title":["Deciding bisimulation-like equivalences with finite-state processes"],"prefix":"10.1007","author":[{"given":"Petr","family":"Jan\u010dar","sequence":"first","affiliation":[]},{"given":"Anton\u00edn","family":"Ku\u010dera","sequence":"additional","affiliation":[]},{"given":"Richard","family":"Mayr","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2006,5,26]]},"reference":[{"key":"18_CR1","unstructured":"Proceedings of CONCUR'96, volume 1119 of LNCS. Springer-Verlag, 1996."},{"key":"18_CR2","unstructured":"Proceedings of CONCUR'97, volume 1243 of LNCS. Springer-Verlag, 1997."},{"key":"18_CR3","doi-asserted-by":"publisher","first-page":"653","DOI":"10.1145\/174130.174141","volume":"40","author":"J.C.M. Baeten","year":"1993","unstructured":"J.C.M. Baeten, J.A. Bergstra, and J.W. Klop. Decidability of bisimulation equivalence for processes generating context-free languages. JACM, 40:653\u2013682, 1993.","journal-title":"JACM"},{"key":"18_CR4","doi-asserted-by":"crossref","unstructured":"I. \u010dern\u00e1, M. K\u0158et\u00ednsk\u00fd, and A. Ku\u010dera. Bisimilarity is decidable in the union of normed BPA and normed BPP processes. ENTCS, 6, 1997.","DOI":"10.1016\/S1571-0661(05)80675-9"},{"key":"18_CR5","doi-asserted-by":"crossref","unstructured":"S. Christensen, Y. Hirshfeld, and F. Moller. Bisimulation is decidable for all basic parallel processes. In Proceedings of CONCUR'93, volume 715 of LNCS, pages 143\u2013157. Springer-Verlag, 1993.","DOI":"10.1007\/3-540-57208-2_11"},{"key":"18_CR6","doi-asserted-by":"publisher","first-page":"143","DOI":"10.1006\/inco.1995.1129","volume":"121","author":"S. Christensen","year":"1995","unstructured":"S. Christensen, H. H\u00fcttel, and C. Stirling. Bisimulation equivalence is decidable for all context-free processes. Information and Computation, 121:143\u2013148, 1995.","journal-title":"Information and Computation"},{"key":"18_CR7","doi-asserted-by":"crossref","unstructured":"J. Esparza. Petri nets, commutative context-free grammars, and basic parallel processes. In Proceedings of FCT'95, volume 965 of LNCS, pages 221\u2013232. Springer-Verlag, 1995.","DOI":"10.1007\/3-540-60249-6_54"},{"issue":"2","key":"18_CR8","doi-asserted-by":"publisher","first-page":"281","DOI":"10.1016\/0304-3975(95)00037-W","volume":"148","author":"P. Jan\u010dar","year":"1995","unstructured":"P. Jan\u010dar. Undecidability of bisimilarity for Petri nets and some related problems. Theoretical Computer Science, 148(2):281\u2013301, 1995.","journal-title":"Theoretical Computer Science"},{"key":"18_CR9","doi-asserted-by":"crossref","unstructured":"P. Jan\u010dar and J. Esparza. Deciding finiteness of Petri nets up to bisimilarity. In Proceedings of ICALP'96, volume 1099 of LNCS, pages 478\u2013489. Springer-Verlag, 1996.","DOI":"10.1007\/3-540-61440-0_152"},{"key":"18_CR10","doi-asserted-by":"crossref","unstructured":"P. Jan\u010dar and A. Ku\u010dera. Bisimilarity of processes with finite-state systems. ENTCS, 9, 1997.","DOI":"10.1016\/S1571-0661(05)80428-1"},{"key":"18_CR11","doi-asserted-by":"crossref","unstructured":"P. Jan\u010dar, A. Ku\u010dera, and R. Mayr. Deciding bisimulation-like equivalences with finite-state processes. Technical report TUM-I9805, Technische Universit\u00e4t M\u00fcnchen, 1998.","DOI":"10.1007\/BFb0055053"},{"key":"18_CR12","doi-asserted-by":"crossref","unstructured":"P. Jan\u010dar and F. Moller. Checking regular properties of Petri nets. In Proceedings of CONCUR'95, volume 962 of LNCS, pages 348\u2013362. Springer-Verlag, 1995.","DOI":"10.1007\/3-540-60218-6_26"},{"key":"18_CR13","doi-asserted-by":"crossref","unstructured":"A. Ku\u010dera. How to parallelize sequential processes. In Proceedings of CONCUR'97 [2], pages 302\u2013316.","DOI":"10.1007\/3-540-63141-0_21"},{"key":"18_CR14","doi-asserted-by":"crossref","unstructured":"R. Mayr. Weak bisimulation and model checking for basic parallel processes. In Proceedings of FST&TCS'96, volume 1180 of LNCS, pages 88\u201399. Springer-Verlag, 1996.","DOI":"10.1007\/3-540-62034-6_40"},{"key":"18_CR15","doi-asserted-by":"crossref","unstructured":"R. Mayr. Model checking PA-processes. In Proceedings of CONCUR'97 [2], pages 332\u2013346.","DOI":"10.1007\/3-540-63141-0_23"},{"key":"18_CR16","doi-asserted-by":"crossref","unstructured":"R. Mayr. Process rewrite systems. ENTCS, 7, 1997.","DOI":"10.1016\/S1571-0661(05)80473-6"},{"key":"18_CR17","unstructured":"R. Mayr. Decidability and Complexity of Model Checking Problems for Infinite-State Systems. PhD thesis, TU-M\u00fcnchen, 1998."},{"key":"18_CR18","unstructured":"R. Milner. Communication and Concurrency. Prentice-Hall, 1989."},{"key":"18_CR19","doi-asserted-by":"crossref","unstructured":"F. Moller. Infinite results. In Proceedings of CONCUR'96 [1], pages 195\u2013216.","DOI":"10.1007\/3-540-61604-7_56"},{"key":"18_CR20","doi-asserted-by":"crossref","unstructured":"D.M.R. Park. Concurrency and automata on infinite sequences. In Proceedings 5th GI Conference, volume 104 of LNCS, pages 167\u2013183. Springer-Verlag, 1981.","DOI":"10.1007\/BFb0017309"},{"issue":"1","key":"18_CR21","doi-asserted-by":"publisher","first-page":"149","DOI":"10.1006\/inco.1994.1028","volume":"110","author":"B. Steffen","year":"1994","unstructured":"B. Steffen and A. Ing\u00f3lfsd\u00f3ttir. Characteristic formulae for processes with divergence. Information and Computation, 110(1):149\u2013163, 1994.","journal-title":"Information and Computation"},{"key":"18_CR22","doi-asserted-by":"crossref","unstructured":"C. Stirling. Decidability of bisimulation equivalence for normed pushdown processes. In Proceedings of CONCUR'96 [1], pages 217\u2013232.","DOI":"10.1007\/3-540-61604-7_57"},{"key":"18_CR23","first-page":"613","volume":"89","author":"R.J. Glabbeek van","year":"1989","unstructured":"R.J. van Glabbeek and W.P. Weijland. Branching time and abstraction in bisimulation semantics. Information Processing Letters, 89:613\u2013618, 1989.","journal-title":"Information Processing Letters"}],"container-title":["Lecture Notes in Computer Science","Automata, Languages and Programming"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BFb0055053","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,4,20]],"date-time":"2019-04-20T08:18:47Z","timestamp":1555748327000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BFb0055053"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1998]]},"ISBN":["9783540647812","9783540686811"],"references-count":23,"URL":"https:\/\/doi.org\/10.1007\/bfb0055053","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1998]]}}}