{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T22:51:03Z","timestamp":1725490263088},"publisher-location":"Berlin, Heidelberg","reference-count":11,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540752202"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/978-3-540-75221-9_22","type":"book-chapter","created":{"date-parts":[[2007,8,30]],"date-time":"2007-08-30T10:33:13Z","timestamp":1188469993000},"page":"472-482","source":"Crossref","is-referenced-by-count":0,"title":["Expansive-Bisimulation for Context-Free Processes"],"prefix":"10.1007","author":[{"given":"Xinxin","family":"Liu","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"22_CR1","series-title":"Lecture Notes in Computer Science","volume-title":"PARLE Parallel Architectures and Languages Europe","author":"J.C.M. Baeten","year":"1987","unstructured":"Baeten, J.C.M., Bergstra, J.A., Klop, J.W.: Decidability of bisimulation equivalence for processes generating context-free languages. In: de Bakker, J.W., Nijman, A.J., Treleaven, P.C. (eds.) PARLE Parallel Architectures and Languages Europe. LNCS, vol.\u00a0259, Springer, Heidelberg (1987)"},{"key":"22_CR2","series-title":"Lecture Notes in Computer Science","volume-title":"Mathematical Foundations of Computer Science 1995","author":"O. Burkart","year":"1995","unstructured":"Burkart, O., Caucal, D., Steffen, B.: An elementary bisimulation decision procedure for arbitrary context-free processes. In: H\u00e1jek, P., Wiedermann, J. (eds.) MFCS 1995. LNCS, vol.\u00a0969, Springer, Heidelberg (1995)"},{"key":"22_CR3","volume-title":"Handbook of Process Algebra","author":"J. Bergstra","year":"2001","unstructured":"Bergstra, J., Ponse, A., Smolka, S.: Handbook of Process Algebra. Elsevier, Amsterdam (2001)"},{"key":"22_CR4","doi-asserted-by":"crossref","first-page":"339","DOI":"10.1051\/ita\/1990240403391","volume":"24","author":"D. Caucal","year":"1990","unstructured":"Caucal, D.: Graphes canoniques de graphes alg\u00e9briques. Theoret. Inform. and Appl.\u00a024, 339\u2013352 (1990)","journal-title":"Theoret. Inform. and Appl."},{"key":"22_CR5","series-title":"Lecture Notes in Computer Science","volume-title":"CONCUR \u201992","author":"S. Christensen","year":"1992","unstructured":"Christensen, S., H\u00fcttel, H., Stirling, C.: Bisimulation equivalence is decidable for all context-free processes. In: Cleaveland, W.R. (ed.) CONCUR 1992. LNCS, vol.\u00a0630, Springer, Heidelberg (1992)"},{"key":"22_CR6","doi-asserted-by":"publisher","first-page":"183","DOI":"10.1016\/0304-3975(92)00078-6","volume":"12","author":"D.T. Huynh","year":"1994","unstructured":"Huynh, D.T., Tian, L.: Deciding bisimilarity of normed context-free processes is in \n                  \n                    \n                  \n                  $\\sigma^p_2$\n                . Theoretical Computer Science\u00a012, 183\u2013197 (1994)","journal-title":"Theoretical Computer Science"},{"key":"22_CR7","doi-asserted-by":"publisher","first-page":"167","DOI":"10.1016\/0020-0190(92)90142-I","volume":"42","author":"J.F. Groote","year":"1991","unstructured":"Groote, J.F.: A short proof of the decidability of bisimulation for normed bpa-processes. Inform. process. lett.\u00a042, 167\u2013171 (1991)","journal-title":"Inform. process. lett."},{"key":"22_CR8","doi-asserted-by":"publisher","first-page":"143","DOI":"10.1016\/0304-3975(95)00064-X","volume":"15","author":"Y. Hirshfeld","year":"1996","unstructured":"Hirshfeld, Y., Jerrum, M., Moller, F.: A polynomial algorithm for deciding bisimulation of normed context-free processes. Theoretical Computer Science\u00a015, 143\u2013159 (1996)","journal-title":"Theoretical Computer Science"},{"key":"22_CR9","unstructured":"H\u00fcttel, H., Stirling, C.: Action speaks louder than words: Proving bisimilarity for context-free processes. In: Proceedings on Logic in Computer Science (1991)"},{"key":"22_CR10","unstructured":"Milner, R.: A complete inference system for a class of regular behaviours. CSR 111\u201382, University of Edinburgh, Department of Computer Science (1982)"},{"key":"22_CR11","unstructured":"Srba, J.: Roadmap of infinite results, \n                  \n                    http:\/\/www.brics.dk\/~srba\/roadmap"}],"container-title":["Lecture Notes in Computer Science","Formal Methods and Hybrid Real-Time Systems"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-75221-9_22.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T10:56:26Z","timestamp":1619520986000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-75221-9_22"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["9783540752202"],"references-count":11,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-75221-9_22","relation":{},"subject":[]}}