{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,28]],"date-time":"2025-10-28T00:13:24Z","timestamp":1761610404723,"version":"build-2065373602"},"reference-count":23,"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)82501-0","type":"journal-article","created":{"date-parts":[[2005,5,6]],"date-time":"2005-05-06T15:34:43Z","timestamp":1115393683000},"page":"3-20","update-policy":"https:\/\/doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":0,"title":["Embedding Untimed into Timed Process Algebra; the Case for Explicit Termination"],"prefix":"10.1016","volume":"39","author":[{"given":"J.C.M.","family":"Baeten","sequence":"first","affiliation":[]}],"member":"78","reference":[{"issue":"1","key":"10.1016\/S1571-0661(05)82501-0_BIB1","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1006\/inco.1994.1040","article-title":"Turning SOS rules into equations","volume":"111","author":"Aceto","year":"1994","journal-title":"Information and Computation"},{"issue":"1\/2","key":"10.1016\/S1571-0661(05)82501-0_BIB2","doi-asserted-by":"crossref","first-page":"339","DOI":"10.1016\/S0304-3975(97)00182-5","article-title":"A complete equational axiomatization for MPA with string iteration","volume":"211","author":"Aceto","year":"1999","journal-title":"Theoretical Computer Science"},{"key":"10.1016\/S1571-0661(05)82501-0_BIB3","doi-asserted-by":"crossref","first-page":"147","DOI":"10.1145\/147508.147527","article-title":"Termination, deadlock and divergence","volume":"39","author":"Aceto","year":"1992","journal-title":"Journal of the ACM"},{"key":"10.1016\/S1571-0661(05)82501-0_BIB4","unstructured":"J.C.M. Baeten. Process algebra with explicit termination. Technical Report CSR 00\/02, Eindhoven University of Technology, Computing Science Department, 2000. See publications."},{"issue":"3","key":"10.1016\/S1571-0661(05)82501-0_BIB5","doi-asserted-by":"crossref","first-page":"250","DOI":"10.1007\/BF01215407","article-title":"On sequential composition, action prefixes and process prefix","volume":"6","author":"Baeten","year":"1994","journal-title":"Formal Aspects of Computing"},{"key":"10.1016\/S1571-0661(05)82501-0_BIB6","series-title":"Proceedings FCT'95, number 965 in Lecture Notes in Computer Science","first-page":"1","article-title":"Discrete time process algebra with abstraction","author":"Baeten","year":"1995"},{"issue":"2","key":"10.1016\/S1571-0661(05)82501-0_BIB7","doi-asserted-by":"crossref","first-page":"188","DOI":"10.1007\/BF01214556","article-title":"Discrete time process algebra","volume":"8","author":"Baeten","year":"1996","journal-title":"Formal Aspects of Computing"},{"key":"10.1016\/S1571-0661(05)82501-0_BIB8","series-title":"Handbook of Process Algebra","article-title":"Process algebra with timing: Real time and discrete time","author":"Baeten","year":"2000"},{"key":"10.1016\/S1571-0661(05)82501-0_BIB9","unstructured":"J.C.M. Baeten and M.A. Reniers. Termination in timed process algebra. Technical Report CSR 00\/13, Eindhoven University of Technology, Computing Science Department, 2000. See publications."},{"key":"10.1016\/S1571-0661(05)82501-0_BIB10","first-page":"149","article-title":"Concrete process algebra","volume":"volume 4","author":"Baeten","year":"1995"},{"year":"1990","series-title":"Process Algebra. Number 18 in Cambridge Tracts in Theoretical Computer Science","author":"Baeten","key":"10.1016\/S1571-0661(05)82501-0_BIB11"},{"issue":"1\/3","key":"10.1016\/S1571-0661(05)82501-0_BIB12","doi-asserted-by":"crossref","first-page":"109","DOI":"10.1016\/S0019-9958(84)80025-X","article-title":"Process algebra for synchronous communication","volume":"60","author":"Bergstra","year":"1984","journal-title":"Information and Control"},{"key":"10.1016\/S1571-0661(05)82501-0_BIB13","doi-asserted-by":"crossref","first-page":"171","DOI":"10.1016\/0167-6423(85)90010-3","article-title":"Top down design and the algebra of communicating processes","volume":"5","author":"Bergstra","year":"1984","journal-title":"Science of Computer Programming"},{"key":"10.1016\/S1571-0661(05)82501-0_BIB14","unstructured":"E. Brinksma, editor. Information Processing Systems, Open Systems Interconnection, LOTOS - A Formal Description Technique Based on the Temporal Ordering of Observational Behaviour, volume IS-8807 of International Standard. ISO, Geneva, 1989."},{"issue":"6","key":"10.1016\/S1571-0661(05)82501-0_BIB15","doi-asserted-by":"crossref","first-page":"333","DOI":"10.1016\/0020-0190(94)00163-4","article-title":"A complete equational axiomatisation for prefix iteration","volume":"52","author":"Fokkink","year":"1994","journal-title":"Information Processing Letters"},{"key":"10.1016\/S1571-0661(05)82501-0_BIB16","doi-asserted-by":"crossref","unstructured":"R.J. van Glabbeek. Axiomatizing flat iteration. In A. Mazurkiewicz and J. Winkowski, editors, Proceedings CONCUR '97, number 1243 in Lecture Notes in Computer Science, pages 228-242. Springer Verlag, 1997.","DOI":"10.1007\/3-540-63141-0_16"},{"issue":"3","key":"10.1016\/S1571-0661(05)82501-0_BIB17","doi-asserted-by":"crossref","first-page":"555","DOI":"10.1145\/233551.233556","article-title":"Branching time and abstraction in bisimulation semantics","volume":"43","author":"van Glabbeek","year":"1996","journal-title":"Journal of the ACM"},{"year":"1985","series-title":"Communicating Sequential Processes","author":"Hoare","key":"10.1016\/S1571-0661(05)82501-0_BIB18"},{"year":"1989","series-title":"Communication and Concurrency","author":"Milner","key":"10.1016\/S1571-0661(05)82501-0_BIB19"},{"key":"10.1016\/S1571-0661(05)82501-0_BIB20","unstructured":"G.D. Plotkin. An operational semantics for CSP. In D. Bj\u00f8rner, editor, Proceedings Conference on Formal Description of Programming Concepts II, pages 199-225. North-Holland, Amsterdam, 1983."},{"key":"10.1016\/S1571-0661(05)82501-0_BIB21","doi-asserted-by":"crossref","first-page":"163","DOI":"10.1016\/S0168-0072(97)00036-5","article-title":"Nonaxiomatisability of equivalences over finite state processes","volume":"90","author":"Sewell","year":"1997","journal-title":"Annals of Pure and Applied Logic"},{"key":"10.1016\/S1571-0661(05)82501-0_BIB22","unstructured":"J.J. Vereijken. Discrete-Time Process Algebra. PhD thesis, Eindhoven University of Technology, 1997."},{"issue":"2","key":"10.1016\/S1571-0661(05)82501-0_BIB23","doi-asserted-by":"crossref","first-page":"287","DOI":"10.1016\/S0304-3975(96)00250-2","article-title":"The algebra of communicating processes with empty process","volume":"177","author":"Vrancken","year":"1997","journal-title":"Theoretical Computer Science"}],"container-title":["Electronic Notes in Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S1571066105825010?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S1571066105825010?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:53Z","timestamp":1761610133000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S1571066105825010"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2003,2]]},"references-count":23,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2003,2]]}},"alternative-id":["S1571066105825010"],"URL":"https:\/\/doi.org\/10.1016\/s1571-0661(05)82501-0","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":"Embedding Untimed into Timed Process Algebra; the Case for Explicit Termination","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)82501-0","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"}]}}