{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,5,2]],"date-time":"2025-05-02T09:40:10Z","timestamp":1746178810497,"version":"3.40.4"},"publisher-location":"Cham","reference-count":14,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319062501"},{"type":"electronic","value":"9783319062518"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2014]]},"DOI":"10.1007\/978-3-319-06251-8_13","type":"book-chapter","created":{"date-parts":[[2014,4,8]],"date-time":"2014-04-08T01:32:39Z","timestamp":1396920759000},"page":"208-225","source":"Crossref","is-referenced-by-count":1,"title":["Parameterised Bisimulations: Some Applications"],"prefix":"10.1007","author":[{"given":"S.","family":"Arun-Kumar","sequence":"first","affiliation":[]},{"given":"Divyanshu","family":"Bagga","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"13_CR1","doi-asserted-by":"publisher","first-page":"737","DOI":"10.1007\/BF01191894","volume":"29","author":"S. Arun-Kumar","year":"1992","unstructured":"Arun-Kumar, S., Hennessy, M.: An efficiency preorder for processes. Acta Informatica\u00a029, 737\u2013760 (1992)","journal-title":"Acta Informatica"},{"key":"13_CR2","doi-asserted-by":"crossref","unstructured":"Arun-Kumar, S., Natarajan, V.: Conformance: A precongruence close to bisimilarity. In: Structures in Concurrency Theory, pp. 55\u201368. Springer (1995)","DOI":"10.1007\/978-1-4471-3078-9_4"},{"key":"13_CR3","doi-asserted-by":"crossref","unstructured":"Arun-Kumar, S.: On bisimilarities induced by relations on actions. In: Fourth IEEE International Conference on Software Engineering and Formal Methods, SEFM 2006, pp. 41\u201349. IEEE (2006)","DOI":"10.1109\/SEFM.2006.28"},{"key":"13_CR4","unstructured":"Bagga, D.: Parametrised bisimulations for the fusion calculus. Master\u2019s thesis, Department of Computer Science and Engineering, IIT Delhi (2011), http:\/\/www.cse.iitd.ac.in\/~bagga\/bag11.html"},{"key":"13_CR5","doi-asserted-by":"publisher","first-page":"77","DOI":"10.1016\/0304-3975(85)90088-X","volume":"37","author":"J.A. Bergstra","year":"1985","unstructured":"Bergstra, J.A., Klop, J.W.: Algebra of communicating processes with abstraction. Theoretical Computer Science\u00a037, 77\u2013121 (1985)","journal-title":"Theoretical Computer Science"},{"key":"13_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"320","DOI":"10.1007\/11562436_24","volume-title":"Formal Techniques for Networked and Distributed Systems - FORTE 2005","author":"A. Kiehn","year":"2005","unstructured":"Kiehn, A., Arun-Kumar, S.: Amortised bisimulations. In: Wang, F. (ed.) FORTE 2005. LNCS, vol.\u00a03731, pp. 320\u2013334. Springer, Heidelberg (2005)"},{"key":"13_CR7","doi-asserted-by":"publisher","first-page":"209","DOI":"10.1016\/j.tcs.2006.03.004","volume":"360","author":"G. L\u00fcttgen","year":"2006","unstructured":"L\u00fcttgen, G., Vogler, W.: Bisimulation on speed: A unified approach. Theoretical Computer Science\u00a0360, 209\u2013227 (2006)","journal-title":"Theoretical Computer Science"},{"key":"13_CR8","unstructured":"Milner, R.: Communication and concurrency. Prentice-Hall, Inc. (1989)"},{"key":"13_CR9","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. Information and Computation\u00a0100, 1\u201340 (1992)","journal-title":"Information and Computation"},{"key":"13_CR10","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. Information and Computation\u00a0100, 41\u201377 (1992)","journal-title":"Information and Computation"},{"key":"13_CR11","doi-asserted-by":"crossref","unstructured":"Parrow, J., Victor, B.: The fusion calculus: Expressiveness and symmetry in mobile processes. In: Proceedings of the Thirteenth Annual IEEE Symposium on Logic in Computer Science, pp. 176\u2013185. IEEE (1998)","DOI":"10.1109\/LICS.1998.705654"},{"key":"13_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"32","DOI":"10.1007\/BFb0084781","volume-title":"CONCUR \u201992","author":"D. Sangiorgi","year":"1992","unstructured":"Sangiorgi, D., Milner, R.: The problem of \u201cWeak Bisimulation up to\u201d. In: Cleaveland, W.R. (ed.) CONCUR 1992. LNCS, vol.\u00a0630, pp. 32\u201346. Springer, Heidelberg (1992)"},{"key":"13_CR13","unstructured":"Singh, P., Arun-Kumar, S.: Axiomatization of a Class of Parametrised Bisimilarities. Perspectives in Concurrency Theory. Universities Press, India (2009)"},{"key":"13_CR14","unstructured":"Victor, B.: The fusion calculus: Expressiveness and symmetry in mobile processes. PhD thesis, Uppsala University (1998)"}],"container-title":["Lecture Notes in Computer Science","Relational and Algebraic Methods in Computer Science"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-06251-8_13","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,5,2]],"date-time":"2025-05-02T09:07:16Z","timestamp":1746176836000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-06251-8_13"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014]]},"ISBN":["9783319062501","9783319062518"],"references-count":14,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-06251-8_13","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2014]]}}}