{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T20:59:54Z","timestamp":1725569994662},"publisher-location":"Berlin, Heidelberg","reference-count":19,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642171635"},{"type":"electronic","value":"9783642171642"}],"license":[{"start":{"date-parts":[[2010,1,1]],"date-time":"2010-01-01T00:00:00Z","timestamp":1262304000000},"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":[[2010]]},"DOI":"10.1007\/978-3-642-17164-2_28","type":"book-chapter","created":{"date-parts":[[2010,11,19]],"date-time":"2010-11-19T10:54:39Z","timestamp":1290164079000},"page":"408-423","source":"Crossref","is-referenced-by-count":2,"title":["Model Independent Order Relations for Processes"],"prefix":"10.1007","author":[{"given":"Chaodong","family":"He","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"issue":"2","key":"28_CR1","doi-asserted-by":"publisher","first-page":"279","DOI":"10.1006\/inco.1995.1114","volume":"120","author":"M. Boreale","year":"1995","unstructured":"Boreale, M., De Nicola, R.: Testing equivalence for mobile processes. Inf. Comput.\u00a0120(2), 279\u2013303 (1995)","journal-title":"Inf. Comput."},{"key":"28_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"313","DOI":"10.1007\/3-540-60218-6_23","volume-title":"CONCUR \u201995 Concurrency Theory","author":"E. Brinksma","year":"1995","unstructured":"Brinksma, E., Rensink, A., Vogler, W.: Fair testing. In: Lee, I., Smolka, S.A. (eds.) CONCUR 1995. LNCS, vol.\u00a0962, pp. 313\u2013327. Springer, Heidelberg (1995)"},{"issue":"11-13","key":"28_CR3","doi-asserted-by":"publisher","first-page":"1387","DOI":"10.1016\/j.tcs.2009.11.011","volume":"411","author":"Y. Fu","year":"2010","unstructured":"Fu, Y., Lu, H.: On the expressiveness of interaction. Theor. Comput. Sci.\u00a0411(11-13), 1387\u20131451 (2010)","journal-title":"Theor. Comput. Sci."},{"key":"28_CR4","doi-asserted-by":"crossref","unstructured":"He, C.: Model independent order relations for processes (2010), http:\/\/basics.sjtu.edu.cn\/~chaodong\/","DOI":"10.1007\/978-3-642-17164-2_28"},{"key":"28_CR5","doi-asserted-by":"crossref","unstructured":"He, C.: Model independent order relations for processes (2010), http:\/\/basics.sjtu.edu.cn\/~chaodong\/","DOI":"10.1007\/978-3-642-17164-2_28"},{"key":"28_CR6","volume-title":"Communication and Concurrency","author":"R. Milner","year":"1989","unstructured":"Milner, R.: Communication and Concurrency. Prentice-Hall, Inc., Upper Saddle River (1989)"},{"issue":"1","key":"28_CR7","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/0890-5401(92)90008-4","volume":"100","author":"R. Milner","year":"1992","unstructured":"Milner, R., Parrow, J., Walker, D.: A calculus of mobile processes, i. Inf. Comput.\u00a0100(1), 1\u201340 (1992)","journal-title":"Inf. Comput."},{"issue":"1","key":"28_CR8","doi-asserted-by":"publisher","first-page":"41","DOI":"10.1016\/0890-5401(92)90009-5","volume":"100","author":"R. Milner","year":"1992","unstructured":"Milner, R., Parrow, J., Walker, D.: A calculus of mobile processes, ii. Inf. Comput.\u00a0100(1), 41\u201377 (1992)","journal-title":"Inf. Comput."},{"key":"28_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"685","DOI":"10.1007\/3-540-55719-9_114","volume-title":"Automata, Languages and Programming","author":"R. Milner","year":"1992","unstructured":"Milner, R., Sangiorgi, D.: Barbed bisimulation. In: Kuich, W. (ed.) ICALP 1992. LNCS, vol.\u00a0623, pp. 685\u2013695. Springer, Heidelberg (1992)"},{"key":"28_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"648","DOI":"10.1007\/3-540-60084-1_112","volume-title":"Automata, Languages and Programming","author":"V. Natarajan","year":"1995","unstructured":"Natarajan, V., Cleaveland, R.: Divergence and fair testing. In: F\u00fcl\u00f6p, Z., Gecseg, F. (eds.) ICALP 1995. LNCS, vol.\u00a0944, pp. 648\u2013659. Springer, Heidelberg (1995)"},{"key":"28_CR11","doi-asserted-by":"publisher","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 equivalences for processes. Theor. Comput. Sci.\u00a034, 83\u2013133 (1984)","journal-title":"Theor. Comput. Sci."},{"key":"28_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"152","DOI":"10.1007\/BFb0039058","volume-title":"CONCUR \u201990","author":"R. Nicola De","year":"1990","unstructured":"De Nicola, R., Montanari, U., Vaandrager, F.W.: Back and forth bisimulations. In: Baeten, J.C.M., Klop, J.W. (eds.) CONCUR 1990. LNCS, vol.\u00a0458, pp. 152\u2013165. Springer, Heidelberg (1990)"},{"key":"28_CR13","doi-asserted-by":"crossref","unstructured":"Park, D.M.R.: Concurrency and automata on infinite sequences. Theoretical Computer Science, 167\u2013183 (1981)","DOI":"10.1007\/BFb0017309"},{"key":"28_CR14","unstructured":"Sangiorgi, D.: Expressing Mobility in Process Algebras: First-Order and Higher-Order Paradigms. PhD thesis, Department of Computer Science, University of Edinburgh (1992)"},{"key":"28_CR15","doi-asserted-by":"crossref","unstructured":"Sangiorgi, D.: On the origins of bisimulation and coinduction. ACM Trans. Program. Lang. Syst.\u00a031(4) (2009)","DOI":"10.1145\/1516507.1516510"},{"issue":"1","key":"28_CR16","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/BF01200262","volume":"30","author":"B. Thomsen","year":"1993","unstructured":"Thomsen, B.: Plain chocs: A second generation calculus for higher order processes. Acta Inf.\u00a030(1), 1\u201359 (1993)","journal-title":"Acta Inf."},{"key":"28_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"278","DOI":"10.1007\/BFb0039066","volume-title":"CONCUR \u201990","author":"R.J. Glabbeek van","year":"1990","unstructured":"van Glabbeek, R.J.: The linear time-branching time spectrum (extended abstract). In: Baeten, J.C.M., Klop, J.W. (eds.) CONCUR 1990. LNCS, vol.\u00a0458, pp. 278\u2013297. Springer, Heidelberg (1990)"},{"key":"28_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"66","DOI":"10.1007\/3-540-57208-2_6","volume-title":"CONCUR\u201993","author":"R.J. Glabbeek van","year":"1993","unstructured":"van Glabbeek, R.J.: The linear time - branching time spectrum ii. In: Best, E. (ed.) CONCUR 1993. LNCS, vol.\u00a0715, pp. 66\u201381. Springer, Heidelberg (1993)"},{"issue":"3","key":"28_CR19","doi-asserted-by":"publisher","first-page":"555","DOI":"10.1145\/233551.233556","volume":"43","author":"R.J. Glabbeek van","year":"1996","unstructured":"van Glabbeek, R.J., Weijland, W.P.: Branching time and abstraction in bisimulation semantics. J. ACM\u00a043(3), 555\u2013600 (1996)","journal-title":"J. ACM"}],"container-title":["Lecture Notes in Computer Science","Programming Languages and Systems"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-17164-2_28","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,6]],"date-time":"2019-06-06T11:18:13Z","timestamp":1559819893000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-17164-2_28"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010]]},"ISBN":["9783642171635","9783642171642"],"references-count":19,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-17164-2_28","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2010]]}}}