{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,16]],"date-time":"2026-04-16T09:59:01Z","timestamp":1776333541457,"version":"3.51.2"},"publisher-location":"Berlin, Heidelberg","reference-count":50,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540555643","type":"print"},{"value":"9783540472186","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1992]]},"DOI":"10.1007\/bfb0031988","type":"book-chapter","created":{"date-parts":[[2005,12,11]],"date-time":"2005-12-11T06:36:29Z","timestamp":1134282989000},"page":"74-106","source":"Crossref","is-referenced-by-count":214,"title":["Logics and models of real time: A survey"],"prefix":"10.1007","author":[{"given":"Rajeev","family":"Alur","sequence":"first","affiliation":[]},{"given":"Thomas A.","family":"Henzinger","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2005,6,26]]},"reference":[{"key":"4_CR1","doi-asserted-by":"crossref","unstructured":"M. Abadi. Temporal-Logic Theorem Proving. PhD thesis, Stanford University, 1987.","DOI":"10.21236\/ADA325959"},{"key":"4_CR2","doi-asserted-by":"crossref","unstructured":"R. Alur, C. Courcoubetis, and D.L. Dill. Model checking for real-time systems. In Proceedings of the Fifth Annual Symposium on Logic in Computer Science, pages 414\u2013425. IEEE Computer Society Press, 1990.","DOI":"10.1109\/LICS.1990.113766"},{"key":"4_CR3","doi-asserted-by":"crossref","unstructured":"R. Alur and D.L. Dill. Automata for modeling real-time systems. In M.S. Paterson, editor, ICALP 90: Automata, Languages, and Programming, Lecture Notes in Computer Science 443, pages 322\u2013335. Springer-Verlag, 1990.","DOI":"10.1007\/BFb0032042"},{"key":"4_CR4","doi-asserted-by":"crossref","unstructured":"R. Alur, T. Feder, and T.A. Henzinger. The benefits of relaxing punctuality. In Proceedings of the Tenth Annual Symposium on Principles of Distributed Computing, pages 139\u2013152. ACM Press, 1991.","DOI":"10.1145\/112600.112613"},{"key":"4_CR5","doi-asserted-by":"crossref","unstructured":"R. Alur and T.A. Henzinger. A really temporal logic. In Proceedings of the 30th Annual Symposium on Foundations of Computer Science, pages 164\u2013169. IEEE Computer Society Press, 1989.","DOI":"10.1109\/SFCS.1989.63473"},{"key":"4_CR6","doi-asserted-by":"crossref","unstructured":"R. Alur and T.A. Henzinger. Real-time logics: complexity and expressiveness. In Proceedings of the Fifth Annual Symposium on Logic in Computer Science, pages 390\u2013401. IEEE Computer Society Press, 1990.","DOI":"10.1109\/LICS.1990.113764"},{"issue":"3","key":"4_CR7","first-page":"6","volume":"22","author":"R. Alur","year":"1991","unstructured":"R. Alur and T.A. Henzinger. Time for logic. SIGACT News, 22(3):6\u201312, 1991.","journal-title":"SIGACT News"},{"key":"4_CR8","unstructured":"R. Alur. Techniques for Automatic Verification of Real-time Systems. PhD thesis, Stanford University, 1991."},{"key":"4_CR9","doi-asserted-by":"crossref","unstructured":"A. Bernstein and P.K. Harter, Jr. Proving real-time properties of programs with temporal logic. In Proceedings of the Eighth Annual Symposium on Operating System Principles, pages 1\u201311. ACM Press, 1981.","DOI":"10.1145\/800216.806585"},{"key":"4_CR10","doi-asserted-by":"crossref","unstructured":"M. Ben-Ari, Z. Manna, and A. Pnueli. The temporal logic of branching time. In Proceedings of the Eighth Annual Symposium on Principles of Programming Languages, pages 164\u2013176. ACM Press, 1981.","DOI":"10.1145\/567532.567551"},{"issue":"2","key":"4_CR11","doi-asserted-by":"publisher","first-page":"244","DOI":"10.1145\/5397.5399","volume":"8","author":"E.M. Clarke","year":"1986","unstructured":"E.M. Clarke, E.A. Emerson, and A.P. Sistla. Automatic verification of finite-state concurrent systems using temporal-logic specifications. ACM Transactions on Programming Languages and Systems, 8(2):244\u2013263, 1986.","journal-title":"ACM Transactions on Programming Languages and Systems"},{"key":"4_CR12","doi-asserted-by":"crossref","unstructured":"D.L. Dill. Timing assumptions and verification of finite-state concurrent systems. In J. Sifakis, editor, CAV 89: Automatic Verification Methods for Finite-state Systems, Lecture Notes in Computer Science 407, pages 197\u2013212. Springer-Verlag, 1989.","DOI":"10.1007\/3-540-52148-8_17"},{"issue":"3","key":"4_CR13","doi-asserted-by":"publisher","first-page":"241","DOI":"10.1016\/0167-6423(83)90017-5","volume":"2","author":"E.A. Emerson","year":"1982","unstructured":"E.A. Emerson and E.M. Clarke. Using branching-time temporal logic to synthesize synchronization skeletons. Science of Computer Programming, 2(3):241\u2013266, 1982.","journal-title":"Science of Computer Programming"},{"key":"4_CR14","first-page":"995","volume-title":"Handbook of Theoretical Computer Science, volume B","author":"E.A. Emerson","year":"1990","unstructured":"E.A. Emerson. Temporal and modal logic. In J. van Leeuwen, editor, Handbook of Theoretical Computer Science, volume B, pages 995\u20131072. Elsevier Science Publishers (North-Holland), 1990."},{"key":"4_CR15","unstructured":"E.A. Emerson, A.K. Mok, A.P. Sistla, and J. Srinivasan. Quantitative temporal reasoning. Presented at the First Annual Workshop on Computer-aided Verification, Grenoble, France, 1989."},{"key":"4_CR16","doi-asserted-by":"crossref","unstructured":"D. Gabbay, A. Pnueli, S. Shelah, and J. Stavi. On the temporal analysis of fairness. In Proceedings of the Seventh Annual Symposium on Principles of Programming Languages, pages 163\u2013173. ACM Press, 1980.","DOI":"10.1145\/567446.567462"},{"issue":"5","key":"4_CR17","doi-asserted-by":"crossref","first-page":"494","DOI":"10.1109\/TSE.1981.231111","volume":"SE-7","author":"V.H. Haase","year":"1981","unstructured":"V.H. Haase. Real-time behavior of programs. IEEE Transactions on Software Engineering, SE-7(5):494\u2013501, 1981.","journal-title":"IEEE Transactions on Software Engineering"},{"key":"4_CR18","volume-title":"Master's thesis","author":"E. Harel","year":"1988","unstructured":"E. Harel. Temporal analysis of real-time systems. Master's thesis, The Weizmann Institute of Science, Rehovot, Israel, 1988."},{"key":"4_CR19","doi-asserted-by":"crossref","unstructured":"T.A. Henzinger. Half-order modal logic: how to prove real-time properties. In Proceedings of the Ninth Annual Symposium on Principles of Distributed Computing, pages 281\u2013296. ACM Press, 1990.","DOI":"10.1145\/93385.93429"},{"key":"4_CR20","doi-asserted-by":"crossref","unstructured":"T.A. Henzinger. Sooner is safer than later. Technical report, Stanford University, 1991.","DOI":"10.21236\/ADA325549"},{"key":"4_CR21","unstructured":"T.A. Henzinger. The Temporal Specification and Verification of Real-time Systems. PhD thesis, Stanford University, 1991."},{"key":"4_CR22","doi-asserted-by":"crossref","unstructured":"E. Harel, O. Lichtenstein, and A. Pnueli. Explicit-clock temporal logic. In Proceedings of the Fifth Annual Symposium on Logic in Computer Science, pages 402\u2013413. IEEE Computer Society Press, 1990.","DOI":"10.1109\/LICS.1990.113765"},{"key":"4_CR23","doi-asserted-by":"crossref","unstructured":"T.A. Henzinger, Z. Manna, and A. Pnueli. An interleaving model for real time. In Proceedings of the Fifth Jerusalem Conference on Information Technology, pages 717\u2013730. IEEE Computer Society Press, 1990.","DOI":"10.21236\/ADA326062"},{"key":"4_CR24","doi-asserted-by":"crossref","unstructured":"T.A. Henzinger, Z. Manna, and A. Pnueli. Temporal proof methodologies for real-time systems. In Proceedings of the 18th Annual Symposium on Principles of Programming Languages, pages 353\u2013366. ACM Press, 1991.","DOI":"10.1145\/99583.99629"},{"key":"4_CR25","volume-title":"PhD thesis","author":"J. Hooman","year":"1991","unstructured":"J. Hooman. Specification and Compositional Verification of Real-time Systems PhD thesis, Technische Universiteit Eindhoven, The Netherlands, 1991."},{"key":"4_CR26","doi-asserted-by":"crossref","unstructured":"J. Hooman and J. Widom. A temporal-logic-based compositional proof system for real-time message passing. In E. Odijk, M. Rem, and J.-C. Syre, editors, PARLE 89: Parallel Architectures and Languages Europe, vol. II, Lecture Notes in Computer Science 366, pages 424\u2013441. Springer-Verlag, 1989.","DOI":"10.1007\/3-540-51285-3_56"},{"key":"4_CR27","doi-asserted-by":"crossref","unstructured":"R. Koymans and W.-P. de Roever. Examples of a real-time temporal specification. In B.D. Denvir, W.T. Harwood, M.I. Jackson, and M.J. Wray, editors, The Analysis of Concurrent Systems, Lecture Notes in Computer Science 207, pages 231\u2013252. Springer-Verlag, 1985.","DOI":"10.1007\/3-540-16047-7_50"},{"issue":"7","key":"4_CR28","doi-asserted-by":"publisher","first-page":"371","DOI":"10.1145\/360248.360251","volume":"19","author":"R.M. Keller","year":"1976","unstructured":"R.M. Keller. Formal verification of parallel programs. Communications of the ACM, 19(7):371\u2013384, 1976.","journal-title":"Communications of the ACM"},{"issue":"4","key":"4_CR29","doi-asserted-by":"publisher","first-page":"255","DOI":"10.1007\/BF01995674","volume":"2","author":"R. Koymans","year":"1990","unstructured":"R. Koymans. Specifying real-time properties with metric temporal logic. Real-time Systems, 2(4):255\u2013299, 1990.","journal-title":"Real-time Systems"},{"key":"4_CR30","doi-asserted-by":"crossref","unstructured":"R. Koymans, J. Vytopil, and W.-P. de Roever. Real-time programming and asynchronous message passing. In Proceedings of the Second Annual Symposium on Principles of Distributed Computing, pages 187\u2013197. ACM Press, 1983.","DOI":"10.1145\/800221.806721"},{"key":"4_CR31","unstructured":"L. Lamport and M. Abadi. Refining and composing real-time specifications. This volume."},{"key":"4_CR32","doi-asserted-by":"crossref","unstructured":"N.A. Lynch and H. Attiya. Using mappings to prove timing properties. In Proceedings of the Ninth Annual Symposium on Principles of Distributed Computing, pages 265\u2013280. ACM Press, 1990.","DOI":"10.1145\/93385.93428"},{"key":"4_CR33","first-page":"657","volume-title":"Information Processing 83: Proceedings of the Ninth IFIP World Computer Congress","author":"L. Lamport","year":"1983","unstructured":"L. Lamport. What good is temporal logic? In R.E.A. Mason, editor, Information Processing 83: Proceedings of the Ninth IFIP World Computer Congress, pages 657\u2013668. Elsevier Science Publishers (North-Holland), 1983."},{"key":"4_CR34","volume-title":"Technical report","author":"L. Lamport","year":"1991","unstructured":"L. Lamport. The temporal logic of actions. Technical report, DEC Systems Research Center, Palo Alto, California, 1991."},{"key":"4_CR35","doi-asserted-by":"crossref","unstructured":"H.R. Lewis. A logic of concrete time intervals. In Proceedings of the Fifth Annual Symposium on Logic in Computer Science, pages 380\u2013389. IEEE Computer Society Press, 1990.","DOI":"10.1109\/LICS.1990.113763"},{"key":"4_CR36","doi-asserted-by":"crossref","unstructured":"O. Lichtenstein, A. Pnueli, and L.D. Zuck. The glory of the past. In R. Parikh, editor, Logics of Programs, Lecture Notes in Computer Science 193, pages 196\u2013218. Springer-Verlag, 1985.","DOI":"10.1007\/3-540-15648-8_16"},{"key":"4_CR37","doi-asserted-by":"crossref","unstructured":"Z. Manna and A. Pnueli. Proving precedence properties: the temporal way. In J. Diaz, editor, ICALP 83: Automata, Languages, and Programming, Lecture Notes in Computer Science 154, pages 491\u2013512. Springer-Verlag, 1983.","DOI":"10.1007\/BFb0036932"},{"key":"4_CR38","doi-asserted-by":"crossref","unstructured":"Z. Manna and A. Pnueli. The anchored version of the temporal framework. In J.W. de Bakker, W.-P. de Roever, and G. Rozenberg, editors, Linear Time, Branching Time, and Partial Order in Logics and Models for Concurrency, Lecture Notes in Computer Science 354, pages 201\u2013284. Springer-Verlag, 1989.","DOI":"10.1007\/BFb0013024"},{"key":"4_CR39","unstructured":"X. Nicollin, J. Sifakis, and S. Yovine. From ATP to timed graphs and hybrid systems. This volume."},{"key":"4_CR40","unstructured":"J.S. Ostroff. Temporal Logic of Real-time Systems. Research Studies Press, 1990."},{"key":"4_CR41","doi-asserted-by":"crossref","unstructured":"A. Pnueli and W.-P. de Roever. Rendez-vous with Ada: a proof-theoretical view. In Proceedings of the SIGPLAN AdaTEC Conference on Ada, pages 129\u2013137. ACM Press, 1982.","DOI":"10.1145\/3304133.3304152"},{"key":"4_CR42","doi-asserted-by":"crossref","unstructured":"A. Pnueli and E. Harel. Applications of temporal logic to the specification of real-time systems. In M. Joseph, editor, Formal Techniques in Real-time and Fault-tolerant Systems, Lecture Notes in Computer Science 331, pages 84\u201398. Springer-Verlag, 1988.","DOI":"10.1007\/3-540-50302-1_4"},{"key":"4_CR43","doi-asserted-by":"crossref","unstructured":"A. Pnueli. The temporal logic of programs. In Proceedings of the 18th Annual Symposium on Foundations of Computer Science, pages 46\u201357. IEEE Computer Society Press, 1977.","DOI":"10.1109\/SFCS.1977.32"},{"key":"4_CR44","doi-asserted-by":"crossref","unstructured":"A. Pnueli. Applications of temporal logic to the specification and verification of reactive systems: a survey of current trends. In J.W. de Bakker, W.-P. de Roever, and G. Rozenberg, editors, Current Trends in Concurrency, Lecture Notes in Computer Science 224, pages 510\u2013584. Springer-Verlag, 1986.","DOI":"10.1007\/BFb0027047"},{"key":"4_CR45","unstructured":"H. Rogers, Jr. Theory of Recursive Functions and Effective Computability. McGraw-Hill Book Company, 1967."},{"key":"4_CR46","volume-title":"Master's thesis","author":"D. Ron","year":"1984","unstructured":"D. Ron. Temporal verification of communication protocols. Master's thesis, The Weizmann Institute of Science, Rehovot, Israel, 1984."},{"issue":"2","key":"4_CR47","doi-asserted-by":"publisher","first-page":"61","DOI":"10.1007\/BF01667079","volume":"2","author":"A.U. Shankar","year":"1987","unstructured":"A.U. Shankar and S. Lam. Time-dependent distributed systems: proving safety, liveness, and timing properties. Distributed Computing, 2(2):61\u201379, 1987.","journal-title":"Distributed Computing"},{"key":"4_CR48","doi-asserted-by":"crossref","unstructured":"D.E. Shasha, A. Pnueli, and W. Ewald. Temporal verification of carrier-sense local area network protocols. In Proceedings of the 11th Annual Symposium on Principles of Programming Languages, pages 54\u201365. ACM Press, 1984.","DOI":"10.1145\/800017.800516"},{"key":"4_CR49","first-page":"133","volume-title":"Handbook of Theoretical Computer Science, volume B","author":"W. Thomas","year":"1990","unstructured":"W. Thomas. Automata on infinite objects. In J. van Leeuwen, editor, Handbook of Theoretical Computer Science, volume B, pages 133\u2013191. Elsevier Science Publishers (North-Holland), 1990."},{"issue":"1\/2","key":"4_CR50","doi-asserted-by":"publisher","first-page":"72","DOI":"10.1016\/S0019-9958(83)80051-5","volume":"56","author":"P. Wolper","year":"1983","unstructured":"P. Wolper. Temporal logic can be more expressive. Information and Control, 56(1\/2):72\u201399, 1983.","journal-title":"Information and Control"}],"container-title":["Lecture Notes in Computer Science","Real-Time: Theory in Practice"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BFb0031988","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,4,11]],"date-time":"2020-04-11T13:47:54Z","timestamp":1586612874000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BFb0031988"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1992]]},"ISBN":["9783540555643","9783540472186"],"references-count":50,"URL":"https:\/\/doi.org\/10.1007\/bfb0031988","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[1992]]}}}