{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2020,4,12]],"date-time":"2020-04-12T09:33:58Z","timestamp":1586684038385},"publisher-location":"Berlin, Heidelberg","reference-count":27,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540664253","type":"print"},{"value":"9783540483205","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1999]]},"DOI":"10.1007\/3-540-48320-9_5","type":"book-chapter","created":{"date-parts":[[2007,11,15]],"date-time":"2007-11-15T08:52:42Z","timestamp":1195116762000},"page":"30-45","source":"Crossref","is-referenced-by-count":10,"title":["Techniques for Decidability and Undecidability of Bisimilarity"],"prefix":"10.1007","author":[{"given":"Petr","family":"Jan\u010dar","sequence":"first","affiliation":[]},{"given":"Faron","family":"Moller","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2002,4,19]]},"reference":[{"key":"5_CR1","series-title":"Lect Notes Comput Sci","first-page":"653","volume-title":"Journal of the ACM","author":"J. C. M. Baeten","year":"1987","unstructured":"J. C. M. Baeten, J. A. Bergstra and J. W. Klop (1993). Decidability of bisimulation equivalence for processes generating context-free languages. Journal of the ACM 40:653\u2013682. (Preliminary version in the proceedings of PARLE\u201987, Lecture Notes in Computer Science 259:94-113, 1987)."},{"key":"5_CR2","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"423","DOI":"10.1007\/3-540-60246-1_148","volume-title":"Proceedings of MFCS\u201995","author":"O. Burkart","year":"1995","unstructured":"O. Burkart, D. Caucal and B. Steffen (1995). An elementary decision procedure for arbitrary context-free processes. Proceedings of MFCS\u201995. Lecture Notes in Computer Science 969:423\u2013433."},{"key":"5_CR3","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"143","DOI":"10.1007\/3-540-57208-2_11","volume-title":"Proceedings of CONCUR\u201993","author":"S. Christensen","year":"1993","unstructured":"S. Christensen, Y. Hirshfeld and F. Moller (1993). Bisimulation equivalence is decidable for basic parallel processes. Proceedings of CONCUR\u201993, Lecture Notes in Computer Science 715:143\u2013157."},{"key":"5_CR4","series-title":"Lect Notes Comput Sci","first-page":"143","volume-title":"Information and Computation","author":"S. Christensen","year":"1992","unstructured":"S. Christensen, H. H\u00fcttel and C. Stirling (1995). Bisimulation equivalence is decidable for all context-free processes. Information and Computation 121(2):143\u2013148. (Preliminary version in the proceedings of CONCUR\u201992, Lecture Notes in Computer Science 630:138-147, 1992)."},{"key":"5_CR5","doi-asserted-by":"publisher","first-page":"173","DOI":"10.1016\/0021-8693(69)90070-2","volume":"13","author":"S. Eilenberg","year":"1969","unstructured":"S. Eilenberg and M. P. Sch\u00fctzenberger (1969). Rational sets in commutative monoids. Journal of Algebra 13:173\u2013191.","journal-title":"Journal of Algebra"},{"key":"5_CR6","doi-asserted-by":"publisher","first-page":"413","DOI":"10.2307\/2370405","volume":"35","author":"L. E. Dickson","year":"1913","unstructured":"L. E. Dickson (1913). Finiteness of the odd perfect and primitive abundant numbers with distinct factors. American Journal of Mathematics 35:413\u2013422.","journal-title":"American Journal of Mathematics"},{"key":"5_CR7","unstructured":"Y. Hirshfeld (1994). Congruences in commutative semigroups. Research Report ECS-LFCS-94-291, Department of Computer Science, University of Edinburgh."},{"key":"5_CR8","unstructured":"Y. Hirshfeld (1997). Bisimulation trees and the decidability of weak bisimulations. Electronic Notes in Theoretical Computer Science 5, http:\/\/www.elsevier.nl\/locate\/entcs\/volume5.html .","DOI":"10.1016\/S1571-0661(05)80674-7","doi-asserted-by":"crossref"},{"key":"5_CR9","author":"Y. Hirshfeld","year":"1999","unstructured":"Y. Hirshfeld and M. Jerrum (1999). Bisimulation equivalence is decidable for normed Process Algebra. Proceedings of ICALP\u201999, to appear, Lecture Notes in Computer Science 1644.","series-title":"Lect Notes Comput Sci","volume-title":"Proceedings of ICALP\u201999, to appear"},{"key":"5_CR10","doi-asserted-by":"publisher","first-page":"143","DOI":"10.1016\/0304-3975(95)00064-X","volume":"158","author":"Y. Hirshfeld","year":"1996","unstructured":"Y. Hirshfeld, M. Jerrum and F. Moller (1996). A polynomial algorithm for deciding bisimilarity of normed context-free processes. Theoretical Computer Science 158:143\u2013159. (Preliminary version in the proceedings of FOCS\u201994:623-631, 1994).","journal-title":"Theoretical Computer Science"},{"key":"5_CR11","doi-asserted-by":"publisher","first-page":"251","DOI":"10.1017\/S0960129500000992","volume":"6","author":"Y. Hirshfeld","year":"1996","unstructured":"Y. Hirshfeld, M. Jerrum and F. Moller (1996). A polynomial algorithm for deciding bisimulation equivalence of normed basic parallel processes. Mathematical Structures in Computer Science 6:251\u2013259.","journal-title":"Mathematical Structures in Computer Science"},{"key":"5_CR12","series-title":"Lect Notes Comput Sci","first-page":"281","volume-title":"Theoretical Computer Science","author":"P. Jan\u010dar","year":"1994","unstructured":"P. Jan\u010dar (1995). Undecidability of bisimilarity for Petri nets and related problems. Theoretical Computer Science 148:281\u2013301. (Preliminary version in the proceedings of STACS\u201994, Lecture Notes in Computer Science 775:581-592, 1994)."},{"key":"5_CR13","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"549","DOI":"10.1007\/3-540-63165-8_210","volume-title":"Proceedings of ICALP\u201997","author":"P. Jan\u010dar","year":"1997","unstructured":"P. Jan\u010dar (1997). Bisimulation equivalence is decidable for one-counter processes. Proceedings of ICALP\u201997, Lecture Notes in Computer Science 1256:549\u2013559. (To appear in Information and Computation)."},{"key":"5_CR14","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"200","DOI":"10.1007\/BFb0055053","volume-title":"Proceedings of ICALP\u201998","author":"P. Jan\u010dar","year":"1998","unstructured":"P. Jan\u010dar, A. Ku\u010dera and R. Mayr (1998). Deciding bisimulation-like equivalences with finite-state processes. Proceedings of ICALP\u201998, Lecture Notes in Computer Science 1443:200\u2013211. (To appear in Theoretical Computer Science)."},{"key":"5_CR15","unstructured":"P. Jan\u010dar, J. Esparza and F. Moller (1999). Petri nets and regular processes. Journal of Computer and System Sciences (to appear). (Research Report 162, Computing Science Department, Uppsala University.","DOI":"10.1006\/jcss.1999.1643","doi-asserted-by":"crossref"},{"key":"5_CR16","unstructured":"P. Jan\u010dar and F. Moller (1999). Simulation of one-counter nets via colouring. Research Report 159, Computing Science Department, Uppsala University."},{"key":"5_CR17","doi-asserted-by":"publisher","first-page":"43","DOI":"10.1016\/0890-5401(90)90025-D","volume":"86","author":"P. C. Kanellakis","year":"1990","unstructured":"P. C. Kanellakis and S. A. Smolka. CCS expressions, finite-state processes and three problems of equivalence. Information and Computation 86:43\u201368, 1990.","journal-title":"Information and Computation"},{"key":"5_CR18","doi-asserted-by":"publisher","first-page":"441","DOI":"10.1137\/0213029","volume":"13","author":"E. Mayr","year":"1984","unstructured":"E. Mayr (1984). An algorithm for the general Petri net reachability problem. SIAM Journal of Computing 13:441\u2013460.","journal-title":"SIAM Journal of Computing"},{"key":"5_CR19","doi-asserted-by":"publisher","first-page":"305329","DOI":"10.1016\/0001-8708(82)90048-2","volume":"46","author":"E. W. Mayr","year":"1982","unstructured":"E. W. Mayr and A. R. Meyer (1982). The complexity of the word problems for commutative semigroups and polynomial ideals. Advances in Mathematics 46:305329.","journal-title":"Advances in Mathematics"},{"key":"5_CR20","doi-asserted-by":"publisher","first-page":"357","DOI":"10.1016\/0304-3975(93)90176-T","volume":"107","author":"R. Milner","year":"1993","unstructured":"R. Milner and F. Moller (1993). Unique decomposition of processes. Theoretical Computer Science 107:357\u2013363. (Preliminary version in the Bulletin of the EATCS 41:226-232, 1990.)","journal-title":"Theoretical Computer Science"},{"key":"5_CR21","unstructured":"M. Minsky (1967). Computation: Finite and Infinite Machines. PrenticeHall."},{"key":"5_CR22","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"195","DOI":"10.1007\/3-540-61604-7_56","volume-title":"Infinite results. Proceedings of CONCUR\u201996","author":"F. Moller","year":"1996","unstructured":"F. Moller (1996). Infinite results. Proceedings of CONCUR\u201996, Lecture Notes in Computer Science 1119:195\u2013216."},{"key":"5_CR23","doi-asserted-by":"crossref","first-page":"323","DOI":"10.1016\/0022-0000(78)90021-1","volume":"16","author":"D. C. Oppen","year":"1978","unstructured":"D. C. Oppen (1978). A 222p(n) upper bound on the complexity of Presburger arithmetic. Journal of Computer and System Science 16:323\u2013332.","journal-title":"Journal of Computer and System Science"},{"key":"5_CR24","doi-asserted-by":"publisher","first-page":"937","DOI":"10.1137\/0216062","volume":"16","author":"R. Paige","year":"1987","unstructured":"R. Paige and R. E. Tarjan. Three partition refinement algorithms. SIAM Journal on Computing 16:937\u2013989, 1987.","journal-title":"SIAM Journal on Computing"},{"key":"5_CR25","unstructured":"L. Redei (1965). The theory of finitely generated commutative semigroups. Oxford University Press."},{"key":"5_CR26","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"671","DOI":"10.1007\/3-540-63165-8_221","volume-title":"Proceedings of ICALP\u201997","author":"G. S\u00e9nizergues","year":"1997","unstructured":"G. S\u00e9nizergues (1997). The Equivalence Problem for Deterministic Pushdown Automata is Decidable. Proceedings of ICALP\u201997, Lecture Notes in Computer Science 1256:671\u2013681."},{"key":"5_CR27","series-title":"Lect Notes Comput Sci","first-page":"113","volume-title":"Theoretical Computer Science","author":"C. Stirling","year":"1998","unstructured":"C. Stirling (1998). Decidability of bisimulation equivalence for normed pushdown processes. Theoretical Computer Science 195:113\u2013131. (Preliminary version in the proceedings of CONCUR\u201996, Lecture Notes in Computer Science 1119:217-232, 1996)."}],"container-title":["CONCUR\u201999 Concurrency Theory","Lecture Notes in Computer Science"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-48320-9_5","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,4]],"date-time":"2019-05-04T09:06:53Z","timestamp":1556960813000},"score":1.0,"subtitle":[],"short-title":[],"issued":{"date-parts":[[1999]]},"ISBN":["9783540664253","9783540483205"],"references-count":27,"URL":"http:\/\/dx.doi.org\/10.1007\/3-540-48320-9_5","relation":{"cites":[]},"ISSN":["0302-9743"],"issn-type":[{"value":"0302-9743","type":"print"}]}}