{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,2]],"date-time":"2022-04-02T15:32:44Z","timestamp":1648913564363},"reference-count":34,"publisher":"Elsevier BV","issue":"1-2","license":[{"start":{"date-parts":[[2001,10,1]],"date-time":"2001-10-01T00:00:00Z","timestamp":1001894400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,7,17]],"date-time":"2013-07-17T00:00:00Z","timestamp":1374019200000},"content-version":"vor","delay-in-days":4307,"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":[[2001,10]]},"DOI":"10.1016\/s0304-3975(00)00375-3","type":"journal-article","created":{"date-parts":[[2002,7,25]],"date-time":"2002-07-25T17:22:51Z","timestamp":1027617771000},"page":"47-82","source":"Crossref","is-referenced-by-count":6,"title":["On the semantics of durational actions"],"prefix":"10.1016","volume":"269","author":[{"given":"Flavio","family":"Corradini","sequence":"first","affiliation":[]},{"given":"GianLuigi","family":"Ferrari","sequence":"additional","affiliation":[]},{"given":"Marco","family":"Pistore","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"issue":"2","key":"10.1016\/S0304-3975(00)00375-3_BIB1","doi-asserted-by":"crossref","first-page":"204","DOI":"10.1006\/inco.1993.1019","article-title":"Towards action refinement in process algebra","volume":"103","author":"Aceto","year":"1993","journal-title":"Inform. and Comput."},{"issue":"4","key":"10.1016\/S0304-3975(00)00375-3_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."},{"key":"10.1016\/S0304-3975(00)00375-3_BIB3","doi-asserted-by":"crossref","first-page":"142","DOI":"10.1007\/BF01898401","article-title":"Real time process algebra","volume":"3","author":"Baeten","year":"1991","journal-title":"Formal Aspects Comput."},{"key":"10.1016\/S0304-3975(00)00375-3_BIB4","article-title":"Real space process algebra","volume":"vol. 527","author":"Baeten","year":"1991"},{"key":"10.1016\/S0304-3975(00)00375-3_BIB5","doi-asserted-by":"crossref","first-page":"83","DOI":"10.1006\/inco.1998.2706","article-title":"A formal approach to the integration of performance aspects in the modeling and analysis of concurrent systems","volume":"144","author":"Bernardo","year":"1998","journal-title":"Inform. and Comput."},{"key":"10.1016\/S0304-3975(00)00375-3_BIB6","doi-asserted-by":"crossref","first-page":"217","DOI":"10.1016\/0304-3975(92)90185-I","article-title":"The chemical abstract machine","volume":"96","author":"Berry","year":"1992","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/S0304-3975(00)00375-3_BIB7","series-title":"Proc. 5th ICTCS","article-title":"Compositionality for processes with durational actions","author":"Corradini","year":"1995"},{"key":"10.1016\/S0304-3975(00)00375-3_BIB8","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":"Inform. and Comput."},{"issue":"1","key":"10.1016\/S0304-3975(00)00375-3_BIB9","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":"Inform. and Comput."},{"key":"10.1016\/S0304-3975(00)00375-3_BIB10","series-title":"Proc. EXPRESS\u201997 Electronic Notes on Theoretical Computer Science, vol. 7","article-title":"Eager, busy-waiting and lazy actions in timed computations","author":"Corradini","year":"1997"},{"issue":"11","key":"10.1016\/S0304-3975(00)00375-3_BIB11","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."},{"key":"10.1016\/S0304-3975(00)00375-3_BIB12","article-title":"Specification and verification of timed lazy systems","volume":"vol. 1113","author":"Corradini","year":"1996"},{"key":"10.1016\/S0304-3975(00)00375-3_BIB13","article-title":"Mobile processes with local clocks","volume":"Vol. 1192","author":"Degano","year":"1996"},{"key":"10.1016\/S0304-3975(00)00375-3_BIB14","article-title":"Dynamic matrices and the cost analysis of concurrent programs","volume":"vol. 936","author":"Ferrari","year":"1995"},{"key":"10.1016\/S0304-3975(00)00375-3_BIB15","article-title":"Petri nets models for algebraic theories of concurrency","volume":"vol. 259","author":"van Glabbeek","year":"1987"},{"key":"10.1016\/S0304-3975(00)00375-3_BIB16","unstructured":"R. van Glabbeek, P. Weijland, Branching time and abstraction in bisimulation semantics, Proc. IFIP\u201989, 1989."},{"key":"10.1016\/S0304-3975(00)00375-3_BIB17","article-title":"Equational properties of mobile ambients","volume":"vol. 1578","author":"Gordon","year":"1999"},{"key":"10.1016\/S0304-3975(00)00375-3_BIB18","doi-asserted-by":"crossref","first-page":"272","DOI":"10.1006\/inco.1995.1066","article-title":"Split and ST bisimulation semantics","volume":"118","author":"Gorrieri","year":"1995","journal-title":"Inform. and Comput"},{"issue":"1","key":"10.1016\/S0304-3975(00)00375-3_BIB19","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":"5","key":"10.1016\/S0304-3975(00)00375-3_BIB20","doi-asserted-by":"crossref","DOI":"10.1137\/0217063","article-title":"Axiomatising finite concurrent processes","volume":"17","author":"Hennessy","year":"1988","journal-title":"SIAM J. Comput."},{"key":"10.1016\/S0304-3975(00)00375-3_BIB21","unstructured":"M. Hennessy, A proof system for weak ST-bisimulation over a finite process algebra, Tech. Report 6\/91, Department of Computer Science, University of Sussex, 1991."},{"key":"10.1016\/S0304-3975(00)00375-3_BIB22","doi-asserted-by":"crossref","first-page":"221","DOI":"10.1006\/inco.1995.1041","article-title":"A process algebra for times systems","volume":"117","author":"Hennessy","year":"1995","journal-title":"Inform. and Comput."},{"key":"10.1016\/S0304-3975(00)00375-3_BIB23","unstructured":"H. Hermanns, M. Rettelbach, Syntax, semantics, equivalences, and axioms for MTIPP, Proc. PAPM\u201994, Arbeitspapere der Informatik 27-4, University of Erlangen, 1994, pp. 71\u201388."},{"key":"10.1016\/S0304-3975(00)00375-3_BIB24","series-title":"A Compositional Approach to Performance Modelling","author":"Hillston","year":"1996"},{"key":"10.1016\/S0304-3975(00)00375-3_BIB25","series-title":"Communication and Concurrency","author":"Milner","year":"1989"},{"issue":"2","key":"10.1016\/S0304-3975(00)00375-3_BIB26","doi-asserted-by":"crossref","first-page":"119","DOI":"10.1017\/S0960129500001407","article-title":"Functions as processes","volume":"2","author":"Milner","year":"1992","journal-title":"J. Math. Struct. Comput. Sci."},{"key":"10.1016\/S0304-3975(00)00375-3_BIB27","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/0890-5401(92)90008-4","article-title":"A calculus of mobile processes (Parts I and II)","volume":"100","author":"Milner","year":"1992","journal-title":"Inform. and Comput."},{"key":"10.1016\/S0304-3975(00)00375-3_BIB28","article-title":"Barbed bisimulation","volume":"vol. 623","author":"Milner","year":"1992"},{"key":"10.1016\/S0304-3975(00)00375-3_BIB29","article-title":"A temporal calculus of communicating systems","volume":"vol. 458","author":"F. Moller","year":"1990"},{"key":"10.1016\/S0304-3975(00)00375-3_BIB30","doi-asserted-by":"crossref","first-page":"131","DOI":"10.1006\/inco.1994.1083","article-title":"The algebra of timed processes ATP, Theory and application","volume":"114","author":"Nicollin","year":"1994","journal-title":"Inform. and Comput."},{"key":"10.1016\/S0304-3975(00)00375-3_BIB31","unstructured":"D. Sangiorgi, Expressing mobility in process algebras: first order and higher-order paradigms, Ph.D. Thesis, Department of Computer Science, University of Edinburgh, 1992."},{"key":"10.1016\/S0304-3975(00)00375-3_BIB32","article-title":"From rewrite rules to bisimulation congruences","volume":"vol. 1466","author":"Sewell","year":"1998"},{"key":"10.1016\/S0304-3975(00)00375-3_BIB33","doi-asserted-by":"crossref","first-page":"149","DOI":"10.1006\/inco.1995.1130","article-title":"Timed testing of concurrent systems","volume":"121","author":"Vogler","year":"1995","journal-title":"Inform. and Comput"},{"key":"10.1016\/S0304-3975(00)00375-3_BIB34","article-title":"Real time behaviour of asynchronous agents","volume":"vol. 458","author":"Yi","year":"1990"}],"container-title":["Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0304397500003753?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0304397500003753?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,25]],"date-time":"2019-04-25T00:54:00Z","timestamp":1556153640000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0304397500003753"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2001,10]]},"references-count":34,"journal-issue":{"issue":"1-2","published-print":{"date-parts":[[2001,10]]}},"alternative-id":["S0304397500003753"],"URL":"https:\/\/doi.org\/10.1016\/s0304-3975(00)00375-3","relation":{},"ISSN":["0304-3975"],"issn-type":[{"value":"0304-3975","type":"print"}],"subject":[],"published":{"date-parts":[[2001,10]]}}}