{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,25]],"date-time":"2025-03-25T14:12:53Z","timestamp":1742911973134,"version":"3.40.3"},"publisher-location":"Berlin, Heidelberg","reference-count":11,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540291893"},{"type":"electronic","value":"9783540320845"}],"license":[{"start":{"date-parts":[[2005,1,1]],"date-time":"2005-01-01T00:00:00Z","timestamp":1104537600000},"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":[[2005]]},"DOI":"10.1007\/11562436_24","type":"book-chapter","created":{"date-parts":[[2005,10,19]],"date-time":"2005-10-19T05:40:51Z","timestamp":1129700451000},"page":"320-334","source":"Crossref","is-referenced-by-count":13,"title":["Amortised Bisimulations"],"prefix":"10.1007","author":[{"given":"Astrid","family":"Kiehn","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"S.","family":"Arun-Kumar","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"issue":"29","key":"24_CR1","doi-asserted-by":"publisher","first-page":"737","DOI":"10.1007\/BF01191894","volume":"1","author":"S. Arun-Kumar","year":"1992","unstructured":"Arun-Kumar, S., Hennessy, M.: An efficiency preorder for processes. Acta Informatica\u00a01(29), 737\u2013760 (1992)","journal-title":"Acta Informatica"},{"key":"24_CR2","unstructured":"Cleaveland, R., Parrow, J., Steffen, B.: A semantics based verification tool for finite state systems. In: Proceedings of the 9\n                    th\n                   International Symposium on Protocol Specification, Testing and Verification, North Holland (1989)"},{"key":"24_CR3","volume-title":"Introduction to Algorithms","author":"T. Cormen","year":"2004","unstructured":"Cormen, T., Leiserson, C., Rivest, R., Stein, C.: Introduction to Algorithms, 2nd edn. Prentice-Hall, India (2004)","edition":"2"},{"issue":"2","key":"24_CR4","doi-asserted-by":"publisher","first-page":"221","DOI":"10.1006\/inco.1995.1041","volume":"117","author":"M. Hennessy","year":"1995","unstructured":"Hennessy, M., Regan, T.: A process algebra for timed systems. Information and Computation\u00a0117(2), 221\u2013239 (1995)","journal-title":"Information and Computation"},{"key":"24_CR5","doi-asserted-by":"publisher","first-page":"243","DOI":"10.1007\/BF01384078","volume":"7","author":"H. Lin","year":"1995","unstructured":"Lin, H.: A process algebra manipulator. Formal Methods in Systems Design\u00a07, 243\u2013259 (1995)","journal-title":"Formal Methods in Systems Design"},{"key":"24_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"79","DOI":"10.1007\/978-3-540-31982-5_5","volume-title":"Foundations of Software Science and Computational Structures","author":"G. L\u00fcttgen","year":"2005","unstructured":"L\u00fcttgen, G., Vogler, W.: Bisimulation on speed: A unified approach. In: Sassone, V. (ed.) FOSSACS 2005. LNCS, vol.\u00a03441, pp. 79\u201394. Springer, Heidelberg (2005)"},{"key":"24_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-10235-3","volume-title":"A Calculus of Communication Systems","author":"R. Milner","year":"1980","unstructured":"Milner, R.: A Calculus of Communication Systems. LNCS, vol.\u00a092. Springer, Heidelberg (1980)"},{"key":"24_CR8","volume-title":"Communication and Concurrency","author":"R. Milner","year":"1989","unstructured":"Milner, R.: Communication and Concurrency. Prentice-Hall, Englewood Cliffs (1989)"},{"key":"24_CR9","doi-asserted-by":"crossref","unstructured":"Satya Kiran, M.N.V., Jayram, N.M., Rao, P., Nandy, S.K.: A complexity effective communication model for behavioral modeling of signal processing applications. In: Proceedings of DAC 2003 (2003)","DOI":"10.1109\/DAC.2003.1219035"},{"key":"24_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"424","DOI":"10.1007\/3-540-54430-5_104","volume-title":"CONCUR 1991","author":"F. Moller","year":"1991","unstructured":"Moller, F., Tofts, C.: Relating processes with respect to speed. In: Groote, J.F., Baeten, J.C.M. (eds.) CONCUR 1991. LNCS, vol.\u00a0527, pp. 424\u2013438. Springer, Heidelberg (1991)"},{"key":"24_CR11","doi-asserted-by":"crossref","unstructured":"Park, D.: Concurrency and automata on infinite sequences. In: Deussen, P. (ed.) GI-TCS 1981. LNCS, vol.\u00a0104. Springer, Heidelberg (1981)","DOI":"10.1007\/BFb0017309"}],"container-title":["Lecture Notes in Computer Science","Formal Techniques for Networked and Distributed Systems - FORTE 2005"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11562436_24","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,3,12]],"date-time":"2019-03-12T22:20:17Z","timestamp":1552429217000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11562436_24"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2005]]},"ISBN":["9783540291893","9783540320845"],"references-count":11,"URL":"https:\/\/doi.org\/10.1007\/11562436_24","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2005]]}}}