{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T22:38:10Z","timestamp":1725489490141},"publisher-location":"Berlin, Heidelberg","reference-count":21,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540414131"},{"type":"electronic","value":"9783540444503"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2000]]},"DOI":"10.1007\/3-540-44450-5_21","type":"book-chapter","created":{"date-parts":[[2007,8,16]],"date-time":"2007-08-16T04:26:08Z","timestamp":1187238368000},"page":"264-276","source":"Crossref","is-referenced-by-count":4,"title":["A Complete Fragment of Higher-Order Duration \u03bc-Calculus"],"prefix":"10.1007","author":[{"given":"Dimitar P.","family":"Guelev","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2000,11,24]]},"reference":[{"key":"21_CR1","series-title":"Lect Notes Comput Sci","doi-asserted-by":"publisher","first-page":"139","DOI":"10.1007\/3-540-46674-6_13","volume-title":"Advances in Computing Science","author":"D. Hung Van","year":"1999","unstructured":"Dang Van Hung and D. P. Guelev. Completeness and Decidability of a Fragment of Duration Calculus with Iteration. In: P.S. Thiagarajan and R. Yap (eds), Advances in Computing Science, LNCS 1742, Springer-Verlag, 1999, pp. 139\u2013150."},{"key":"21_CR2","doi-asserted-by":"crossref","unstructured":"Dang Van Hung and Wang Ji. On The Design of Hybrid Control Systems Using Automata Models. In: Chandru, V. and V. Vinay (eds.) LCNS 1180, Foundations of Software Technology and Theoretical Computer Science, 16th Conference, Hyderabad, India, December 1996, Springer, 1996.","DOI":"10.1007\/3-540-62034-6_46"},{"key":"21_CR3","series-title":"Report","volume-title":"On First Order Interval Temporal Logic","author":"B. Dutertre","year":"1995","unstructured":"Dutertre, B. On First Order Interval Temporal Logic. Report no. CSDTR-94-3 Department of Computer Science, Royal Holloway, University of London, Egham, Surrey TW20 0EX, England, 1995."},{"key":"21_CR4","unstructured":"Guelev, D. P. Iteration of Simple Formulas in Duration Calculus. Tech. report 141, UNU\/IIST, June 1998."},{"key":"21_CR5","unstructured":"Guelev, D. P. Probabilistic and Temporal Modal Logics, Ph.D. thesis, submitted, January 2000."},{"key":"21_CR6","doi-asserted-by":"crossref","unstructured":"Guelev, D. P. A Complete Fragment of Higher-Order Duration \u03bc-Calculus. Tech. Report 195, UNU\/IIST, April 2000.","DOI":"10.1007\/3-540-44450-5_21"},{"key":"21_CR7","unstructured":"He Jifeng and Xu Qiwen. Advanced Features of DC and Their Applications. Proceedings of the Symposium in Celebration of the Work of C.A.R. Hoare, Oxford, 13-15 September, 1999."},{"key":"21_CR8","series-title":"Lect Notes Comput Sci","doi-asserted-by":"publisher","first-page":"209","DOI":"10.1007\/BFb0031994","volume-title":"Real-Time: Theory and Practice","author":"M. R. Hansen","year":"1992","unstructured":"M. R. Hansen and Zhou Chaochen. Semantics and Completeness of Duration Calculus. Real-Time: Theory and Practice, LNCS 600, Springer-Verlag, 1992, pp. 209\u2013225."},{"key":"21_CR9","doi-asserted-by":"publisher","first-page":"333","DOI":"10.1016\/0304-3975(82)90125-6","volume":"27","author":"D. Kozen","year":"1983","unstructured":"Kozen, D. Results on the propositional \u03bc-calculus. TCS 27:333\u2013354, 1983.","journal-title":"TCS"},{"key":"21_CR10","doi-asserted-by":"crossref","unstructured":"Li Li and He Jifeng. A Denotational Semantics of Timed RSL using Duration Calculus. Proceedings of RTCSA\u201999, pp. 492\u2013503, IEEE Computer Society Press, 1999.","DOI":"10.1109\/RTCSA.1999.811304"},{"key":"21_CR11","volume-title":"Introduction to Mathematical Logic","author":"E. Mendelson","year":"1964","unstructured":"Mendelson, E. Introduction to Mathematical Logic. Van Nostrand, Princeton, 1964."},{"key":"21_CR12","doi-asserted-by":"crossref","unstructured":"Pandya, P. K. Some Extensions to Propositional Mean-Value Calculus. Expressiveness and Decidability. Proceedings of CSL\u201995, Springer-Verlag, 1995.","DOI":"10.1007\/3-540-61377-3_52"},{"key":"21_CR13","series-title":"Technical Report","volume-title":"A Recursive Duration Calculus","author":"P. K. Pandya","year":"1995","unstructured":"Pandya, P. K. and Y Ramakrishna. A Recursive Duration Calculus. Technical Report TCS-95\/3, TIFR, Bombay, 1995."},{"key":"21_CR14","doi-asserted-by":"crossref","unstructured":"Pandya, P. K, Wang Hanping and Xu Qiwen. Towards a Theory of Sequential Hybrid Programs. Proc. IFIP Working Conference PROCOMET\u2019 98 D. Gries and W.-P. de Roever (eds.), Chapman & Hall, 1998.","DOI":"10.1007\/978-0-387-35358-6_24"},{"key":"21_CR15","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"282","DOI":"10.1007\/BFb0055355","volume-title":"Towards a Formal Semantics of Verilog Using Duration Calculus","author":"G. Schneider","year":"1998","unstructured":"Schneider, G. and Xu Qiwen. Towards a Formal Semantics of Verilog Using Duration Calculus. Proceedings of FTRTFT\u201998, Anders P. Ravn and Hans Rischel (eds.), LNCS 1486, pp. 282\u2013293, Springer-Verlag, 1998."},{"key":"21_CR16","unstructured":"Walurkiewicz, I. A Complete Deductive System for the \u03bc-Calculus., Ph.D. Thesis, Warsaw University, 1993."},{"key":"21_CR17","unstructured":"Zhou Chaochen, D. P. Guelev and Zhan Naijun. A Higher-Order Duration Calculus. Proceedings of the Symposium in Celebration of the Work of C.A.R. Hoare, Oxford, 1999."},{"key":"21_CR18","unstructured":"Zhou Chaochen and M. Hansen Chopping a Point. Proceedings of BCS FACS 7th Refinement Workshop, Electronic Workshop in Computer Sciences, Springer-Verlag, 1996."},{"key":"21_CR19","unstructured":"Zhu Huibiao and He Jifeng. A DC-based Semantics for Verilog Tech. Report 183, UNU\/IIST, January 2000."},{"issue":"5","key":"21_CR20","doi-asserted-by":"publisher","first-page":"269","DOI":"10.1016\/0020-0190(91)90122-X","volume":"40","author":"Z. Chaochen","year":"1991","unstructured":"Zhou Chaochen, C. A. R. Hoare and A. P. Ravn. A Calculus of Durations. Information Processing Letters, 40(5), pp. 269\u2013276, 1991.","journal-title":"Information Processing Letters"},{"key":"21_CR21","doi-asserted-by":"crossref","unstructured":"Zhan Naijun. Completeness of Higher-Order Duration Calculus. Research Report 175, UNU\/IIST, August 1999.","DOI":"10.1007\/3-540-44622-2_30"}],"container-title":["Lecture Notes in Computer Science","FST TCS 2000: Foundations of Software Technology and Theoretical Computer Science"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-44450-5_21","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,4,25]],"date-time":"2020-04-25T18:37:26Z","timestamp":1587839846000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-44450-5_21"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2000]]},"ISBN":["9783540414131","9783540444503"],"references-count":21,"URL":"https:\/\/doi.org\/10.1007\/3-540-44450-5_21","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[2000]]}}}