{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,2]],"date-time":"2022-04-02T09:19:25Z","timestamp":1648891165505},"reference-count":25,"publisher":"Elsevier BV","issue":"1-3","license":[{"start":{"date-parts":[[2006,8,1]],"date-time":"2006-08-01T00:00:00Z","timestamp":1154390400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,8,22]],"date-time":"2013-08-22T00:00:00Z","timestamp":1377129600000},"content-version":"vor","delay-in-days":2578,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Theoretical Computer Science"],"published-print":{"date-parts":[[2006,8]]},"DOI":"10.1016\/j.tcs.2006.03.004","type":"journal-article","created":{"date-parts":[[2006,4,6]],"date-time":"2006-04-06T23:28:31Z","timestamp":1144366111000},"page":"209-227","source":"Crossref","is-referenced-by-count":10,"title":["Bisimulation on speed: A unified approach"],"prefix":"10.1016","volume":"360","author":[{"given":"Gerald","family":"L\u00fcttgen","sequence":"first","affiliation":[]},{"given":"Walter","family":"Vogler","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/j.tcs.2006.03.004_bib1","doi-asserted-by":"crossref","first-page":"225","DOI":"10.1016\/0304-3975(87)90065-X","article-title":"Observation equivalence as a testing equivalence","volume":"53","author":"Abramsky","year":"1987","journal-title":"Theoret. Comput. Sci."},{"issue":"4","key":"10.1016\/j.tcs.2006.03.004_bib2","doi-asserted-by":"crossref","first-page":"317","DOI":"10.1007\/s002360050047","article-title":"Timing and causality in process algebra","volume":"33","author":"Aceto","year":"1996","journal-title":"Acta Inform."},{"issue":"8","key":"10.1016\/j.tcs.2006.03.004_bib3","doi-asserted-by":"crossref","first-page":"737","DOI":"10.1007\/BF01191894","article-title":"An efficiency preorder for processes","volume":"29","author":"Arun-Kumar","year":"1992","journal-title":"Acta Inform."},{"key":"10.1016\/j.tcs.2006.03.004_bib4","doi-asserted-by":"crossref","unstructured":"S. Arun-Kumar, V. Natarajan, Conformance: a precongruence close to bisimilarity, in: STRICT \u201995, Workshops in Computing, Springer, Berlin, 1995, pp. 55\u201368.","DOI":"10.1007\/978-1-4471-3078-9_4"},{"issue":"2","key":"10.1016\/j.tcs.2006.03.004_bib5","doi-asserted-by":"crossref","first-page":"403","DOI":"10.1016\/0304-3975(91)90231-P","article-title":"On guarded recursion","volume":"82","author":"Badouel","year":"1991","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/j.tcs.2006.03.004_bib6","series-title":"Process algebra with timing, Monographs in Theoretical Computer Science","author":"Baeten","year":"2002"},{"key":"10.1016\/j.tcs.2006.03.004_bib7","unstructured":"J.A. Bergstra, A. Ponse, S.A. Smolka (Eds.), Handbook of Process Algebra, Elsevier, Amsterdam, 2001."},{"key":"10.1016\/j.tcs.2006.03.004_bib8","first-page":"394","article-title":"The NCSU concurrency workbench","volume":"Vol. 1102","author":"Cleaveland","year":"1996"},{"key":"10.1016\/j.tcs.2006.03.004_bib9","series-title":"APAQS 2001","first-page":"231","article-title":"PAFAS at work: comparing the worst-case efficiency of three buffer implementations","author":"Corradini","year":"2001"},{"issue":"11","key":"10.1016\/j.tcs.2006.03.004_bib10","doi-asserted-by":"crossref","first-page":"805","DOI":"10.1007\/s002360050107","article-title":"Performance preorder and competitive equivalence","volume":"34","author":"Corradini","year":"1997","journal-title":"Acta Inform."},{"issue":"1\u20132","key":"10.1016\/j.tcs.2006.03.004_bib11","doi-asserted-by":"crossref","first-page":"83","DOI":"10.1016\/0304-3975(84)90113-0","article-title":"Testing equivalences for processes","volume":"34","author":"De Nicola","year":"1984","journal-title":"Theoret. Comput. Sci."},{"issue":"1","key":"10.1016\/j.tcs.2006.03.004_bib12","doi-asserted-by":"crossref","first-page":"73","DOI":"10.1016\/0304-3975(94)00205-W","article-title":"A theory of processes with durational actions","volume":"140","author":"Gorrieri","year":"1995","journal-title":"Theoret. Comput. Sci."},{"issue":"2","key":"10.1016\/j.tcs.2006.03.004_bib13","doi-asserted-by":"crossref","first-page":"221","DOI":"10.1006\/inco.1995.1041","article-title":"A process algebra for timed systems","volume":"117","author":"Hennessy","year":"1995","journal-title":"Inform. and Comput."},{"issue":"1\u20132","key":"10.1016\/j.tcs.2006.03.004_bib14","doi-asserted-by":"crossref","first-page":"379","DOI":"10.1016\/S0304-3975(99)00304-7","article-title":"Fast asynchronous systems in dense time","volume":"254","author":"Jenner","year":"2001","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/j.tcs.2006.03.004_bib15","doi-asserted-by":"crossref","unstructured":"A. Kiehn, S. Arun-Kumar, Amortised bisimulations, in: FORTE 2005, Lecture Notes in Computer Science, Vol. 3731, Springer, Berlin, 2005, pp. 320\u2013334.","DOI":"10.1007\/11562436_24"},{"issue":"2","key":"10.1016\/j.tcs.2006.03.004_bib16","doi-asserted-by":"crossref","first-page":"105","DOI":"10.1016\/j.ic.2002.08.001","article-title":"Bisimulation on speed: worst-case efficiency","volume":"191","author":"L\u00fcttgen","year":"2004","journal-title":"Inform. and Comput."},{"key":"10.1016\/j.tcs.2006.03.004_bib17","doi-asserted-by":"crossref","first-page":"587","DOI":"10.1051\/ita:2005030","article-title":"Bisimulation on speed: lower time bounds","volume":"39","author":"L\u00fcttgen","year":"2005","journal-title":"Theoret. Inform. Appl."},{"key":"10.1016\/j.tcs.2006.03.004_bib18","series-title":"Distributed Algorithms","author":"Lynch","year":"1996"},{"key":"10.1016\/j.tcs.2006.03.004_bib19","series-title":"Communication and Concurrency","author":"Milner","year":"1989"},{"key":"10.1016\/j.tcs.2006.03.004_bib20","first-page":"401","article-title":"A temporal calculus of communicating systems","volume":"Vol. 458","author":"Moller","year":"1990"},{"key":"10.1016\/j.tcs.2006.03.004_bib21","first-page":"424","article-title":"Relating processes with respect to speed","volume":"Vol. 527","author":"Moller","year":"1991"},{"key":"10.1016\/j.tcs.2006.03.004_bib22","series-title":"LICS \u201996","first-page":"63","article-title":"An algebraic theory of process efficiency","author":"Natarajan","year":"1996"},{"issue":"2","key":"10.1016\/j.tcs.2006.03.004_bib23","first-page":"274","article-title":"A congruence theorem for structured operational semantics with predicates and negative premises","volume":"2","author":"Verhoef","year":"1995","journal-title":"Nordic J. Comput."},{"issue":"1\u20132","key":"10.1016\/j.tcs.2006.03.004_bib24","doi-asserted-by":"crossref","first-page":"589","DOI":"10.1016\/S0304-3975(01)00300-0","article-title":"Efficiency of asynchronous systems, read arcs, and the MUTEX-problem","volume":"275","author":"Vogler","year":"2002","journal-title":"Theoret. Comput. Sci."},{"issue":"2","key":"10.1016\/j.tcs.2006.03.004_bib25","doi-asserted-by":"crossref","first-page":"311","DOI":"10.1016\/S0890-5401(03)00065-8","article-title":"Faster asynchronous systems","volume":"184","author":"Vogler","year":"2003","journal-title":"Inform. and Comput."}],"container-title":["Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0304397506002581?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0304397506002581?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,17]],"date-time":"2019-04-17T21:37:45Z","timestamp":1555537065000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0304397506002581"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006,8]]},"references-count":25,"journal-issue":{"issue":"1-3","published-print":{"date-parts":[[2006,8]]}},"alternative-id":["S0304397506002581"],"URL":"https:\/\/doi.org\/10.1016\/j.tcs.2006.03.004","relation":{},"ISSN":["0304-3975"],"issn-type":[{"value":"0304-3975","type":"print"}],"subject":[],"published":{"date-parts":[[2006,8]]}}}