{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,7]],"date-time":"2024-09-07T22:06:49Z","timestamp":1725746809181},"publisher-location":"Berlin, Heidelberg","reference-count":22,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642402128"},{"type":"electronic","value":"9783642402135"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2013]]},"DOI":"10.1007\/978-3-642-40213-5_6","type":"book-chapter","created":{"date-parts":[[2013,8,29]],"date-time":"2013-08-29T09:26:23Z","timestamp":1377768383000},"page":"83-94","source":"Crossref","is-referenced-by-count":0,"title":["On Efficiency Preorders"],"prefix":"10.1007","author":[{"given":"Manish","family":"Gaur","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"S.","family":"Arun-Kumar","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2013,8,30]]},"reference":[{"key":"6_CR1","unstructured":"Hopcroft, J.E., Aho, A.V., Ullman, J.D.: Design and Analysis of Computer Algorithms. Addison-Wesely, Reading (1974)"},{"key":"6_CR2","doi-asserted-by":"crossref","unstructured":"Arun-Kumar, S., Hennessy, M.: An efficiency preorder for processes. In: Ito, T., Meyer, A.R. (eds.) TACS 1991. LNCS, vol. 526, pp. 152\u2013175. Springer, Heidelberg (1991)","DOI":"10.1007\/3-540-54415-1_45"},{"key":"6_CR3","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 29, 737\u2013760 (1992)","journal-title":"Acta Informatica"},{"key":"6_CR4","doi-asserted-by":"crossref","unstructured":"Arun-Kumar, S., Natarajan, V.: Conformance: A precongruence close to bisimilarity. In: Structures in Concurrency Theory. Springer Workshops in Computer Science Series, Springer (1995)","DOI":"10.1007\/978-1-4471-3078-9_4"},{"issue":"1","key":"6_CR5","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/BF01211314","volume":"5","author":"R Cleaveland","year":"1993","unstructured":"Cleaveland, R., Hennessy, M.: Testing equivalence as a bisimulation equivalence. Formal Aspects of Computing 5(1), 1\u201320 (1993)","journal-title":"Formal Aspects of Computing"},{"key":"6_CR6","volume-title":"Equivalence and preorder checking for finite-state system","author":"R Cleaveland","year":"2001","unstructured":"Cleaveland, R., Sokolsky, O.: Equivalence and preorder checking for finite-state system. In: Handbook of Process Algebra (2001)"},{"key":"6_CR7","volume-title":"Matrix multiplication via arithmetic progression","author":"D Coppersmith","year":"1987","unstructured":"Coppersmith, D., Winograd, S.: Matrix multiplication via arithmetic progression. In: Proceedings of the Nineteenth Annual ACM Symposium on Theory of Computing (1987)"},{"issue":"3","key":"6_CR8","doi-asserted-by":"publisher","first-page":"117","DOI":"10.1016\/j.entcs.2009.06.042","volume":"229","author":"M Gaur","year":"2009","unstructured":"Gaur, M., Hennessy, M.: Counting the cost in the picalculus (extended abstract). Electronic Notes in Theoretical Computer Science (ENTCS) 229(3), 117\u2013129 (2009)","journal-title":"Electronic Notes in Theoretical Computer Science (ENTCS)"},{"key":"6_CR9","doi-asserted-by":"crossref","unstructured":"Groote, J.F., Vaandrager, F.W.: An efficient algorithm for branching bisimulation and stuttering equivalence. In: Paterson, M. (ed.) ICALP 1990. LNCS, vol. 443, pp. 626\u2013638. Springer, Heidelberg (1990)","DOI":"10.1007\/BFb0032063"},{"key":"6_CR10","volume-title":"Algebraic Theory of Processes","author":"M Hennessy","year":"1990","unstructured":"Hennessy, M.: Algebraic Theory of Processes. The MIT Press, Cambridge (1990)"},{"key":"6_CR11","doi-asserted-by":"crossref","unstructured":"Hoare, C.A.R.: Communicating Sequential Processes. Prentice-Hall (1985)","DOI":"10.1007\/978-3-642-82921-5_4"},{"key":"6_CR12","volume-title":"Intoduction to Automata Theory","author":"JE Hopcroft","year":"1987","unstructured":"Hopcroft, J.E., Ullman, J.D.: Intoduction to Automata Theory, Langauages and Computation. Narosa Publishing House (1987)"},{"issue":"1","key":"6_CR13","doi-asserted-by":"publisher","first-page":"43","DOI":"10.1016\/0890-5401(90)90025-D","volume":"86","author":"PC Kanellakis","year":"1990","unstructured":"Kanellakis, P.C., Smolka, S.: Ccs expressions, finite state processes and three problem of equivalence. Information and Computation 86(1), 43\u201368 (1990)","journal-title":"Information and Computation"},{"key":"6_CR14","unstructured":"Milner, R.: Communication and Concurrency. Prentice Hall (1989)"},{"key":"6_CR15","unstructured":"Milner, R.: A Calculus of Communication Systems. LNCS, vol. 92. Springer, Heidelberg (1980)"},{"key":"6_CR16","unstructured":"Milner, R.: Communicating and mobile systems: The $$\\pi $$ \u03c0 -Calculus. Cambridge University Press (1999)"},{"issue":"6","key":"6_CR17","doi-asserted-by":"publisher","first-page":"973","DOI":"10.1137\/0216062","volume":"16","author":"R Paige","year":"1987","unstructured":"Paige, R., Tarjan, R.E.: Three partition refinement refinement algorithms. SIAM J. Compt. 16(6), 973\u2013989 (1987)","journal-title":"SIAM J. Compt."},{"key":"6_CR18","doi-asserted-by":"crossref","unstructured":"Parrow, J., Cleaveland, R., Steffen, B.: The concurrency workbench: A semantic based tool for the verification of the concurrent systems. ACM Transactions of Programming Languages and Systems 15(1) (1993)","DOI":"10.1145\/151646.151648"},{"key":"6_CR19","doi-asserted-by":"crossref","unstructured":"Sangiorgi, D.: Beyond bisimulation: The \u201cup-to\u201d techniques. In: de Boer, F.S., Bonsangue, M.M., Graf, S., de Roever, W.-P. (eds.) FMCO 2005. LNCS, vol. 4111, pp. 161\u2013171. Springer, Heidelberg (2006)","DOI":"10.1007\/11804192_8"},{"key":"6_CR20","doi-asserted-by":"crossref","unstructured":"Sangiorgi, D.: Introduction to Bisimulation and Coinduction. Cambridge University Press (2012)","DOI":"10.1017\/CBO9780511777110"},{"key":"6_CR21","doi-asserted-by":"crossref","unstructured":"Sangiorgi, D., Milner, R.: The problem of \u201cweak bisimulation up-to\". In: Cleaveland, W.R. (ed.) CONCUR 1992. LNCS, vol. 630, pp. 32\u201346. Springer, Heidelberg (1992)","DOI":"10.1007\/BFb0084781"},{"key":"6_CR22","volume-title":"Introduction to Algorithms","author":"CE Leiserson","year":"1990","unstructured":"Leiserson, C.E., Cormen, T.H., Rivest, R.L.: Introduction to Algorithms. Eastern Economy Edition. Prentice-Hall India (1990)"}],"container-title":["Lecture Notes in Computer Science","Fundamentals of Software Engineering"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-40213-5_6","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,7,4]],"date-time":"2023-07-04T05:25:10Z","timestamp":1688448310000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-40213-5_6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013]]},"ISBN":["9783642402128","9783642402135"],"references-count":22,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-40213-5_6","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2013]]}}}