{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,7]],"date-time":"2024-09-07T21:42:41Z","timestamp":1725745361129},"publisher-location":"Berlin, Heidelberg","reference-count":17,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642403125"},{"type":"electronic","value":"9783642403132"}],"license":[{"start":{"date-parts":[[2013,1,1]],"date-time":"2013-01-01T00:00:00Z","timestamp":1356998400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2013]]},"DOI":"10.1007\/978-3-642-40313-2_28","type":"book-chapter","created":{"date-parts":[[2013,8,16]],"date-time":"2013-08-16T10:36:43Z","timestamp":1376649403000},"page":"302-313","source":"Crossref","is-referenced-by-count":0,"title":["Complexity of Checking Bisimilarity between Sequential and Parallel Processes"],"prefix":"10.1007","author":[{"given":"Wojciech","family":"Czerwi\u0144ski","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Petr","family":"Jan\u010dar","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Martin","family":"Kot","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Zden\u011bk","family":"Sawa","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"28_CR1","unstructured":"Benedikt, M., G\u00f6ller, S., Kiefer, S., Murawski, A.: Bisimilarity of pushdown systems is nonelementary. In: Proc. 28th LiCS. IEEE Computer Society (to appear, 2013)"},{"key":"28_CR2","doi-asserted-by":"crossref","unstructured":"Burkart, O., Caucal, D., Moller, F., Steffen, B.: Verification on infinite structures. In: Handbook of Process Algebra, pp. 545\u2013623. Elsevier (2001)","DOI":"10.1016\/B978-044482830-9\/50027-8"},{"key":"28_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"423","DOI":"10.1007\/3-540-60246-1_148","volume-title":"Mathematical Foundations of Computer Science 1995","author":"O. Burkart","year":"1995","unstructured":"Burkart, O., Caucal, D., Steffen, B.: An elementary decision procedure for arbitrary context-free processes. In: H\u00e1jek, P., Wiedermann, J. (eds.) MFCS 1995. LNCS, vol.\u00a0969, pp. 423\u2013433. Springer, Heidelberg (1995)"},{"key":"28_CR4","doi-asserted-by":"publisher","first-page":"233","DOI":"10.1007\/s002360050159","volume":"36","author":"I. \u010cern\u00e1","year":"1999","unstructured":"\u010cern\u00e1, I., K\u0159et\u00ednsk\u00fd, M., Ku\u010dera, A.: Comparing expressibility of normed BPA and normed BPP processes. Acta Informatica\u00a036, 233\u2013256 (1999)","journal-title":"Acta Informatica"},{"issue":"5","key":"28_CR5","doi-asserted-by":"publisher","first-page":"782","DOI":"10.1016\/j.ic.2010.12.003","volume":"209","author":"W. Czerwinski","year":"2011","unstructured":"Czerwinski, W., Fr\u00f6schle, S.B., Lasota, S.: Partially-commutative context-free processes: Expressibility and tractability. Information and Computation\u00a0209(5), 782\u2013798 (2011)","journal-title":"Information and Computation"},{"issue":"1","key":"28_CR6","doi-asserted-by":"crossref","first-page":"13","DOI":"10.3233\/FI-1997-3112","volume":"31","author":"J. Esparza","year":"1997","unstructured":"Esparza, J.: Petri nets, commutative context-free grammars, and basic parallel processes. Fundamenta Informaticae\u00a031(1), 13\u201325 (1997)","journal-title":"Fundamenta Informaticae"},{"key":"28_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"412","DOI":"10.1007\/3-540-48523-6_38","volume-title":"Automata, Languages and Programming","author":"Y. Hirshfeld","year":"1999","unstructured":"Hirshfeld, Y., Jerrum, M.: Bisimulation equivalence is decidable for normed process algebra. In: Wiedermann, J., Van Emde Boas, P., Nielsen, M. (eds.) ICALP 1999. LNCS, vol.\u00a01644, pp. 412\u2013421. Springer, Heidelberg (1999)"},{"key":"28_CR8","doi-asserted-by":"publisher","first-page":"251","DOI":"10.1017\/S0960129500000992","volume":"6","author":"Y. Hirshfeld","year":"1996","unstructured":"Hirshfeld, Y., Jerrum, M., Moller, F.: A polynomial-time algorithm for deciding bisimulation equivalence of normed basic parallel processes. Mathematical Structures in Computer Science\u00a06, 251\u2013259 (1996)","journal-title":"Mathematical Structures in Computer Science"},{"key":"28_CR9","doi-asserted-by":"publisher","first-page":"143","DOI":"10.1016\/0304-3975(95)00064-X","volume":"158","author":"Y. Hirshfeld","year":"1996","unstructured":"Hirshfeld, Y., Jerrum, M., Moller, F.: A polynomial algorithm for deciding bisimilarity of normed context-free processes. Theor. Comput. Sci.\u00a0158, 143\u2013159 (1996)","journal-title":"Theor. Comput. Sci."},{"key":"28_CR10","doi-asserted-by":"crossref","unstructured":"Jan\u010dar, P.: Bisimilarity on basic process algebra is in 2-ExpTime (an explicit proof). Logical Methods in Computer Science\u00a09(1) (2013)","DOI":"10.2168\/LMCS-9(1:10)2013"},{"issue":"10","key":"28_CR11","doi-asserted-by":"publisher","first-page":"1193","DOI":"10.1016\/j.ic.2009.10.012","volume":"208","author":"P. Jan\u010dar","year":"2010","unstructured":"Jan\u010dar, P., Kot, M., Sawa, Z.: Complexity of deciding bisimilarity between normed BPA and normed BPP. Information and Computation\u00a0208(10), 1193\u20131205 (2010)","journal-title":"Information and Computation"},{"key":"28_CR12","unstructured":"Jan\u010dar, P.: Strong bisimilarity on basic parallel processes is PSPACE-complete. In: Proc. 18th LiCS, pp. 218\u2013227. IEEE Computer Society (2003)"},{"key":"28_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"159","DOI":"10.1007\/978-3-540-45187-7_10","volume-title":"CONCUR 2003 - Concurrency Theory","author":"P. Jan\u010dar","year":"2003","unstructured":"Jan\u010dar, P., Ku\u010dera, A., Moller, F.: Deciding bisimilarity between BPA and BPP processes. In: Amadio, R.M., Lugiez, D. (eds.) CONCUR 2003. LNCS, vol.\u00a02761, pp. 159\u2013173. Springer, Heidelberg (2003)"},{"issue":"4","key":"28_CR14","doi-asserted-by":"publisher","first-page":"101","DOI":"10.1016\/j.ipl.2012.12.004","volume":"113","author":"S. Kiefer","year":"2013","unstructured":"Kiefer, S.: BPA bisimilarity is EXPTIME-hard. Information Processing Letters\u00a0113(4), 101\u2013106 (2013)","journal-title":"Information Processing Letters"},{"issue":"5","key":"28_CR15","doi-asserted-by":"publisher","first-page":"1025","DOI":"10.1137\/S0097539700377256","volume":"34","author":"G. S\u00e9nizergues","year":"2005","unstructured":"S\u00e9nizergues, G.: The bisimulation problem for equational graphs of finite out-degree. SIAM J. Comput.\u00a034(5), 1025\u20131106 (2005)","journal-title":"SIAM J. Comput."},{"key":"28_CR16","doi-asserted-by":"crossref","first-page":"469","DOI":"10.1007\/s00236-003-0116-9","volume":"39","author":"J. Srba","year":"2003","unstructured":"Srba, J.: Strong bisimilarity of simple process algebras: Complexity lower bounds. Acta Informatica\u00a039, 469\u2013499 (2003)","journal-title":"Acta Informatica"},{"key":"28_CR17","doi-asserted-by":"crossref","unstructured":"Srba, J.: Roadmap of infinite results. In: Current Trends In Theoretical Computer Science, The Challenge of the New Century, vol.\u00a02, pp. 337\u2013350. World Scientific Publishing Co. (2004), for an updated version see http:\/\/users-cs.au.dk\/srba\/roadmap\/","DOI":"10.1142\/9789812562494_0054"}],"container-title":["Lecture Notes in Computer Science","Mathematical Foundations of Computer Science 2013"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-40313-2_28","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,8,1]],"date-time":"2020-08-01T23:23:37Z","timestamp":1596324217000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-40313-2_28"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013]]},"ISBN":["9783642403125","9783642403132"],"references-count":17,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-40313-2_28","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2013]]}}}