{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,9]],"date-time":"2025-10-09T21:13:04Z","timestamp":1760044384364},"reference-count":34,"publisher":"Elsevier BV","issue":"1","license":[{"start":{"date-parts":[[2001,2,1]],"date-time":"2001-02-01T00:00:00Z","timestamp":980985600000},"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":4549,"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,2]]},"DOI":"10.1016\/s0304-3975(00)00091-8","type":"journal-article","created":{"date-parts":[[2002,7,25]],"date-time":"2002-07-25T10:45:40Z","timestamp":1027593940000},"page":"119-152","source":"Crossref","is-referenced-by-count":8,"title":["Verification, refinement and scheduling of real-time programs"],"prefix":"10.1016","volume":"253","author":[{"given":"Zhiming","family":"Liu","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Mathai","family":"Joseph","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"issue":"2","key":"10.1016\/S0304-3975(00)00091-8_BIB1","doi-asserted-by":"crossref","first-page":"253","DOI":"10.1016\/0304-3975(91)90224-P","article-title":"The existence of refinement mappings","volume":"83","author":"Abadi","year":"1991","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/S0304-3975(00)00091-8_BIB2","series-title":"Real-Time","article-title":"An old-fashioned recipe for real-time","volume":"Vol. 600","author":"Abadi","year":"1992"},{"key":"10.1016\/S0304-3975(00)00091-8_BIB3","doi-asserted-by":"crossref","first-page":"593","DOI":"10.1007\/BF00291051","article-title":"A calculus of refinements for program derivations","volume":"25","author":"Back","year":"1988","journal-title":"Acta Inform."},{"key":"10.1016\/S0304-3975(00)00091-8_BIB4","doi-asserted-by":"crossref","first-page":"593","DOI":"10.1007\/BF00291051","article-title":"A calculus of refinements for program derivations","volume":"25","author":"Back","year":"1988","journal-title":"Acta Inform."},{"key":"10.1016\/S0304-3975(00)00091-8_BIB5","unstructured":"A. Burns, R. Davis, S. Punnekkat, Feasibility analysis of fault-tolerant real-time tasks, Technical Report, Department of Computer Science, University of York, 1995."},{"key":"10.1016\/S0304-3975(00)00091-8_BIB6","series-title":"Real-Time Systems","first-page":"32","article-title":"Advanced fixed priority scheduling","author":"Burns","year":"1996"},{"key":"10.1016\/S0304-3975(00)00091-8_BIB7","series-title":"Parallel Program Design","author":"Chandy","year":"1988"},{"key":"10.1016\/S0304-3975(00)00091-8_BIB8","series-title":"Proc. 4th Internat. Conf. on Computer Aided Verification","first-page":"44","article-title":"Mechanical verification of concurrent systems with TLA","volume":"Vol. 663","author":"Engberg","year":"1992"},{"key":"10.1016\/S0304-3975(00)00091-8_BIB9","series-title":"Mathematical Aspects of Computer Science","first-page":"19","article-title":"Assigning meanings to programs","volume":"Vol. 19","author":"Floyd","year":"1967"},{"key":"10.1016\/S0304-3975(00)00091-8_BIB10","doi-asserted-by":"crossref","unstructured":"L. Fix, F.B. Schneider, Reasoning about programs by exploiting the environment, Technical Report TR94-1409, Department of Computer Science, Cornell University, Ithaca, New York 14853, 1994.","DOI":"10.21236\/ADA275852"},{"key":"10.1016\/S0304-3975(00)00091-8_BIB11","doi-asserted-by":"crossref","unstructured":"T. Henzinger, Z. Manna, A. Pnueli, Temporal proof methodologies for real-time systems, Proc. 8th ACM Annu. Symp. on Principles of Programming Languages, ACM Press, New York, USA, 1991, pp. 269\u2013276.","DOI":"10.1145\/99583.99629"},{"issue":"2","key":"10.1016\/S0304-3975(00)00091-8_BIB12","doi-asserted-by":"crossref","first-page":"273","DOI":"10.1006\/inco.1994.1060","article-title":"Temporal proof methodologies for timed transition systems","volume":"112","author":"Henzinger","year":"1994","journal-title":"Inform. Comput."},{"key":"10.1016\/S0304-3975(00)00091-8_BIB13","series-title":"Specification and Compositional Verification of Real-Time Systems","volume":"Vol. 558","author":"Hooman","year":"1991"},{"key":"10.1016\/S0304-3975(00)00091-8_BIB14","series-title":"Proc. 4th Internat. Symp. on Formal Techniques in Real-Time and Fault-Tolerant Systems","first-page":"279","article-title":"Dynamic scheduling in the presence of faults","volume":"Vol. 1135","author":"Janowski","year":"1996"},{"issue":"5","key":"10.1016\/S0304-3975(00)00091-8_BIB15","doi-asserted-by":"crossref","first-page":"390","DOI":"10.1093\/comjnl\/29.5.390","article-title":"Finding Response times in a real-time system","volume":"29","author":"Joseph","year":"1986","journal-title":"Comput. J."},{"issue":"7","key":"10.1016\/S0304-3975(00)00091-8_BIB16","doi-asserted-by":"crossref","first-page":"371","DOI":"10.1145\/360248.360251","article-title":"Formal verification of parallel programs","volume":"19","author":"Keller","year":"1976","journal-title":"Commun. ACM"},{"key":"10.1016\/S0304-3975(00)00091-8_BIB17","series-title":"Hybrid Systems III","article-title":"Verifying clocked transition systems","volume":"Vol. 1066","author":"Kesten","year":"1996"},{"issue":"3","key":"10.1016\/S0304-3975(00)00091-8_BIB18","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 Trans. Program. Languages Systems"},{"key":"10.1016\/S0304-3975(00)00091-8_BIB19","doi-asserted-by":"crossref","unstructured":"Z. Liu, Fault-Tolerant Programming by Transformations, Ph.D. Thesis, Department of Computer Science, University of Warwick, 1991.","DOI":"10.1007\/978-94-009-0429-3_5"},{"key":"10.1016\/S0304-3975(00)00091-8_BIB20","series-title":"Formal Techniques in Real-Time and Fault Tolerant Systems","first-page":"137","article-title":"Specifying and verifying recovery in asynchronous communicating systems","author":"Liu","year":"1993"},{"key":"10.1016\/S0304-3975(00)00091-8_BIB21","series-title":"Proc. 3rd Internat. Symp. on Formal Techniques in Real-Time and Fault Tolerant Systems","first-page":"529","article-title":"Stepwise development of fault-tolerant reactive systems","volume":"Vol. 863","author":"Liu","year":"1994"},{"key":"10.1016\/S0304-3975(00)00091-8_BIB22","unstructured":"Z. Liu, M. Joseph, Verification of fault-tolerance and real-time, in: Proc. 26th Annu. Internat. Symp. on Fault-Tolerant Computing, Sendai, IEEE Computer Society Press, Silver Spring, MD, 1996, pp. 220\u2013229."},{"key":"10.1016\/S0304-3975(00)00091-8_BIB23","series-title":"Proc. Transformation-Based Reactive Systems Development, Arts\u201997","first-page":"294","article-title":"Formalzing real-time scheduling as program refinement","volume":"Vol. 1231","author":"Liu","year":"1997"},{"issue":"5","key":"10.1016\/S0304-3975(00)00091-8_BIB24","doi-asserted-by":"crossref","first-page":"510","DOI":"10.1007\/BF01211630","article-title":"Verification of schedulability","volume":"7","author":"Liu","year":"1995","journal-title":"Formal Aspects Comput."},{"issue":"1","key":"10.1016\/S0304-3975(00)00091-8_BIB25","doi-asserted-by":"crossref","first-page":"40","DOI":"10.1145\/321738.321743","article-title":"Scheduling algorithms for multiprogramming in a hard real-time environment","volume":"20","author":"Liu","year":"1973","journal-title":"J. ACM"},{"key":"10.1016\/S0304-3975(00)00091-8_BIB26","unstructured":"Z. Liu, A.P. Ravn, X. Li, Compositional inductive verification of duration properties of real-time systems, Technical Report 1997\/30, Department of Maths and Computer Science, University of Leicester, 1997."},{"key":"10.1016\/S0304-3975(00)00091-8_BIB27","series-title":"Proc. IFIP Working Conf. on Programming Concepts and Methods, PROCOMET\u201998 Shelter Island, New York, USA","first-page":"327","article-title":"Verifying duration properties of timed transition systems","author":"Liu","year":"1998"},{"key":"10.1016\/S0304-3975(00)00091-8_BIB28","doi-asserted-by":"crossref","unstructured":"J. Lehoczky, L. Sha, Y. Ding, The rate-monotonic scheduling algorithms: exact characterisation and average case behaviour, in: Proc. 10th IEEE Real-time Systems Symposium, Santa Monica, CA, USA, IEEE Computer Society Press, Silver Spring, MD, 1989, pp. 261\u2013270.","DOI":"10.1109\/REAL.1989.63567"},{"key":"10.1016\/S0304-3975(00)00091-8_BIB29","doi-asserted-by":"crossref","unstructured":"G. Lowe, H. Zedan, Refinement of complex systems: a case study, Technical Report PRG-TR-2-95, Oxford University Computing Laboratory, 1995.","DOI":"10.1093\/comjnl\/38.10.785"},{"key":"10.1016\/S0304-3975(00)00091-8_BIB30","series-title":"The Temporal Logic of Reactive and Concurrent Systems: Specification","author":"Manna","year":"1991"},{"key":"10.1016\/S0304-3975(00)00091-8_BIB31","unstructured":"Z. Manna, A. Pnueli, Clocked transition systems, Technical Report STAN-CS-TR-1566, Computer Science Department, Stanford University, 1996."},{"key":"10.1016\/S0304-3975(00)00091-8_BIB32","doi-asserted-by":"crossref","unstructured":"A. Pnueli, The temporal logic of programs, in: Proceedings of the 18th Annual Symposium on Foundations of Computer Science, U.S.A., IEEE Computer Society Press, Silver Spring, MD, 1977, pp. 46\u201357.","DOI":"10.1109\/SFCS.1977.32"},{"issue":"5","key":"10.1016\/S0304-3975(00)00091-8_BIB33","doi-asserted-by":"crossref","first-page":"269","DOI":"10.1016\/0020-0190(91)90122-X","article-title":"A calculus of durations","volume":"40","author":"Zhou","year":"1991","journal-title":"Inform. Process. Lett."},{"key":"10.1016\/S0304-3975(00)00091-8_BIB34","series-title":"Proc. 2nd Internat. Symp. on Formal Techniques in Real-Time and Fault Tolerant Systems","article-title":"Duration specifications for shared processors","volume":"Vol. 571","author":"Zhou","year":"1992"}],"container-title":["Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0304397500000918?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0304397500000918?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,27]],"date-time":"2019-04-27T20:55:44Z","timestamp":1556398544000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0304397500000918"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2001,2]]},"references-count":34,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2001,2]]}},"alternative-id":["S0304397500000918"],"URL":"https:\/\/doi.org\/10.1016\/s0304-3975(00)00091-8","relation":{},"ISSN":["0304-3975"],"issn-type":[{"value":"0304-3975","type":"print"}],"subject":[],"published":{"date-parts":[[2001,2]]}}}