{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T18:50:17Z","timestamp":1725562217615},"publisher-location":"Berlin, Heidelberg","reference-count":24,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540212980"},{"type":"electronic","value":"9783540247272"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2004]]},"DOI":"10.1007\/978-3-540-24727-2_24","type":"book-chapter","created":{"date-parts":[[2010,8,2]],"date-time":"2010-08-02T15:06:41Z","timestamp":1280761601000},"page":"333-347","source":"Crossref","is-referenced-by-count":5,"title":["Bisimulation on Speed: Lower Time Bounds"],"prefix":"10.1007","author":[{"given":"Gerald","family":"L\u00fcttgen","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Walter","family":"Vogler","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"24_CR1","doi-asserted-by":"publisher","first-page":"565","DOI":"10.1051\/ita:2000131","volume":"34","author":"L. Aceto","year":"2000","unstructured":"Aceto, L., Ing\u00f3lfsd\u00f3ttir, A., Pedersen, M.L., Poulsen, J.: Characteristic formulae for timed automata. RAIRO, Theoretical Informatics and Applications\u00a034, 565\u2013584 (2000)","journal-title":"RAIRO, Theoretical Informatics and Applications"},{"issue":"4","key":"24_CR2","doi-asserted-by":"publisher","first-page":"317","DOI":"10.1007\/s002360050047","volume":"33","author":"L. Aceto","year":"1996","unstructured":"Aceto, L., Murphy, D.: Timing and causality in process algebra. Acta Inform.\u00a033(4), 317\u2013350 (1996)","journal-title":"Acta Inform."},{"issue":"8","key":"24_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.C.B.: An efficiency preorder for processes. Acta Inform.\u00a029(8), 737\u2013760 (1992)","journal-title":"Acta Inform."},{"key":"24_CR4","doi-asserted-by":"crossref","unstructured":"Arun-Kumar, S., Natarajan, V.: Conformance: A precongruence close to bisimilarity. In: STRICT 1995, Workshops in Comp. pp.55\u201368. Springer, Heidelberg,(1995)","DOI":"10.1007\/978-1-4471-3078-9_4"},{"issue":"2","key":"24_CR5","doi-asserted-by":"publisher","first-page":"403","DOI":"10.1016\/0304-3975(91)90231-P","volume":"82","author":"E. Badouel","year":"1991","unstructured":"Badouel, E., Darondeau, P.: On guarded recursion. TCS\u00a082(2), 403\u2013408 (1991)","journal-title":"TCS"},{"key":"24_CR6","doi-asserted-by":"crossref","unstructured":"Baeten, J.C.M., Middelburg, C.A.: Process algebra with timing: Real time and discrete time. In: Bergstra, et al. (eds.) [7], ch. 10, pp. 627\u2013684.","DOI":"10.1016\/B978-044482830-9\/50028-X"},{"volume-title":"Handbook of Process Algebra","year":"2001","key":"24_CR7","unstructured":"Bergstra, J.A., Ponse, A., Smolka, S.A. (eds.): Handbook of Process Algebra. Elsevier Science, Amsterdam (2001)"},{"key":"24_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"166","DOI":"10.1007\/3-540-63141-0_12","volume-title":"CONCUR\u201997: Concurrency Theory","author":"R. Cleaveland","year":"1997","unstructured":"Cleaveland, R., L\u00fcttgen, G., Mendler, M.: An algebraic theory of multiple clocks. In: Mazurkiewicz, A., Winkowski, J. (eds.) CONCUR 1997. LNCS, vol.\u00a01243, pp. 166\u2013180. Springer, Heidelberg (1997)"},{"key":"24_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"394","DOI":"10.1007\/3-540-61474-5_87","volume-title":"Computer Aided Verification","author":"R. Cleaveland","year":"1996","unstructured":"Cleaveland, R., Sims, S.: The NCSU Concurrency Workbench. In: Alur, R., Henzinger, T.A. (eds.) CAV 1996. LNCS, vol.\u00a01102, pp. 394\u2013397. Springer, Heidelberg (1996)"},{"issue":"11","key":"24_CR10","doi-asserted-by":"publisher","first-page":"805","DOI":"10.1007\/s002360050107","volume":"34","author":"F. Corradini","year":"1997","unstructured":"Corradini, F., Gorrieri, R., Roccetti, M.: Performance preorder and competitive equivalence. Acta Inform.\u00a034(11), 805\u2013835 (1997)","journal-title":"Acta Inform."},{"key":"24_CR11","doi-asserted-by":"publisher","first-page":"735","DOI":"10.1007\/s00236-002-0094-3","volume":"38","author":"F. Corradini","year":"2002","unstructured":"Corradini, F., Vogler, W., Jenner, L.: Comparing the worst-case efficiency of asynchronous systems with PAFAS. Acta Informatica\u00a038, 735\u2013792 (2002)","journal-title":"Acta Informatica"},{"issue":"1-2","key":"24_CR12","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.C.B.: Testing equivalences for processes. TCS\u00a034(1-2), 83\u2013133 (1984)","journal-title":"TCS"},{"issue":"1","key":"24_CR13","doi-asserted-by":"publisher","first-page":"73","DOI":"10.1016\/0304-3975(94)00205-W","volume":"140","author":"R. Gorrieri","year":"1995","unstructured":"Gorrieri, R., Roccetti, M., Stancampiano, E.: A theory of processes with durational actions. TCS\u00a0140(1), 73\u201394 (1995)","journal-title":"TCS"},{"issue":"2","key":"24_CR14","doi-asserted-by":"publisher","first-page":"221","DOI":"10.1006\/inco.1995.1041","volume":"117","author":"M.C.B. Hennessy","year":"1995","unstructured":"Hennessy, M.C.B., Regan, T.: A process algebra for timed systems. Inform. and Comp.\u00a0117(2), 221\u2013239 (1995)","journal-title":"Inform. and Comp."},{"key":"24_CR15","volume-title":"Communicating Sequential Processes.","author":"C.A.R. Hoare","year":"1985","unstructured":"Hoare, C.A.R.: Communicating Sequential Processes. Prentice Hall, Englewood Cliffs (1985)"},{"issue":"1-2","key":"24_CR16","doi-asserted-by":"publisher","first-page":"379","DOI":"10.1016\/S0304-3975(99)00304-7","volume":"254","author":"L. Jenner","year":"2001","unstructured":"Jenner, L., Vogler, W.: Fast asynchronous systems in dense time. TCS\u00a0254(1-2), 379\u2013422 (2001)","journal-title":"TCS"},{"key":"#cr-split#-24_CR17.1","doi-asserted-by":"crossref","unstructured":"L\u00fcttgen, G., Vogler, W.: A faster-than relation for asynchronous processes. In: Larsen, K.G., Nielsen, M. (eds.) CONCUR 2001. LNCS, vol.\u00a02154, pp. 262\u2013276. Springer, Heidelberg (2001);","DOI":"10.1007\/3-540-44685-0_18"},{"key":"#cr-split#-24_CR17.2","unstructured":"Full version to appear in Inform. and Comp. under the title Bisimulation on Speed: Worst\u2013Case Efficiency"},{"key":"24_CR18","volume-title":"Communication and Concurrency","author":"R. Milner","year":"1989","unstructured":"Milner, R.: Communication and Concurrency. Prentice Hall, Englewood Cliffs (1989)"},{"key":"24_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"401","DOI":"10.1007\/BFb0039073","volume-title":"CONCUR \u201990","author":"F. Moller","year":"1990","unstructured":"Moller, F., Tofts, C.: A temporal calculus of communicating systems. In: Baeten, J.C.M., Klop, J.W. (eds.) CONCUR 1990. LNCS, vol.\u00a0458, pp. 401\u2013415. Springer, Heidelberg (1990)"},{"key":"24_CR20","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 \u201991","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_CR21","first-page":"63","volume-title":"LICS 1996","author":"V. Natarajan","year":"1996","unstructured":"Natarajan, V., Cleaveland, R.: An algebraic theory of process efficiency. In: LICS 1996, pp. 63\u201372. IEEE Computer Society Press, Los Alamitos (1996)"},{"issue":"2","key":"24_CR22","doi-asserted-by":"publisher","first-page":"193","DOI":"10.1006\/inco.1995.1014","volume":"116","author":"S. Schneider","year":"1995","unstructured":"Schneider, S.: An operational semantics for timed CSP. Inform. and Comp.\u00a0116(2), 193\u2013213 (1995)","journal-title":"Inform. and Comp."},{"key":"24_CR23","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"299","DOI":"10.1007\/3-540-60218-6_22","volume-title":"CONCUR \u201995 Concurrency Theory","author":"W. Vogler","year":"1995","unstructured":"Vogler, W.: Faster asynchronous systems. In: Lee, I., Smolka, S.A. (eds.) CONCUR 1995. LNCS, vol.\u00a0962, pp. 299\u2013312. Springer, Heidelberg (1995)"}],"container-title":["Lecture Notes in Computer Science","Foundations of Software Science and Computation Structures"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-24727-2_24","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,3,17]],"date-time":"2019-03-17T16:55:34Z","timestamp":1552841734000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-24727-2_24"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2004]]},"ISBN":["9783540212980","9783540247272"],"references-count":24,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-24727-2_24","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2004]]}}}