{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,9]],"date-time":"2024-09-09T18:21:04Z","timestamp":1725906064892},"publisher-location":"Cham","reference-count":22,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319631202"},{"type":"electronic","value":"9783319631219"}],"license":[{"start":{"date-parts":[[2017,1,1]],"date-time":"2017-01-01T00:00:00Z","timestamp":1483228800000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2017]]},"DOI":"10.1007\/978-3-319-63121-9_10","type":"book-chapter","created":{"date-parts":[[2017,7,24]],"date-time":"2017-07-24T04:05:15Z","timestamp":1500869115000},"page":"199-210","source":"Crossref","is-referenced-by-count":0,"title":["Negative Results on Decidability and Small Model Property of Process Equations"],"prefix":"10.1007","author":[{"given":"Xinxin","family":"Liu","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2017,7,25]]},"reference":[{"issue":"3","key":"10_CR1","doi-asserted-by":"crossref","first-page":"560","DOI":"10.1145\/828.833","volume":"31","author":"SD Brookes","year":"1984","unstructured":"Brookes, S.D., Hoare, C.A.R., Roscoe, A.W.: A theory of communicating sequential processes. J. ACM 31(3), 560\u2013599 (1984)","journal-title":"J. ACM"},{"issue":"1","key":"10_CR2","doi-asserted-by":"crossref","first-page":"232","DOI":"10.1145\/200836.200876","volume":"42","author":"B Bloom","year":"1995","unstructured":"Bloom, B., Istrail, S., Meyer, A.R.: Bisimulation can\u2019t be traced. J. ACM 42(1), 232\u2013268 (1995)","journal-title":"J. ACM"},{"key":"10_CR3","doi-asserted-by":"crossref","first-page":"77","DOI":"10.1016\/0304-3975(85)90088-X","volume":"37","author":"JA Bergstra","year":"1985","unstructured":"Bergstra, J.A., Klop, J.W.: Algebra of communicating processes with abstraction. Theoret. Comput. Sci. 37, 77\u2013121 (1985)","journal-title":"Theoret. Comput. Sci."},{"key":"10_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"423","DOI":"10.1007\/BFb0035774","volume-title":"Automata, Languages and Programming","author":"JF Groote","year":"1989","unstructured":"Groote, J.F., Vaandrager, F.: Structured operational semantics and bisimulation as a congruence. In: Ausiello, G., Dezani-Ciancaglini, M., Rocca, S.R. (eds.) ICALP 1989. LNCS, vol. 372, pp. 423\u2013438. Springer, Heidelberg (1989). doi:\n10.1007\/BFb0035774"},{"key":"10_CR5","series-title":"Prentice Hall International Series in Computer Science","volume-title":"Communicating Sequential Processes","author":"CAR Hoare","year":"1985","unstructured":"Hoare, C.A.R.: Communicating Sequential Processes. Prentice Hall International Series in Computer Science. Prentice Hall, Upper Saddle River (1985)"},{"key":"10_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"247","DOI":"10.1007\/3-540-57208-2_18","volume-title":"CONCUR 1993","author":"OH Jensen","year":"1993","unstructured":"Jensen, O.H., Jeppesen, C., Lang, J.T., Larsen, K.G.: Model construction for implicit specifications in modal logic. In: Best, E. (ed.) CONCUR 1993. LNCS, vol. 715, pp. 247\u2013261. Springer, Heidelberg (1993). doi:\n10.1007\/3-540-57208-2_18"},{"key":"10_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"348","DOI":"10.1007\/BFb0012782","volume-title":"Automata, Languages and Programming","author":"D Kozen","year":"1982","unstructured":"Kozen, D.: Results on the propositional \n            \n$$\\mu $$\n\n          -calculus. In: Nielsen, M., Schmidt, E.M. (eds.) ICALP 1982. LNCS, vol. 140, pp. 348\u2013359. Springer, Heidelberg (1982). doi:\n10.1007\/BFb0012782"},{"key":"10_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"313","DOI":"10.1007\/3-540-12896-4_370","volume-title":"Logics of Programs","author":"D Kozen","year":"1984","unstructured":"Kozen, D., Parikh, R.: A decision procedure for the propositional \n            \n$$\\mu $$\n\n          -calculus. In: Clarke, E., Kozen, D. (eds.) Logic of Programs 1983. LNCS, vol. 164, pp. 313\u2013325. Springer, Heidelberg (1984). doi:\n10.1007\/3-540-12896-4_370"},{"key":"10_CR9","unstructured":"Liu, X.: Specification and decomposition in concurrency. Ph.D. thesis, University of Aalborg, Fredrik Bajers Vej 7, DK 9220 Aalborg \u00f8, Denmark (1992)"},{"issue":"1","key":"10_CR10","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/0890-5401(91)90030-6","volume":"94","author":"KG Larsen","year":"1991","unstructured":"Larsen, K.G., Skou, A.: Bisimulation through probabilistic testing. Inf. Comput. 94(1), 1\u201328 (1991)","journal-title":"Inf. Comput."},{"key":"10_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"526","DOI":"10.1007\/BFb0032056","volume-title":"Automata, Languages and Programming","author":"KG Larsen","year":"1990","unstructured":"Larsen, K.G., Xinxin, L.: Compositionality through an operational semantics of contexts. In: Paterson, M.S. (ed.) ICALP 1990. LNCS, vol. 443, pp. 526\u2013539. Springer, Heidelberg (1990). doi:\n10.1007\/BFb0032056"},{"key":"10_CR12","doi-asserted-by":"crossref","unstructured":"Larsen, K.G., Xinxin, L.: Equation solving using modal transition systems. In: Proceedings of the Fifth Annual Symposium on Logic in Computer Science (LICS 1990), Philadelphia, Pennsylvania, USA, 4\u20137 June 1990, pp. 108\u2013117. IEEE Computer Society (1990)","DOI":"10.1109\/LICS.1990.113738"},{"key":"10_CR13","series-title":"Lecture Notes in Computer Science","volume-title":"A Calculus of Communicating Systems","year":"1980","unstructured":"Milner, R. (ed.): A Calculus of Communicating Systems. LNCS, vol. 92. Springer, Heidelberg (1980)"},{"key":"10_CR14","series-title":"Prentice-Hall International Series in Computer Science","volume-title":"Communication and Concurrency","author":"R Milner","year":"1989","unstructured":"Milner, R.: Communication and Concurrency. Prentice-Hall International Series in Computer Science. Prentice Hall, Upper Saddle River (1989)"},{"issue":"1","key":"10_CR15","doi-asserted-by":"crossref","first-page":"83","DOI":"10.1016\/0304-3975(84)90113-0","volume":"34","author":"R Nicola De","year":"1984","unstructured":"De Nicola, R., Hennessy, M.: Testing equivalence for processes. Theoret. Comput. Sci. 34(1), 83\u2013133 (1984)","journal-title":"Theoret. Comput. Sci."},{"issue":"2","key":"10_CR16","doi-asserted-by":"crossref","first-page":"175","DOI":"10.1016\/0304-3975(89)90128-X","volume":"68","author":"J Parrow","year":"1989","unstructured":"Parrow, J.: Submodule construction as equation solving in CCS. Theoret. Comput. Sci. 68(2), 175\u2013202 (1989)","journal-title":"Theoret. Comput. Sci."},{"key":"10_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"427","DOI":"10.1007\/BFb0039075","volume-title":"CONCUR 1990 Theories of Concurrency: Unification and Extension","author":"H Qin","year":"1990","unstructured":"Qin, H., Lewis, P.: Factorization of finite state machines under observational equivalence. In: Baeten, J.C.M., Klop, J.W. (eds.) CONCUR 1990. LNCS, vol. 458, pp. 427\u2013441. Springer, Heidelberg (1990). doi:\n10.1007\/BFb0039075"},{"issue":"3","key":"10_CR18","doi-asserted-by":"crossref","first-page":"249","DOI":"10.1016\/0890-5401(89)90031-X","volume":"81","author":"RS Streett","year":"1989","unstructured":"Streett, R.S., Emerson, E.A.: An automata theoretic decision procedure for the propositional mu-calculus. Inf. Comput. 81(3), 249\u2013264 (1989)","journal-title":"Inf. Comput."},{"key":"10_CR19","unstructured":"Shields, M.W.: A note on the simple interface equation. Technical report, University of Kent at Canterbury (1989)"},{"issue":"1","key":"10_CR20","doi-asserted-by":"crossref","first-page":"149","DOI":"10.1006\/inco.1994.1028","volume":"110","author":"B Steffen","year":"1994","unstructured":"Steffen, B., Ingolfsdottir, A.: Characteristic formulas for processes with divergence. Inf. Comput. 110(1), 149\u2013163 (1994)","journal-title":"Inf. Comput."},{"issue":"3","key":"10_CR21","doi-asserted-by":"crossref","first-page":"555","DOI":"10.1145\/233551.233556","volume":"43","author":"RJ Glabbeek van","year":"1996","unstructured":"van Glabbeek, R.J., Weijland, W.P.: Branching time and abstraction in bisimulation semantics. J. ACM 43(3), 555\u2013600 (1996)","journal-title":"J. ACM"},{"key":"10_CR22","unstructured":"Zeeberg, M., Ingolfsdottir, A., Godskesen, J.C.: Fra Hennessy-Milner logik til CCS-processer. Master\u2019s thesis, Aalborg University (1987)"}],"container-title":["Lecture Notes in Computer Science","Models, Algorithms, Logics and Tools"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-63121-9_10","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,7,24]],"date-time":"2017-07-24T04:09:36Z","timestamp":1500869376000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-63121-9_10"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017]]},"ISBN":["9783319631202","9783319631219"],"references-count":22,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-63121-9_10","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2017]]}}}