{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,28]],"date-time":"2025-10-28T00:15:17Z","timestamp":1761610517945,"version":"build-2065373602"},"reference-count":12,"publisher":"Elsevier BV","issue":"1","license":[{"start":{"date-parts":[[2003,2,1]],"date-time":"2003-02-01T00:00:00Z","timestamp":1044057600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2003,2,1]],"date-time":"2003-02-01T00:00:00Z","timestamp":1044057600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/legal\/tdmrep-license"},{"start":{"date-parts":[[2013,7,29]],"date-time":"2013-07-29T00:00:00Z","timestamp":1375056000000},"content-version":"vor","delay-in-days":3831,"URL":"http:\/\/creativecommons.org\/licenses\/by-nc-nd\/3.0\/"}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["Electronic Notes in Theoretical Computer Science"],"published-print":{"date-parts":[[2003,2]]},"DOI":"10.1016\/s1571-0661(05)82503-4","type":"journal-article","created":{"date-parts":[[2005,5,6]],"date-time":"2005-05-06T15:34:43Z","timestamp":1115393683000},"page":"47-64","update-policy":"https:\/\/doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":0,"title":["The Expressive Power of Urgent, Lazy and Busy-Waiting Actions in Timed Processes"],"prefix":"10.1016","volume":"39","author":[{"given":"Flavio","family":"Corradini","sequence":"first","affiliation":[]},{"given":"Dino","family":"Di Cola","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"issue":"4","key":"10.1016\/S1571-0661(05)82503-4_BIB1","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 Informatica"},{"doi-asserted-by":"crossref","unstructured":"B. B\u00e9rard, A. Labroue, Ph. Schnoebelen. Verifying performance equivalence for Timed Basic Parallel Processes. In the Proceedings of FOSSACS 2000, LNCS 1784, Springer Verlag, pp. 35-47, 2000.","key":"10.1016\/S1571-0661(05)82503-4_BIB2","DOI":"10.1007\/3-540-46432-8_3"},{"key":"10.1016\/S1571-0661(05)82503-4_BIB3","doi-asserted-by":"crossref","first-page":"191","DOI":"10.1006\/inco.1998.2726","article-title":"On Performance Congruences for Process Algebras","volume":"145","author":"Corradini","year":"1998","journal-title":"Information and Computation"},{"issue":"1","key":"10.1016\/S1571-0661(05)82503-4_BIB4","doi-asserted-by":"crossref","first-page":"122","DOI":"10.1006\/inco.1999.2821","article-title":"Absolute versus Relative Time in Process Algebras","volume":"156","author":"Corradini","year":"2000","journal-title":"Information and Computation"},{"unstructured":"F. Corradini, G. L. Ferrari, M. Pistore: On the Semantics of Durational Actions. Theoretical Computer Science, 2000. To appear. An extended abstract of this paper, titled Eager, Busy-Waiting and Lazy Actions in Timed Computation, appeared in the Proceedings of EXPRESS'97, Electronic Notes of Theoretical Computer Science.","key":"10.1016\/S1571-0661(05)82503-4_BIB5"},{"key":"10.1016\/S1571-0661(05)82503-4_BIB6","article-title":"On Testing Urgency through Laziness over Processes with Durational Actions","author":"Corradini","year":"1999","journal-title":"Theoretical Computer Science"},{"doi-asserted-by":"crossref","unstructured":"G-L. Ferrari, U. Montanari: Dynamic matrices and the cost analysis of concurrent programs. In the Proceedings of AMAST'95, LNCS 936, Springer Verlag, pp. 307-321, 1995.","key":"10.1016\/S1571-0661(05)82503-4_BIB7","DOI":"10.1007\/3-540-60043-4_61"},{"issue":"1","key":"10.1016\/S1571-0661(05)82503-4_BIB8","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":"Theoretical Computer Science"},{"key":"10.1016\/S1571-0661(05)82503-4_BIB9","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":"Information and Computation"},{"key":"10.1016\/S1571-0661(05)82503-4_BIB10","series-title":"International series on computer science","article-title":"Communication and Concurrency","author":"Milner","year":"1989"},{"doi-asserted-by":"crossref","unstructured":"F. Moller, C. Tofts: A Temporal Calculus of Communicating Systems. In the Proceedings of CONCUR'90, LNCS 459, Springer-Verlag, pp. 401-415, 1990.","key":"10.1016\/S1571-0661(05)82503-4_BIB11","DOI":"10.1007\/BFb0039073"},{"key":"10.1016\/S1571-0661(05)82503-4_BIB12","first-page":"502","article-title":"Real time behaviour of asynchronous agents","volume":"458","author":"Yi","year":"1990"}],"container-title":["Electronic Notes in Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S1571066105825034?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S1571066105825034?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2025,10,28]],"date-time":"2025-10-28T00:08:48Z","timestamp":1761610128000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S1571066105825034"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2003,2]]},"references-count":12,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2003,2]]}},"alternative-id":["S1571066105825034"],"URL":"https:\/\/doi.org\/10.1016\/s1571-0661(05)82503-4","relation":{},"ISSN":["1571-0661"],"issn-type":[{"type":"print","value":"1571-0661"}],"subject":[],"published":{"date-parts":[[2003,2]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"The Expressive Power of Urgent, Lazy and Busy-Waiting Actions in Timed Processes","name":"articletitle","label":"Article Title"},{"value":"Electronic Notes in Theoretical Computer Science","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/S1571-0661(05)82503-4","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"converted-article","name":"content_type","label":"Content Type"},{"value":"Copyright \u00a9 2004 Elsevier Ltd.","name":"copyright","label":"Copyright"}]}}