{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T13:28:27Z","timestamp":1725542907641},"publisher-location":"Berlin, Heidelberg","reference-count":18,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540373766"},{"type":"electronic","value":"9783540373773"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2006]]},"DOI":"10.1007\/11817949_2","type":"book-chapter","created":{"date-parts":[[2006,8,2]],"date-time":"2006-08-02T15:59:29Z","timestamp":1154534369000},"page":"16-36","source":"Crossref","is-referenced-by-count":0,"title":["Some Remarks on Definability of Process Graphs"],"prefix":"10.1007","author":[{"given":"Clemens","family":"Grabmayer","sequence":"first","affiliation":[]},{"given":"Jan Willem","family":"Klop","sequence":"additional","affiliation":[]},{"given":"Bas","family":"Luttik","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"doi-asserted-by":"crossref","unstructured":"Baeten, J.C.M., Bergstra, J.A.: Global renaming operators in concrete process algebra. Information and Computation, 205\u2013245 (1988)","key":"2_CR1","DOI":"10.1016\/0890-5401(88)90027-2"},{"issue":"3","key":"2_CR2","doi-asserted-by":"publisher","first-page":"653","DOI":"10.1145\/174130.174141","volume":"40","author":"J.C.M. Baeten","year":"1993","unstructured":"Baeten, J.C.M., Bergstra, J.A., Klop, J.W.: Decidability of bisimulation equivalence for process generating context-free languages. Journal of the ACM\u00a040(3), 653\u2013682 (1993)","journal-title":"Journal of the ACM"},{"key":"2_CR3","volume-title":"Cambridge Tracts in Theoretical Computer Science","author":"J.C.M. Baeten","year":"1990","unstructured":"Baeten, J.C.M., Weijland, W.P.: Process Algebra. In: Cambridge Tracts in Theoretical Computer Science, vol.\u00a018. Cambridge University Press, Cambridge (1990)"},{"key":"2_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"82","DOI":"10.1007\/3-540-13345-3_7","volume-title":"Automata, Languages, and Programming","author":"J.A. Bergstra","year":"1984","unstructured":"Bergstra, J.A., Klop, J.W.: The algebra of recursively defined processes and the algebra of regular processes. In: Paredaens, J. (ed.) ICALP 1984. LNCS, vol.\u00a0172, pp. 82\u201395. Springer, Heidelberg (1984)"},{"issue":"1\u20133","key":"2_CR5","doi-asserted-by":"publisher","first-page":"109","DOI":"10.1016\/S0019-9958(84)80025-X","volume":"60","author":"J.A. Bergstra","year":"1984","unstructured":"Bergstra, J.A., Klop, J.W.: Process algebra for synchronous communication. Information and Control\u00a060(1\u20133), 109\u2013137 (1984)","journal-title":"Information and Control"},{"key":"2_CR6","first-page":"61","volume-title":"CWI Monograph 4, Proceedings of the CWI Symposium Mathematics and Computer Science II","author":"J.A. Bergstra","year":"1986","unstructured":"Bergstra, J.A., Klop, J.W.: Process algebra: specification and verification in bisimulation semantics. In: Hazewinkel, M., Lenstra, J.K., Meertens, L.G.L.T. (eds.) CWI Monograph 4, Proceedings of the CWI Symposium Mathematics and Computer Science II, pp. 61\u201394. North-Holland, Amsterdam (1986)"},{"key":"2_CR7","doi-asserted-by":"crossref","first-page":"213","DOI":"10.3233\/FI-1987-10207","volume":"X","author":"J.A. Bergstra","year":"1987","unstructured":"Bergstra, J.A., Tiuryn, J.: Process algebra semantics for queues. Fundamenta Informaticae\u00a0X, 213\u2013224 (1987)","journal-title":"Fundamenta Informaticae"},{"doi-asserted-by":"crossref","unstructured":"Burkart, O., Caucal, D., Steffen, B.: Bisimulation collapse and the process taxonomy. In: Proceedings of CONCUR 1996 (1996)","key":"2_CR8","DOI":"10.1007\/3-540-61604-7_59"},{"key":"2_CR9","series-title":"Lecture Notes in Computer Science","first-page":"61","volume-title":"Graph-Theoretic Concepts in Computer Science","author":"D. Caucal","year":"1991","unstructured":"Caucal, D., Montfort, R.: On the transition graphs of automata and grammars. In: M\u00f6hring, R.H. (ed.) WG 1990. LNCS, vol.\u00a0484, pp. 61\u201386. Springer, Heidelberg (1991)"},{"issue":"4","key":"2_CR10","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(4), 339\u2013352 (1990)","journal-title":"Theoret. Inform. and Appl."},{"doi-asserted-by":"crossref","unstructured":"Caucal, D.: On the regular structure of prefix rewriting. Theoretical Computer Science (1992)","key":"2_CR11","DOI":"10.1016\/0304-3975(92)90278-N"},{"unstructured":"Christensen, S.: Decidability and Decompostion in Process Algebras. PhD thesis, University of Edinburgh (1993)","key":"2_CR12"},{"doi-asserted-by":"crossref","unstructured":"Christensen, S., Hirshfeld, Y., Moller, F.: Bisimulation equivalence is decidable for basic parallel processes. In: CONCUR, pp. 143\u2013157 (1993)","key":"2_CR13","DOI":"10.1007\/3-540-57208-2_11"},{"key":"2_CR14","doi-asserted-by":"publisher","first-page":"692","DOI":"10.1007\/BF01174375","volume":"33","author":"H. Freudenthal","year":"1931","unstructured":"Freudenthal, H.: \u00dcber die Enden topologischer R\u00e4ume und Gruppen. Mathematische Zeitschrift\u00a033, 692\u2013713 (1931)","journal-title":"Mathematische Zeitschrift"},{"doi-asserted-by":"crossref","unstructured":"Groote, J.F., van Ham, F.J.J.: Interactive visualization of large state spaces. International Journal on Software Tools for Technology Transfer (2005)","key":"2_CR15","DOI":"10.1007\/s10009-005-0198-5"},{"issue":"1","key":"2_CR16","doi-asserted-by":"publisher","first-page":"264","DOI":"10.1006\/inco.1999.2826","volume":"156","author":"R. Mayr","year":"2000","unstructured":"Mayr, R.: Process rewrite systems. Information and Computation\u00a0156(1), 264\u2013286 (2000)","journal-title":"Information and Computation"},{"key":"2_CR17","doi-asserted-by":"publisher","first-page":"295","DOI":"10.1016\/0022-0000(83)90003-X","volume":"26","author":"D.E. Muller","year":"1983","unstructured":"Muller, D.E., Schupp, P.E.: Groups, the theory of ends, and context-free languages. Journal of Computer and System Sciences\u00a026, 295\u2013310 (1983)","journal-title":"Journal of Computer and System Sciences"},{"key":"2_CR18","doi-asserted-by":"publisher","first-page":"51","DOI":"10.1016\/0304-3975(85)90087-8","volume":"37","author":"D.E. Muller","year":"1985","unstructured":"Muller, D.E., Schupp, P.E.: The theory of ends, pushdown automata, and second-order logic. Theoretical Computer Science\u00a037, 51\u201375 (1985)","journal-title":"Theoretical Computer Science"}],"container-title":["Lecture Notes in Computer Science","CONCUR 2006 \u2013 Concurrency Theory"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11817949_2.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,7,30]],"date-time":"2021-07-30T22:03:23Z","timestamp":1627682603000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11817949_2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006]]},"ISBN":["9783540373766","9783540373773"],"references-count":18,"URL":"https:\/\/doi.org\/10.1007\/11817949_2","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2006]]}}}