{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,28]],"date-time":"2025-10-28T00:11:35Z","timestamp":1761610295659,"version":"build-2065373602"},"reference-count":25,"publisher":"Elsevier BV","license":[{"start":{"date-parts":[[1997,1,1]],"date-time":"1997-01-01T00:00:00Z","timestamp":852076800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[1997,1,1]],"date-time":"1997-01-01T00:00:00Z","timestamp":852076800000},"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":6053,"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":[[1997]]},"DOI":"10.1016\/s1571-0661(05)80476-1","type":"journal-article","created":{"date-parts":[[2005,5,25]],"date-time":"2005-05-25T08:37:08Z","timestamp":1117010228000},"page":"248-261","update-policy":"https:\/\/doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":2,"special_numbering":"C","title":["On Expressive Completeness of Duration and Mean Value Calculi (Extended Abstract)"],"prefix":"10.1016","volume":"7","author":[{"given":"Alexander","family":"Rabinovich","sequence":"first","affiliation":[],"role":[{"role":"author","vocab":"crossref"}]}],"member":"78","reference":[{"issue":"2","key":"10.1016\/S1571-0661(05)80476-1_BIB1","doi-asserted-by":"crossref","first-page":"115","DOI":"10.1305\/ndjfl\/1093870820","article-title":"The decision problem for linear temporal logic","volume":"26","author":"Burgess","year":"1985","journal-title":"Notre Dame J. Formal Logic"},{"year":"1994","series-title":"Temporal Logic","author":"Gabbay","key":"10.1016\/S1571-0661(05)80476-1_BIB2"},{"key":"10.1016\/S1571-0661(05)80476-1_BIB3","series-title":"7th ACM Symp. on Principles of Prog. Lang","first-page":"163","article-title":"On the temporal analysis of fairness","author":"Gabbay","year":"1980"},{"key":"10.1016\/S1571-0661(05)80476-1_BIB4","doi-asserted-by":"crossref","unstructured":"Y. Gurevich. Monadic second order theories. In J. Barwise and S. Feferman eds., Model theoretical logics, pp. 479-506, Springer Verlag.","DOI":"10.1017\/9781316717158.019"},{"key":"10.1016\/S1571-0661(05)80476-1_BIB5","series-title":"LICS","first-page":"279","article-title":"A prepositional modal logic of time intervals","author":"Halperin","year":"1986"},{"key":"10.1016\/S1571-0661(05)80476-1_BIB6","unstructured":"M. R. Hansen and Zhou Chaochen. Duration Calculus: Logical Foundations. Technical Report, Technical University of Denmark, 1996."},{"key":"10.1016\/S1571-0661(05)80476-1_BIB7","unstructured":"H. Kamp. Tense logic and the theory of linear order. Ph.D. Thesis, Un. of California at LA, 1968."},{"issue":"3","key":"10.1016\/S1571-0661(05)80476-1_BIB8","doi-asserted-by":"crossref","first-page":"872","DOI":"10.1145\/177492.177726","article-title":"The Temporal Logic of Actions","volume":"16","author":"Lamport","year":"1994","journal-title":"ACM Transactions on Programming Languages and Systems"},{"key":"10.1016\/S1571-0661(05)80476-1_BIB9","unstructured":"A. R. Meyer and L. Stockmeyer. Non-elementary word problems in automata and logic. In Proc. AMS Symposium on Complexity of Computation, 1973."},{"year":"1971","series-title":"Counter-free automata","author":"McNaughton","key":"10.1016\/S1571-0661(05)80476-1_BIB10"},{"year":"1976","series-title":"Mathematical Logic","author":"Monk","key":"10.1016\/S1571-0661(05)80476-1_BIB11"},{"key":"10.1016\/S1571-0661(05)80476-1_BIB12","unstructured":"B. Moszkowski. Reasoning about Digital Circuits. Ph. D thesis, Stanford, 1983."},{"key":"10.1016\/S1571-0661(05)80476-1_BIB13","doi-asserted-by":"crossref","unstructured":"P. Pandya. Some extensions to Propositional Mean Value Calculus: Expressiveness and Decidability. In Proceedings of Computer Science Logic 1995, LNCS.","DOI":"10.1007\/3-540-61377-3_52"},{"key":"10.1016\/S1571-0661(05)80476-1_BIB14","article-title":"A Universal Continuous Time Specification Formalism","author":"Rabinovich","year":"1996","journal-title":"Submitted for publication"},{"key":"10.1016\/S1571-0661(05)80476-1_BIB15","unstructured":"A. Rabinovich. On Translation of Temporal Logic of Actions into Monadic Second Order Logic. To appear in Theoretical Computer Science."},{"key":"10.1016\/S1571-0661(05)80476-1_BIB16","unstructured":"A. Rabinovich. Star Free expressions over the reals. To appear in Theoretical Computer Science."},{"key":"10.1016\/S1571-0661(05)80476-1_BIB17","doi-asserted-by":"crossref","unstructured":"A. Rabinovich. Non-elementary Lower Bound for Propositional Duration Calculus. Technical Report, Tel-Aviv University, May 1997.","DOI":"10.1016\/S0020-0190(98)00027-1"},{"key":"10.1016\/S1571-0661(05)80476-1_BIB18","unstructured":"A. Ravn. Design of Embedded Real Time Computing Systems, Technical Report, Technical University of Denmark, 1995."},{"key":"10.1016\/S1571-0661(05)80476-1_BIB19","doi-asserted-by":"crossref","DOI":"10.1109\/32.210306","article-title":"Specifying and verifying requirement of real time systems","author":"Ravn","year":"1993","journal-title":"IEEE Transaction on Software Eng."},{"key":"10.1016\/S1571-0661(05)80476-1_BIB20","doi-asserted-by":"crossref","unstructured":"J. Skakkebak, A. Ravn, H. Richel, Zhou Chaochen. Specification of Embedded Real time Systems. In Proc. of 1992 Euromicro workshop on Real Time Systems. IEEE Computer Society Press.","DOI":"10.1109\/EMWRT.1992.637481"},{"key":"10.1016\/S1571-0661(05)80476-1_BIB21","doi-asserted-by":"crossref","first-page":"349","DOI":"10.2307\/1971037","article-title":"The monadic theory of order","volume":"102","author":"Shelah","year":"1975","journal-title":"Ann. of Math."},{"key":"10.1016\/S1571-0661(05)80476-1_BIB22","unstructured":"L. Stockmeyer. The complexity of decision problems in automata and logic, Ph.D. Thesis, MIT, 1974."},{"key":"10.1016\/S1571-0661(05)80476-1_BIB23","first-page":"58","article-title":"Decidability and undecidablity results for Duration Calculus","volume":"665","author":"Chaochen","year":"1993"},{"issue":"5","key":"10.1016\/S1571-0661(05)80476-1_BIB24","doi-asserted-by":"crossref","first-page":"269","DOI":"10.1016\/0020-0190(91)90122-X","article-title":"A calculus of Duration","volume":"40","author":"Chaochen","year":"1991","journal-title":"Information processing Letters"},{"key":"10.1016\/S1571-0661(05)80476-1_BIB25","series-title":"A classical Mind: Essays in Honor of C. A. R. Hoare","first-page":"431","article-title":"A mean value calculus of duration","author":"Chaochen","year":"1994"}],"container-title":["Electronic Notes in Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S1571066105804761?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S1571066105804761?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:06:38Z","timestamp":1761609998000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S1571066105804761"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1997]]},"references-count":25,"alternative-id":["S1571066105804761"],"URL":"https:\/\/doi.org\/10.1016\/s1571-0661(05)80476-1","relation":{},"ISSN":["1571-0661"],"issn-type":[{"type":"print","value":"1571-0661"}],"subject":[],"published":{"date-parts":[[1997]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"On Expressive Completeness of Duration and Mean Value Calculi (Extended Abstract)","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)80476-1","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"converted-article","name":"content_type","label":"Content Type"},{"value":"Copyright \u00a9 1997 Elsevier B.V.","name":"copyright","label":"Copyright"}]}}